Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal -Sparse GLMs
Jiachang Liu, Andrea Lodi
GPUs have significantly accelerated first-order methods for large-scale optimization, especially in continuous optimization. However, this success has not transferred cleanly to pr…
cs.LG2026
Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
Hao Chen, Chendi Qian, Christopher Morris +2
Exact solution of hard combinatorial optimization problems often relies on strong convex relaxations, but solving these relaxations repeatedly inside a branch-and-bound algorithm c…