The paper introduces Adaptive Multi Mode (AMM), a budget‑aware router that selects among several optimization engines—quasi‑Newton, trust‑region, coordinate, multistart, and evolution‑strategy—based on online probes of the problem landscape. Each probe evaluates features such as curvature, plateaus, separability, kinks, basins, and fractal structure, and is assigned a validity range and cost relative to the budget. In extensive pre‑registered tests on the bbob benchmark, AMM achieved the highest target share in 382 of 600 function‑dimension‑budget cells, outperforming up to seven competitors and maintaining strong performance across transformations and constraints.
By Benjamin Jacob Bodner
FrugalEvo introduces a cost‑aware evolutionary framework that pairs a high‑cost, powerful LLM with a cheaper LLM to explore and refine program solutions, respectively. It incorporates a cache‑efficient evolution process that maximizes prefix reuse across steps and defines a Budget‑Aware Area Under the Curve (BA‑AUC) metric to evaluate solution quality within a fixed cost budget. Across ten mathematical and systems optimization tasks, FrugalEvo matches or surpasses state‑of‑the‑art baselines in final solution quality and achieves higher BA‑AUC on nine tasks, while delivering new state‑of‑the‑art performance on circle packing for costs as low as $0.55 to $1.68.
By Hui Chen, Xuan Qi, James Xu Zhao, Zhaopeng Feng, Shilong Liu, Kuang Xu, Pang Wei Koh, Bryan Hooi
The paper presents GEO-Exact, an exact solver for Hybrid Bonding Terminal (HBT) legalization that achieves provably optimal assignments on 21 benchmark instances. It demonstrates that existing heuristics, including a reinforcement‑learning legalizer and sliding‑window approaches, are within 0.1% of optimal on most cases, while other density‑guided and greedy methods can be significantly worse. The authors release the code, optimal values, and dual certificates for these benchmarks.
By Kadhir Parani, Manjunath Bezawada, Divya M, Kesana Jathin, Kolli Sarath, Sm Zobaed
arXiv:2606. 21641v2 Announce Type: replace-cross Abstract: Large language models (LLMs) have been proposed as hyperparameter-optimization (HPO) advisors that "warm-start" search from prior knowledge, proposing strong configurations in very few evaluations.
By Carson Rodrigues, Oysturn Vas, Isaiah Abner DCosta, Nithish Kumar Prabhakaran
Finding all modes of a multimodal black-box function is a fundamental challenge in optimization, Bayesian inference, and scientific computing. Existing approaches -- basin-hopping, CMA-ES, multistart gradient descent -- operate sequentially and cannot exploit the massive parallelism of modern GPU hardware.
arXiv:2606. 11015v1 Announce Type: new Abstract: Tuning controllers for strongly coupled multi-input multi-output (MIMO) industrial processes is hard: decentralized classical auto-tuning ignores loop interaction, and local numerical optimization from natural initializations stalls in the resulting non-convex cost landscape.
By Jiaxuan Chen, Haonan Li, Yang Shu
arXiv:2606. 26164v1 Announce Type: new Abstract: Finding all modes of a multimodal black-box function is a fundamental challenge in optimization, Bayesian inference, and scientific computing.
By Ira Wolfson
arXiv:2610. 21001v1 Announce Type: new Abstract: Column generation folklore warns that initial columns hurt: a warm start may bias the dual and slow the root of branch-price-and-cut.
By Haoran Liu, Yu Yang
arXiv:2607. 17398v1 Announce Type: cross Abstract: Analytical placers rely on differentiable objective functions to guide placement, typically combining intermediate surrogate metrics such as half-perimeter wirelength (HPWL) and cell-density penalties.
By Ruogu Chen, Weihua Xiao, Ramesh Karri, Jie Han
Large traveling salesman problem (TSP) instances require a solver to allocate limited computation while preserving the validity of its outputs. Existing neural--operations-research (OR) hybrids predict guidance without requiring learned transitions to satisfy constraints discovered during search.
arXiv:2609.26077v1 Announce Type: new
Abstract: A Strassen-type algorithm has many realizations with the same exact product and multiplication count yet different fp8 error because basis changes resh...
By Shuxiao Xie, Shuyang Xie, Yuan Cao, Dezhi Ran, Wei Yang, Tao Xie
tidyHEBO is a BoTorch-native Bayesian optimization tool that jointly applies Yeo-Johnson output warping to a Gaussian‑process surrogate, evaluates acquisition functions on the original objective scale, and conducts constrained cumulative Pareto search across multiple acquisition criteria. Using only default settings, it outperformed other methods on the Olympus benchmark and performed strongly on synthetic, Needle‑in‑a‑Haystack, and Bayesmark tasks, while adaptive batching offered a trade‑off between parallelization and optimization quality. These results position tidyHEBO as a robust, reproducible optimizer suitable for diverse practical problems, including scientific applications and hyperparameter tuning.
By L. A. Zhukov, E. V. Shaburova, D. V. Antonets