arXiv Machine Learning By Lin Fu, Siwei Fu, Dong Ni

CAP: Learning to Optimize from Sparse Observations of Related Tasks

Read the original on arXiv Machine Learning →

The paper introduces CAP (Candidate Acquisition Policy), a method that learns a query policy from sparse historical records of related optimization tasks. CAP models shared structure and task-specific variation to generate interactive practice functions, then trains a feedback-conditioned policy that operates under a fixed evaluation budget. Experiments on synthetic task families and engineering simulation benchmarks (BOPTEST and SU2) show CAP achieving the lowest median final-budget values compared to other methods.

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 Machine Learning.

arXiv Machine Learning
Sep 22

Strategy Accumulation and Guided Execution for Automated LLM Fine-Tuning

The paper introduces Strategy Accumulation and Guided Execution (SAGE), a two-stage framework that makes automated fine-tuning of large language models cumulative. In the first stage, a multi-agent pipeline uses Monte Carlo Tree Search to explore training strategies while a Distillation Agent records task-specific insights and cross-task confidence scores into a structured repository. In the second stage, SAGE retrieves relevant experience from this repository to guide training on new tasks, achieving a 12.4‑percentage‑point improvement over a baseline pipeline without accumulated experience on nine unseen tasks.

By Haoran Zhao, Wei Du, Dingwen Yang, Jixuan Huang, Junlin Shang, Lingyong Fang, Ya Guo, Tao Gui, Qi Zhang, Xuanjing Huang