Kaibo Wang
Author directory2026
OptiMAS: Automatically Optimize Multi-Agent System
Yuxin Cheng | Chang Liu | Hanxin Yu | Haochen Tan | Taiqiang Wu | Weiqiang Jin | Jie Ran | Kaibo Wang | Xiaoguang Li | Haoli Bai | Graziano Chesi | Ngai Wong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuxin Cheng | Chang Liu | Hanxin Yu | Haochen Tan | Taiqiang Wu | Weiqiang Jin | Jie Ran | Kaibo Wang | Xiaoguang Li | Haoli Bai | Graziano Chesi | Ngai Wong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Automated evolution of Multi-Agent Systems (MAS) holds significant potential for reducing the manual effort required to design and optimize LLM-based agent architectures. However, extant search-based paradigms face a fundamental trade-off, where an expanded optimization scope exacerbates evolutionary instability, while discrete branch-and-discard search isolates insights across lineages. To address these limitations, we propose a continuous, data-driven optimization paradigm built upon a unified ReAct-based infrastructure that reconciles a broad optimization scope with operational stability. Under this paradigm, we present OptiMAS, a task-agnostic agentic optimizer that leverages textual interaction trajectories and task feedback as loss signals for end-to-end MAS evolution. Equipped with a novel dual-track memory mechanism, OptiMAS sustains performance improvement over extended optimization horizons. Evaluation on four heterogeneous agentic benchmarks with three varying scale and accessibility LLM backbones, demonstrates that OptiMAS consistently achieves competitive or superior accuracy relative to both domain-specialized hand-crafted systems and existing evolutionary methods. Our work establishes a practical milestone toward robust, automated MAS evolution.
Less Uniform Discrete Diffusion is More Powerful and Scalable
Kaibo Wang | Ding Ding | Fangyu Ding | Zijin Feng | Han Shi | Haoli Bai | Jiacheng Sun | Yang Xiang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Kaibo Wang | Ding Ding | Fangyu Ding | Zijin Feng | Han Shi | Haoli Bai | Jiacheng Sun | Yang Xiang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Although uniform diffusion language models (UDLMs) represent a promising diffusion paradigm, scaling them remains challenging. We identify the core obstacle as an over-uniform training objective and condition-target confusion during sampling. To address these, we propose Less Uniform Diffusion (LUDI), a novel UDLM framework. Specifically, we (i) introduce a less uniform loss that directs each reverse transition toward the clean token, and (ii) equip the model with per-token time embeddings that supply token-level corruption hints, enabling confidence-based few-step sampling. Experiments across scales show that LUDI yields cleaner supervision and improves few-step generation. We further continue-train a 7B autoregressive model into LUDI-7B, resulting in a UDLM capable of complex reasoning. It achieves 3 token-per-step speedup over AR decoding and a competitive performance compared with masked diffusion baselines, revealing that the full potential of UDLMs for complex generation remains to be unlocked.