Image de couverture de livre

Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penalties

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yang, Kai, Asgharian, Masoud, Bhatnagar, Sahir
Format:	Preprint
Publié:	2020
Sujets:	Optimization and Control Computation Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Proximal Operators of Sorted Nonconvex Penalties
par: Gagneux, Anne, et autres
Publié: (2025)

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
par: Kwon, Jeongyeol, et autres
Publié: (2023)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Penalty Approach
par: Feng, Lechen, et autres
Publié: (2025)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
par: Zhou, Dongruo, et autres
Publié: (2018)

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control: Non-Penalty Approach
par: Feng, Lechen, et autres
Publié: (2025)

On Penalty-based Bilevel Gradient Descent Method
par: Shen, Han, et autres
Publié: (2023)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
par: Wang, Hao, et autres
Publié: (2021)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
par: Ding, Kuangyu, et autres
Publié: (2023)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
par: Liu, Wei, et autres
Publié: (2025)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
par: Tran-Dinh, Quoc, et autres
Publié: (2024)

Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning
par: Meinhardt, Georg, et autres
Publié: (2024)

Principled Penalty-based Methods for Bilevel Reinforcement Learning and RLHF
par: Shen, Han, et autres
Publié: (2024)

Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration
par: Sun, Tao, et autres
Publié: (2024)

Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum
par: Zhou, Yuan, et autres
Publié: (2025)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
par: Lin, Tianyi, et autres
Publié: (2019)

Generalized Continuous-Time Models for Nesterov's Accelerated Gradient Methods
par: Park, Chanwoong, et autres
Publié: (2024)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
par: Shi, Wanli, et autres
Publié: (2024)

Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization
par: Zhang, Gavin, et autres
Publié: (2025)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
par: Chen, Lesi, et autres
Publié: (2023)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
par: Lin, Tianyi, et autres
Publié: (2024)

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
par: Yuan, Ganzhao
Publié: (2026)

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
par: Xiao, Nachuan, et autres
Publié: (2024)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
par: Cao, Jincheng, et autres
Publié: (2024)

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

A Concise Lyapunov Analysis of Nesterov's Accelerated Gradient Method
par: Liu, Jun
Publié: (2025)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
par: Chen, Ziyi, et autres
Publié: (2025)

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
par: Zhang, Gavin, et autres
Publié: (2022)

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization
par: Sato, Naoki, et autres
Publié: (2023)

Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
par: Kou, Yiwen, et autres
Publié: (2024)

Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property
par: Yang, Yingzhen, et autres
Publié: (2023)

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
par: Liu, Zijian, et autres
Publié: (2024)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
par: Zhang, Siyuan, et autres
Publié: (2024)

Locally Regularized Sparse Graph by Fast Proximal Gradient Descent
par: Sun, Dongfang, et autres
Publié: (2024)

Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds
par: Gürbüzbalaban, Mert, et autres
Publié: (2025)

Modular Distributed Nonconvex Learning with Error Feedback
par: Carnevale, Guido, et autres
Publié: (2025)

Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise
par: Pan, Rui, et autres
Publié: (2023)

Inference of Online Newton Methods with Nesterov's Accelerated Sketching
par: Wang, Haoxuan, et autres
Publié: (2026)

A Penalty-Based Method for Communication-Efficient Decentralized Bilevel Programming
par: Nazari, Parvin, et autres
Publié: (2022)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
par: Zhang, Jiawei, et autres
Publié: (2020)

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
par: Jiang, Ruichen, et autres
Publié: (2024)