Skip to content

Author

Zhongxiang Dai

We have 9 of 23 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#machine learning Preprint Oct 2026

CB-Orchestrator: Adaptive Workflow Optimization for LLM Agents via Contextual Bandits

Large Language Model (LLM) agents have demonstrated remarkable capabilities in tackling complex tasks through agentic workflows. However, manually designing these workflows is labor-intensive and lacks flexibility to adapt to diverse queries. While automated workflow optimization is a promising direction, existing meth...

Jia-Hang Sun, Zhi-Wei Shang, Zhi-Piao Liu et al. · 0 citations
#artificial intelligence Preprint Oct 2026

MESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional Evolution

An agent harness is the code that organizes context, maintains state, and coordinates tool calls for a language model. We study how to improve the harness under a limited evaluation budget while keeping model weights fixed. Our method, MESH-Harness, organizes each harness into functional modules with explicit role-spec...

Zhi-Wei Shang, Yun-Chen Huo, Ming-Rong Gong et al. · 0 citations
#artificial intelligence Preprint Oct 2026

GUI-HARVEST: Self-Improving GUI Agents through Evidence-Driven Harness Evolution

The executable harness surrounding a GUI model determines how observations are assembled, actions are executed, and verification, recovery, and termination are controlled. Compared with harness optimization for non-GUI agents, automatically optimizing this harness poses three coupled challenges: reconciling model inten...

Ge-Yi Yang, Zi-Kun Qu, Xiang Li et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SERA: Scale-Equalized Rollout Allocation for Maximum Likelihood Reinforcement Learning

SERA (Scale-Equalized Rollout Allocation), which redistributes a fixed rollout budget to approximately equalize these finite-rollout scaling factors and introduces a multiplicity correction to remove the additional prompt weighting induced by heterogeneous rollout counts.

Zi-Hao Chen, Fan-Xiang Xiong, Hong-Ran Ren et al. · 0 citations
#artificial intelligence Preprint Sep 2026

From Preference to Reciprocity: Decentralized Matching with Empirically Grounded LLM-agent Based Modeling

The proposed dynamic bipartite matching framework supports the advantages of decentralized matching with LLM-based behavioral modeling and online learning under incomplete information for economic simulation and computational social science research.

Wang-Xuan Fan, Xiao-Yu Nie, Zhou-Tian Shi et al. · 0 citations
Book Open access Aug 2026

CES: Combinatorial Experts Selection via Contextual Linear Bandits

This work proposes an offline-to-online combinatorial experts selection (CES) framework that leverages offline evaluation to warm-start model capability estimation and employs online learning to adapt to capability shifts and correct offline inaccuracies.

Jinkun Xu, Minghan Wang, Zhiyong Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

COBRA-Skills: Contextual Bandit-Guided Evolution for Agent Skill Optimization

COBRA-Skills is introduced, an efficient framework that formulates skill optimization as budgeted sequential optimization over a dynamically evolving candidate space and remains robust to changes in the agent harness and performs effectively when the target model itself is used for skill generation and refinement.

Ping-Chen Lu, Xiang-Yi Wang, Xiang Li et al. · 1 citation
Preprint Aug 2026

SPOT: Sparse Probing and Outcome Calibration for On-Policy Distillation

Sparse Probing and Outcome-calibrated Targets OPD is introduced, which addresses two coupled decisions, where to probe and what to distill, through an acquisition--exploration--exploitation procedure and demonstrates the effectiveness of SPOT in improving reasoning performance while balancing solution quality and cover...

Zi-Kun Qu, Min Zhang, Ming-Ze Kong et al. · 8 citations

Meta-Prompt Optimization for LLM-Based Sequential Decision Making

The EXPonential-weight algorithm for prompt Optimization} (EXPO) is proposed to automatically optimize the task description and meta-instruction in the meta-prompt for LLM-based agents and is extended to additionally optimize the exemplars (i.e., history of interactions) in the meta-prompt to further enhance the perfor...

Ming-Ze Kong, Zhiyong Wang, Yao Shu et al. · 7 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.