Cover Image

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Jiachang, Lodi, Andrea, Shafiee, Soroosh
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Machine Learning
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)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
by: Aolaritei, Liviu, et al.
Published: (2022)

Wasserstein Distributionally Robust Online Learning
by: Chen, Guixian, et al.
Published: (2026)

Distributionally Robust Optimization
by: Kuhn, Daniel, et al.
Published: (2024)

Nash Equilibria, Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimization
by: Shafiee, Soroosh, et al.
Published: (2023)

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

Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming
by: Lu, Haihao, et al.
Published: (2021)

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)

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

Optimal Local Convergence Rates of Stochastic First-Order Methods under Local $α$-PL
by: Masiha, Saeed, et al.
Published: (2024)

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

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
by: Li, Yuchen, et al.
Published: (2024)

Policy Gradient Converges to the Globally Optimal Policy for Nearly Linear-Quadratic Regulators
by: Han, Yinbin, et al.
Published: (2023)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networks
by: Robin, David A. R., et al.
Published: (2025)

First-Order Methods for Linearly Constrained Bilevel Optimization
by: Kornowski, Guy, 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)

Linear-Quadratic Mean-Field Reinforcement Learning: Convergence of Policy Gradient Methods
by: Carmona, René, et al.
Published: (2019)

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

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

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

Communication Efficient Federated Learning with Linear Convergence on Heterogeneous Data
by: Liu, Jie, et al.
Published: (2025)

Sketch-and-Project Meets Newton Method: Global $\mathcal O(k^{-2})$ Convergence with Low-Rank Updates
by: Hanzely, Slavomír
Published: (2023)

On the Last-Iterate Convergence of Shuffling Gradient Methods
by: Liu, Zijian, et al.
Published: (2024)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
by: Kovalev, Dmitry, et al.
Published: (2024)

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

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
by: Zhou, Zhiling, et al.
Published: (2024)

A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron
by: Garber, Dan
Published: (2025)

Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods
by: Liu, Zijian, et al.
Published: (2023)

Conditional Gradient Methods with Standard LMO for Stochastic Simple Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness
by: Tyurin, Alexander
Published: (2025)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
by: Shi, Qiankun, et al.
Published: (2025)

Linear Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation
by: Cayci, Semih, et al.
Published: (2021)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
by: Xiao, Nachuan, et al.
Published: (2023)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
by: Liu, Zijian
Published: (2026)

Exact Verification of First-Order Methods via Mixed-Integer Linear Programming
by: Ranjan, Vinit, et al.
Published: (2024)

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