RI

#1OptiVerse: A Comprehensive Benchmark towards Optimization Problem Solving

2026-04-23 | Xi'an Jiaotong University, Lenovo Research |2604.21510

This paper introduces OptiVerse, a 1,000-problem benchmark spanning six optimization domains (including stochastic and dynamic optimization) to evaluate LLM reasoning, alongside a Dual-View Auditor Agent that detects semantic modeling errors. Extensive evaluation of 22 LLMs shows severe performance degradation on hard problems (under 27% accuracy even for frontier models), while the proposed agent improves accuracy by 1.3-6.3% over baselines like OptiMUS. The key insight is the 'blind code abstraction' technique: forcing the LLM to reverse-engineer mathematical logic solely from its generated code without seeing the original prompt, which effectively mitigates the confirmation bias that plagues standard LLM self-correction.

#2Dual-Cluster Memory Agent: Resolving Multi-Paradigm Ambiguity in Optimization Problem Solving

2026-04-22 | Xi’an Jiaotong University, Ministry of Education Key Laboratory of Intelligent Networks and Network Security, Shaanxi Province Key Laboratory of Big Data Knowledge Engineering |2604.20183

This paper introduces a training-free Dual-Cluster Memory Agent that resolves multi-paradigm ambiguity in optimization modeling by decoupling abstract mathematical modeling from concrete coding implementation into separate memory clusters linked by a bipartite graph. The results are backed by strong empirical evidence, showing 11-21% average accuracy improvements across 7 OR benchmarks (including OptiBench and NLP4LP) over baselines like OptiMUS and OptiTree, while reducing inference time compared to heavy tree-search methods. The key insight is the structured extraction of 'Pitfalls' from persistent failures and the resulting 'knowledge inheritance'—using a large model to build a high-quality bipartite memory graph allows smaller, cheaper models to achieve SOTA performance during inference.

#3Co-evolving Agent Architectures and Interpretable Reasoning for Automated Optimization

2026-04-20 | Harbin Institute of Technology, Nanjing University of Information Science and Technology |2604.17708

Huang et al. propose EvoOR-Agent, a co-evolutionary framework that represents LLM agent workflows as Activity-on-Edge (AOE) networks to simultaneously evolve the agent's architectural topology and its reasoning trajectories for operations research tasks. The results are backed by strong empirical evidence, showing up to 17% improvement over fixed-pipeline OR agents and 15% over general evolutionary agents on complex benchmarks like IndustryOR and BWOR. The key insight is that abstracting agent workflows into an explicit, evolvable AOE graph allows for path-conditioned recombination and structural pruning, enabling the evolutionary search to optimize the problem-solving process (e.g., formulation decomposition, solver routing, debugging loops) rather than just the prompt text or final code.

#4PARM: Pipeline-Adapted Reward Model

2026-04-20 | The Chinese University of Hong Kong, Hong Kong University of Science and Technology, City University of Hong Kong, Peking University, Tsinghua University, University of California, Los Angeles, Shanghai Jiao Tong University |2604.18327

Fan et al. introduce a Pipeline-Adapted Reward Model (PARM) that trains stage-specific reward models for LLM optimization pipelines using Direct Preference Optimization on automatically collected execution feedback. The results are backed by strong empirical numbers, demonstrating that a 7B model pipeline can outperform GPT-4o on operations research benchmarks like NL4Opt (0.52 vs 0.15 solving accuracy). The key insight is that intermediate pipeline stages, such as problem formulation, can be effectively scored by training a reward model via DPO where preference pairs are automatically labeled based on whether any downstream execution succeeds.

#1Learning to Evolve: A Self-Improving Framework for Multi-Agent Systems via Textual Parameter Graph Optimization

2026-04-22 | Future Living Lab of Alibaba |2604.20714

He et al. introduce Textual Parameter Graph Optimization (TPGO), a framework that optimizes multi-agent systems by representing their configurations as modular graphs and evolving them using textual gradients. The results are backed by solid empirical evidence, demonstrating a 7-10% absolute success rate improvement on complex benchmarks like MCP-Universe and GAIA over strong baselines (ReAct, MiroFlow). The key insight is the Group Relative Agent Optimization (GRAO) mechanism, which maintains an 'Optimization Experience Memory' of past successful and failed graph edits, clustering and retrieving them to teach the LLM optimizer how to generate better updates over time.

#1Hive: A Multi-Agent Infrastructure for Algorithm- and Task-Level Scaling

2026-04-19 | Peking University |2604.17353

Hive is an LLM inference infrastructure that optimizes multi-agent and test-time scaling workloads by introducing Logits Cache for redundant sampling paths and Agent-Aware Scheduling for KV cache eviction. The results are backed by solid empirical evidence, demonstrating a 1.11x-1.76x speedup for re-sampling and a 33%-51% reduction in KV cache miss rates on Qwen3-8B. The key insight is that caching intermediate logits (not just KV states) allows the engine to expensive forward passes during stochastic resampling of shared prefixes, while evicting KV cache based on an agent's structural contribution outperforms standard LRU. This is highly relevant for scaling LLM evolutionary search and multi-agent optimization, as it provides concrete systems-level techniques to drastically reduce the inference costs associated with branching generation and complex agent coordination.

#2DiP-SD: Distributed Pipelined Speculative Decoding for Efficient LLM Inference at the Edge

2026-04-22 | Tsinghua University |2604.20919

This paper formulates the scheduling of distributed speculative decoding (local drafting, centralized verification) as a fractional mixed-integer program to maximize multi-user token throughput. The authors demonstrate up to 1.93x throughput improvements over greedy batching in simulated edge deployments using Qwen3 models. The key insight is that the complex fractional objective of throughput (expected accepted tokens per unit time) can be efficiently decoupled and solved using the Dinkelbach method combined with alternating optimization for batch assignment and draft lengths.