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
The study re‑examines a reported advantage of a routed ternary (1.58‑bit) language model over a full‑precision transformer at 60K parameters. By running controlled experiments with multiple seeds and a fixed training recipe, the authors find that the apparent benefit largely stems from the choice of baseline model shape rather than the ternary architecture itself. While the routed model does outperform other shapes at a larger 130M‑byte budget, its advantage diminishes when a plain gated diagonal‑SSM block is used, and the ternary penalty varies with architecture and quantization details.
By Gautam Veldanda
arXiv:2607. 09971v1 Announce Type: new Abstract: Archive-based exploration methods such as Go-Explore select which visited state to return to using visitation rarity, and frontier methods return to the boundary of the unknown; neither asks whether the unexplored region behind a boundary is enterable at all.
By Jason Carlson
The paper investigates how per-domain data composition during the mid‑training phase (between pre‑training and alignment) affects model performance. Experiments with Qwen3‑8B‑Base across five KOR‑Bench domains show that a moderate coverage band (10%‑40%) yields the best performance for each domain, and that alignment passes cannot fully close the gaps created by suboptimal mid‑training allocations. Additionally, zero coverage during mid‑training severely degrades accuracy, while a carefully tuned allocation can provide the largest overall pipeline improvement.
arXiv:2608. 04804v1 Announce Type: cross Abstract: Frontier language models can resolve repository-level software issues, but each attempt is expensive, and existing routers select a model from the issue text alone.
By Ishaan Bhola, Adithyan Krishnan, Mukunda NS
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.
The study investigates how the composition of data during the mid‑training phase of language models affects performance across multiple domains. Experiments with Qwen3‑8B‑Base on five distinct KOR‑Bench domains show that moderate coverage (10%‑40%) yields the best per‑domain results, and that alignment passes cannot fully close the performance gaps created by mid‑training data choices. Additionally, zero coverage in mid‑training severely degrades accuracy, while a carefully tuned allocation can provide the largest overall pipeline improvement.
By Yunpeng Xu, Kun Zheng