Cover Image

First-Order Sparse Convex Optimization: Better Rates with Sparse Updates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Garber, Dan
Format:	Preprint
Published:	2025
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

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

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

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
by: Garber, Dan, et al.
Published: (2024)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity
by: Garber, Dan
Published: (2025)

Weak Proximal Newton Oracles for Composite Convex Optimization
by: Garber, Dan
Published: (2025)

Blackwell's Approachability with Approximation Algorithms
by: Garber, Dan, et al.
Published: (2025)

Dynamics of Stochastic Momentum with Sparse Updates in High Dimensions
by: Everett, Katie, et al.
Published: (2026)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
by: Ji, Kaiyi
Published: (2025)

A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
by: Xiong, Sichao, et al.
Published: (2026)

Optimal Rates for Robust Stochastic Convex Optimization
by: Gao, Changyu, et al.
Published: (2024)

Differentially Private Optimization with Sparse Gradients
by: Ghazi, Badih, et al.
Published: (2024)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
by: Meinhardt, Georg, et al.
Published: (2024)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023)

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

FOCUS: First Order Concentrated Updating Scheme
by: Liu, Yizhou, et al.
Published: (2025)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)

Smoothing the Edges: Smooth Optimization for Sparse Regularization using Hadamard Overparametrization
by: Kolb, Chris, et al.
Published: (2023)

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization
by: Yang, Jianting, et al.
Published: (2024)

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

Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
by: Sahinoglu, Emre, et al.
Published: (2024)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Fully First-Order Algorithms for Online Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
by: Kwon, Jeongyeol, et al.
Published: (2024)

First-Order Methods for Linearly Constrained Bilevel Optimization
by: Kornowski, Guy, et al.
Published: (2024)

A Study of Condition Numbers for First-Order Optimization
by: Guille-Escuret, Charles, et al.
Published: (2020)

SPP-SBL: Space-Power Prior Sparse Bayesian Learning for Block Sparse Recovery
by: Zhang, Yanhao, et al.
Published: (2025)

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

The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
by: Schaipp, Fabian, et al.
Published: (2025)

Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization
by: Li, Chris Junchi
Published: (2024)

Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
by: Mhanna, Elissa, et al.
Published: (2024)

Sparse Hyperparametric Itakura-Saito Nonnegative Matrix Factorization via Bi-Level Optimization
by: Selicato, Laura, et al.
Published: (2025)

Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate
by: Pham, Hung, et al.
Published: (2025)

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

Bi-Sparse Unsupervised Feature Selection
by: Xiu, Xianchao, et al.
Published: (2024)

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
by: Kwon, Jeongyeol, et al.
Published: (2023)