Cover Image

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Jiachang, Lodi, Andrea
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2025)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Batched First-Order Methods for Parallel LP Solving in MIP
by: Blin, Nicolas, et al.
Published: (2026)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)

How hard is learning to cut? Trade-offs and sample complexity
by: Khalife, Sammy, et al.
Published: (2025)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
by: Chen, Hao, et al.
Published: (2026)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
by: Lodi, Andrea, et al.
Published: (2019)

Adaptive Batch Size Schedules for Distributed Training of Language Models with Data and Model Parallelism
by: Lau, Tim Tsz-Kit, et al.
Published: (2024)

Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
by: Kou, Yiwen, et al.
Published: (2024)

The Differentiable Feasibility Pump
by: Cacciola, Matteo, et al.
Published: (2024)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
by: Messana, Rosario, et al.
Published: (2024)

Heuristic Optimal Transport in Branching Networks
by: Andrecut, M.
Published: (2023)

Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
by: Liang, Jiaqi, et al.
Published: (2024)

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
by: Huang, Hao, et al.
Published: (2025)

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
by: Bayramoğlu, Selin, et al.
Published: (2026)

Bounds on Perfect Node Classification: A Convex Graph Clustering Perspective
by: Shahriari-Mehr, Firooz, et al.
Published: (2025)

SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
by: Francobaldi, Matteo, et al.
Published: (2025)

Optimal Growth Schedules for Batch Size and Learning Rate in SGD that Reduce SFO Complexity
by: Umeda, Hikaru, et al.
Published: (2025)

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
by: Guyard, Theo, et al.
Published: (2024)

An improved column-generation-based matheuristic for learning classification trees
by: Patel, Krunal Kishor, et al.
Published: (2023)

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
by: Elvira, Clément, et al.
Published: (2025)

Fast Catch-Up, Late Switching: Optimal Batch Size Scheduling via Functional Scaling Laws
by: Wang, Jinbo, et al.
Published: (2026)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
by: Anderson, Brendon G., et al.
Published: (2021)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
by: Tang, Wei-Ting, et al.
Published: (2026)

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
by: Ostroukhov, Petr, et al.
Published: (2024)

A GPU-accelerated Nonlinear Branch-and-Bound Framework for Sparse Linear Models
by: Meng, Xiang, et al.
Published: (2026)

Dynamic Range Reduction via Branch-and-Bound
by: Gerlach, Thore, et al.
Published: (2024)

Online Linear Programming with Batching
by: Xu, Haoran, et al.
Published: (2024)

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)

CLT-Optimal Parameter Error Bounds for Linear System Identification
by: Zhou, Yichen, et al.
Published: (2026)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
by: Berahas, Albert S., et al.
Published: (2023)

Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis
by: Cortild, Daniel, et al.
Published: (2025)

Optimal Cross-Validation for Sparse Linear Regression
by: Cory-Wright, Ryan, et al.
Published: (2023)

Sequential Bayesian Optimal Experimental Design in Infinite Dimensions via Policy Gradient Reinforcement Learning
by: Shen, Kaichen, et al.
Published: (2026)

AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods
by: Lau, Tim Tsz-Kit, et al.
Published: (2024)

CORL: Reinforcement Learning of MILP Policies Solved via Branch and Bound
by: Anand, Akhil S, et al.
Published: (2025)

Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
by: Feng, Lechen, et al.
Published: (2024)

Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods
by: Lau, Tim Tsz-Kit, et al.
Published: (2024)

Supplementary Materials to Graph Convolutional Branch and Bound
by: Sciandra, Lorenzo, et al.
Published: (2024)