arXiv AI By Kadhir Parani, Manjunath Bezawada, Divya M, Kesana Jathin, Kolli Sarath, Sm Zobaed

Provably Optimal HBT Legalization in Seconds: Certified Optima Reveal Where the Headroom Really Lies

Read the original on arXiv AI →

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.

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 Machine Learning
Nov 5

Adaptive Multi Mode: Budget-Aware Routing of Optimizers By Online Landscape Probes

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
arXiv AI
Oct 19

Hard Instances on Demand

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