Cover Image

Scalable First-order Method for Certifying Optimal k-Sparse GLMs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Jiachang, Shafiee, Soroosh, Lodi, Andrea
Format:	Preprint
Published:	2025
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

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

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)

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

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

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)

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)

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

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)

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

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, 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)

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

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

First-Order Sparse Convex Optimization: Better Rates with Sparse Updates
by: Garber, Dan
Published: (2025)

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

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

Scalable Approximate Algorithms for Optimal Transport Linear Models
by: Kacprzak, Tomasz, et al.
Published: (2025)

Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
by: Kuhn, Daniel, et al.
Published: (2019)

Scalable Second-order Riemannian Optimization for $K$-means Clustering
by: Xu, Peng, et al.
Published: (2025)

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

A First-order Generative Bilevel Optimization Framework for Diffusion Models
by: Xiao, Quan, et al.
Published: (2025)

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
by: Garber, Dan, 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)

A Robust Optimization Approach to Network Control Using Local Information Exchange
by: Darivianakis, Georgios, et al.
Published: (2024)

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

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

Scalable Bi-causal Optimal Transport via KL Relaxation and Policy Gradients
by: Cao, Haoyang, et al.
Published: (2026)

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

First-order methods for Stochastic Variational Inequality problems with Function Constraints
by: Boob, Digvijay, et al.
Published: (2023)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
by: Wang, Hao, et al.
Published: (2021)

Probabilistic Iterative Hard Thresholding for Sparse Learning
by: Bergamaschi, Matteo, et al.
Published: (2024)

PINNs in PDE Constrained Optimal Control Problems: Direct vs Indirect Methods
by: Zhang, Zhen, et al.
Published: (2026)

PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates
by: Frangella, Zachary, et al.
Published: (2023)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach
by: Feng, Lechen, et al.
Published: (2025)

Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees
by: de Vazelhes, William, et al.
Published: (2025)