arXiv AI By Yuwei Gu, Yaoxin Wu, Tong Guo, Wen Song, Zhiguang Cao

Autoresearch in Mixed-Integer Linear and Nonlinear Programming

Read the original on arXiv AI →

The paper introduces AutoMIP, a reusable agent skill designed to manage long‑horizon autoresearch for mixed‑integer linear and nonlinear programming problems. AutoMIP combines idea pooling with an algorithm tree search to maintain a persistent pool of complementary candidate ideas and organize experiments into a structured tree, allowing the agent to preserve unexplored hypotheses, refine promising algorithms, and switch methodological directions based on historical states. Experiments on MILP and MINLP benchmark cohorts show that AutoMIP achieves the highest final success rates, discovering new best solutions for 31 of 60 MIPLib instances and 52 of 60 MINLPLib instances, and ablation studies confirm the complementary contributions of idea pooling and algorithm tree search.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 12

Recovering Wasted Compute in Autoresearch Agents

arXiv:2608. 10424v1 Announce Type: new Abstract: A slew of recent works develop agents for solving research problems end-to-end, a paradigm increasingly referred to as autoresearch.

By Au Kwok Chun, Abhigyan Acherjee, Amrutha Rao, Zaiqian Chen, Kazem Meidani, C. Bayan Bruss, Micah Goldblum
arXiv AI
Jun 11

Toward Generalist Autonomous Research via Hypothesis-Tree Refinement

arXiv:2606. 11926v1 Announce Type: cross Abstract: Scientific progress depends on a repeated loop of exploration, experimentation, and abstraction.

By Jiajie Jin, Yuyang Hu, Kai Qiu, Qi Dai, Chong Luo, Guanting Dong, Xiaoxi Li, Tong Zhao, Xiaolong Ma, Gongrui Zhang, Zhirong Wu, Bei Liu, Zhengyuan Yang, Linjie Li, Lijuan Wang, Hongjin Qian, Yutao Zhu, Zhicheng Dou
Hugging Face Trending Papers
Aug 20

Learning Early-to-Final Solution Consistency for MILP Acceleration

Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making. Owing to their NP-hardness, however, modern solvers may struggle to find high-quality solutions for challenging MILP instances within practical time limits.

Hugging Face Trending Papers
Jun 3

AutoLab: Can Frontier Models Solve Long-Horizon Auto Research and Engineering Tasks?

Scientific and engineering progress is fundamentally a long-horizon iterative process: proposing changes, running experiments, measuring outcomes, and continuously refining artifacts. Yet existing benchmarks for frontier models primarily evaluate either single-turn responses or short-horizon agent trajectories, failing to capture the challenges of sustained iterative improvement over extended time horizons.