Cover Image

High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Parletta, Daniela A., Paudice, Andrea, Pontil, Massimiliano, Salzo, Saverio
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Machine Learning 90C25, 62L20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Improved Analysis of the Clipped Stochastic subGradient Method under Heavy-Tailed Noise
by: Parletta, Daniela Angela, et al.
Published: (2024)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

Asynchronous Stochastic Approximation with Applications to Average-Reward Reinforcement Learning
by: Yu, Huizhen, et al.
Published: (2024)

Entropic Risk-Averse Generalized Momentum Methods
by: Can, Bugra, et al.
Published: (2022)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

Proximal DCA for Fréchet Regression on Riemannian Manifolds with Bounded Curvature
by: Zhou, Yamin, et al.
Published: (2026)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
by: Azuma, Godai, et al.
Published: (2025)

Multi-Iteration Stochastic Optimizers
by: Carlon, Andre, et al.
Published: (2020)

Monotone Causality in Opportunistically Stochastic Shortest Path Problems
by: Gaspard, Mallory E., et al.
Published: (2023)

Accelerated optimization algorithms and ordinary differential equations: the convex non Euclidean case
by: Dobson, Paul, et al.
Published: (2024)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Optimal Asymptotic Rates for (Stochastic) Gradient Descent under the Local PL-Condition: A Geometric Approach
by: Kassing, Sebastian, et al.
Published: (2026)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

Mini-Batch Covariance, Diffusion Limits, and Oracle Complexity in Stochastic Gradient Descent: A Sampling-Design Perspective
by: Zantedeschi, Daniel, et al.
Published: (2026)

Average-reward reinforcement learning in semi-Markov decision processes via relative value iteration
by: Yu, Huizhen, et al.
Published: (2025)

BISTRO -- A Bi-Fidelity Stochastic Gradient Framework using Trust-Regions for Optimization Under Uncertainty
by: Dixon, Thomas O., et al.
Published: (2025)

Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
by: Shen, Ya, et al.
Published: (2025)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
by: Xu, Xin
Published: (2025)

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

Non-facial exposedness of copositive cones over symmetric cones
by: Nishijima, Mitsuhiro, et al.
Published: (2024)

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
by: Harris, Elizabeth, et al.
Published: (2024)

Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
by: Chen, Zhongzhu, et al.
Published: (2023)

Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates
by: Grazzi, Riccardo, et al.
Published: (2024)

A Note on Stability in Asynchronous Stochastic Approximation without Communication Delays
by: Yu, Huizhen, et al.
Published: (2023)

Low Rank Convex Clustering For Matrix-Valued Observations
by: Lin, Meixia, et al.
Published: (2024)

Randomised Splitting Methods and Stochastic Gradient Descent
by: Shaw, Luke, et al.
Published: (2025)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

On the Convergence of HalpernSGD
by: Colao, Vittorio, et al.
Published: (2026)

Improved High-Probability Bounds for the Temporal Difference Learning Algorithm via Exponential Stability
by: Samsonov, Sergey, et al.
Published: (2023)

Maintenance optimization of a two-component system with mixed observability
by: Zhang, Nan, et al.
Published: (2026)

A Short Survey of Averaging Techniques in Stochastic Gradient Methods
by: Lakshmanan, K.
Published: (2026)

Optimal control under unknown intensity with Bayesian learning
by: Baradel, Nicolas, et al.
Published: (2024)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
by: Xu, Xin
Published: (2024)

On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)

On the Necessity of Two-Stage Estimation for Learning Dynamical Systems under Both Noise and Node-Wise Attacks
by: Kim, Jihun, et al.
Published: (2026)

Iteration Complexity of Frank-Wolfe and Its Variants for Bilevel Optimization
by: Palmieri, Anthony, et al.
Published: (2026)

Nonstationary Distribution Estimation via Wasserstein Probability Flows
by: Anderson, Edward J., et al.
Published: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)