arXiv:2609.22987v1 Announce Type: new
Abstract: Automated operations research (OR) modeling requires LLMs to translate natural-language decision problems into correct mathematical programs. Existing...
By Ruiqing Zhao, Rui Liu, Yuan Zuo, Huarong Zhang, Xiao Han, Junjie Wu
MATCH is a closed‑loop framework for model‑aware tool learning that combines curriculum scheduling with hierarchically gated rewards. It introduces Model‑Aware Curriculum Learning (MACL), which dynamically adjusts sample difficulty based on reward signals, and Hierarchical Tool‑call Gated Reward (HTGR), which allocates credit at the tool name, argument key, and argument value levels only when prerequisites are met. Experiments on API‑Bank and BFCL V3 show MATCH achieving 72.19% and 62.87% overall accuracy, outperforming both supervised and RL‑based baselines across multiple backbone models.
By Shihao Liu, Hao Yin, Lijun Liu, Zhengzong Chen, Yuanyuan Zhao, Fei Huang
arXiv:2604. 27660v3 Announce Type: replace Abstract: Many real-world tasks require language models (LMs) to reason over complex contexts that exceed their parametric knowledge.
By Shuzheng Si, Haozhe Zhao, Yu Lei, Qingyi Wang, Dingwei Chen, Zhitong Wang, Zhenhailong Wang, Kangyang Luo, Zheng Wang, Gang Chen, Fanchao Qi, Minjia Zhang, Maosong Sun
GraphSkillEvo introduces a graph-structured representation for agent skills, where each node encodes an execution step and edges capture context-dependent transitions. This structure offers clearer workflow guidance and reduces redundancy compared to unstructured natural-language skills. The authors then present a population-based evolutionary optimization framework that explores this structured skill space, achieving higher accuracy than the baseline SkillOpt across five agent benchmarks.
By Rui Sun, Zhi Zheng, Zhenkun Wang, Zhichao Lu
arXiv:2605. 08756v2 Announce Type: replace Abstract: Automatic heuristic design (AHD) has emerged as a promising paradigm for solving NP-hard combinatorial optimization problems (COPs).
By Haoze Lv, Ning Lu, Ziang Zhou, Yew-Soon Ong, Shengcai Liu
The paper introduces SDDL, a neuro‑symbolic framework that converts natural‑language combinatorial scheduling problems into compact, solver‑aligned representations, delegating low‑level modeling and search to a deterministic compiler and external solver. On a 300‑instance subset of scheduling tasks, SDDL achieves higher feasibility rates for resource‑constrained language models—up to 55.3% and 28.3%—compared to direct‑generation baselines (23.7% and 1.3%) and solver‑code baselines (21.7% and 7.0%), with a median optimality gap of 0.0% among feasible schedules.
By Shrenil Shaun Sharma, Avi Sharma