arXiv AI

AlgoSkill: Learning to Design Algorithms by Scheduling Human-Like Skills

arXiv:2606. 29999v1 Announce Type: new Abstract: Designing an algorithm from a natural-language problem statement requires identifying the problem structure, reading constraints, choosing a suitable paradigm, checking correctness, and refining complexity.

arXiv AI
Sep 18

MATCH: Model-Aware Tool Learning with Curriculum Scheduling and Hierarchically Gated Rewards

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 Machine Learning
Sep 21

GraphSkillEvo: Evolutionary Optimization of Graph-Structured Agent Skills

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 AI
Aug 20

Improving Natural-Language Combinatorial-Optimization Accuracy in Resource-Constrained Language Models via Formal Abstractions

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
arXiv AI
Oct 1

Right Answers, Costly Models: The Efficiency Gap in LLM-based Optimization Modeling

The paper introduces OptTips, a knowledge base of 50 expert optimization modeling techniques, and OptDachshund, a multi‑agent framework that generates mathematical models and solver code from natural‑language problem descriptions. Using these tools, the authors create the EfficientOpt benchmark, comprising 561 expert‑reviewed tasks with paired reference implementations, to evaluate large language models (LLMs) on both correctness and computational efficiency. Their experiments with 11 LLMs show a consistent efficiency gap: even when LLMs produce correct solutions, the resulting programs often take longer to solve than expert‑crafted counterparts, highlighting the need to assess both accuracy and runtime performance in LLM‑based optimization modeling.

By Zhong Li, Xin Huang, Jinhui Wan, Xiangyi Wang, Shenkai Zhang, Ruiqi Chen, Wenyu Liu, Zaiwen Wen, Ziyan Luo
arXiv AI
Jun 4

StepPRM-RTL: Stepwise Process-Reward Guided LLM Fine-Tuning for Enhanced RTL Synthesis

arXiv:2606. 04246v1 Announce Type: new Abstract: Automatic generation of RTL code for digital hardware designs remains challenging due to long-horizon reasoning, multi-step dependencies, and strict correctness constraints in Verilog and VHDL.

By Prashanth Vijayaraghavan, Apoorva Nitsure, Luyao Shi, Ehsan Degan, Vandana Mukherjee