Cover Image

Sparse Polyak with optimal thresholding operators for high-dimensional M-estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Qiao, Tianqi, Maros, Marie
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

Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation
by: Qiao, Tianqi, et al.
Published: (2025)

Decentralized Sparse Linear Regression via Gradient-Tracking: Linear Convergence and Statistical Guarantees
by: Maros, Marie, et al.
Published: (2022)

Constrained Online Convex Optimization with Polyak Feasibility Steps
by: Hutchinson, Spencer, et al.
Published: (2025)

Non-convex Stochastic Composite Optimization with Polyak Momentum
by: Gao, Yuan, et al.
Published: (2024)

Parameter-free Clipped Gradient Descent Meets Polyak
by: Takezawa, Yuki, et al.
Published: (2024)

New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
by: Orabona, Francesco, et al.
Published: (2025)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
by: Chen, Lesi, et al.
Published: (2023)

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2024)

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
by: Oikonomou, Dimitris, et al.
Published: (2024)

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
by: Bai, Yunyan, et al.
Published: (2024)

Adaptive SGD with Line-Search and Polyak Stepsizes: Nonconvex Convergence and Accelerated Rates
by: Wu, Haotian
Published: (2025)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
by: Phunyaphibarn, Prin, et al.
Published: (2023)

SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms
by: Abdukhakimov, Farshed, et al.
Published: (2023)

High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
by: Kar, Avik, et al.
Published: (2026)

A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models
by: Xu, Ziqing, et al.
Published: (2025)

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler
by: Oikonomou, Dimitris, et al.
Published: (2026)

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
by: Oikonomou, Dimitris, et al.
Published: (2025)

Mitigating optimistic bias in entropic risk estimation and optimization
by: Sadana, Utsav, et al.
Published: (2024)

A Bregman firmly nonexpansive proximal operator for baryconvex optimization
by: Achab, Mastane
Published: (2024)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
by: Godichon-Baggioni, Antoine, et al.
Published: (2024)

Learning solutions to some toy constrained optimization problems in infinite dimensional Hilbert spaces
by: Mandal, Pinak
Published: (2024)

Combining additivity and active subspaces for high-dimensional Gaussian process modeling
by: Binois, Mickael, et al.
Published: (2024)

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

Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps
by: Baptista, Ricardo, et al.
Published: (2024)

Real-time optimal control of high-dimensional parametrized systems by deep learning-based reduced order models
by: Tomasetto, Matteo, et al.
Published: (2024)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
by: Lauga, Guillaume
Published: (2026)

Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization
by: Zheng, Tianqi, et al.
Published: (2024)

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

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

Robotic warehousing operations: a learn-then-optimize approach to large-scale neighborhood search
by: Barnhart, Cynthia, et al.
Published: (2024)

On the optimization dynamics of RLVR: Gradient gap and step size thresholds
by: Suk, Joe, et al.
Published: (2025)

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

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

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

Learning to optimize: A tutorial for continuous and mixed-integer optimization
by: Chen, Xiaohan, et al.
Published: (2024)

A Recovery Guarantee for Sparse Neural Networks
by: Fridovich-Keil, Sara, et al.
Published: (2025)

Incremental Learning of Sparse Attention Patterns in Transformers
by: Yüksel, Oğuz Kaan, et al.
Published: (2026)

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

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
by: Tang, Xun, et al.
Published: (2024)