HEMO evolves the search harness for multi-objective optimization
The method updates one harness module at a time using solution quality, runtime, and a discounted UCB scheduler.
Stories per day · 30 days
Relatedbayesian-optimization1cma-es1dpll1energnn1energy-models1evolutionary-algorithms1exact-algorithms1graph-neural-networks1high-dimensional1machine-learning1max-2-sat1max-cut1mixed-integer-programming1moco1operator-design1qaoa1quantum-computing1variational-angles1
6 stories, newest first · one card per story
Stories tagged #combinatorial-optimization
Polynomial-space algorithms solve dense Max 2-SAT classes exactly
Branching records pruning constraints that discard all but an exponentially small fraction of assignments on several dense instance classes.
EnerGNN learns energy functions for exact constrained combinatorial inference
On a cell-therapy supply-chain task it reports a 0.05% mean primal gap and a 17.4× MIP speedup.
Fast Bayesian optimization methods match SOTA at 100x–1000x speed
The methods target continuous and combinatorial inputs from about 10 to more than 6000 dimensions by using linear structure already in BO.
Learning angles for quantum approximate optimization
Learned models predict high-quality QAOA angles in one pass, matching slower per-instance solvers.
COMPASS: Ordered Clustered Routing at 100K Scale
COMPASS combines search with learning-accelerated parallel sub-solvers for the Ordered Clustered TSP, scaling to 100K synthetic and 28.5K real e-commerce nodes.