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
The best classical optimizer for a continuous black-box problem depends on its budget and landscape. Existing routers decide from the dimension and budget, past improvement or features fitted to one b...
arXiv:2610.15829v2 Announce Type: replace
Abstract: Hard-margin SVM training is the distance problem between two convex hulls, which the Triangle Algorithm (TA) solves with a certified duality gap. W...
By Mayank Gupta
arXiv:2606. 20364v1 Announce Type: new Abstract: A companion study established a de-biased, cross-model VLM-as-3D-judge that reliably ranks single-image-to-3D mesh quality where cheap geometry and CLIP proxies fall short.
By Ali Asaria, Tony Salomone, Deep Gandhi
arXiv:2605. 07066v3 Announce Type: replace Abstract: Autonomous systems that build structures from natural-language instructions need reliable spatial reasoning, yet large language models (LLMs) make systematic coordinate errors when generating three-dimensional block placements.
By Paul Whitten, Li-Jen Chen, Sharath Baddam
The paper presents a method for generating hard problem instances by treating instance creation as an optimization problem, using solver runtime as the objective. Leveraging the Nevergrad platform, the authors generate challenging instances for four NP‑hard problems—satisfiability, traveling salesperson, Hamiltonian cycle, and non‑permutation flow‑shop scheduling—that outperform random draws and rival curated benchmark sets. The approach requires only a solver, an instance encoder, and a compute budget, and it can uncover structural insights such as phase‑transition behavior in SAT.
By Jamie Fravel, Martin Kouteck\'y, Pavlo Tsitsei