Cover Image

Robust and Fast Training via Per-Sample Clipping

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nobile, Davide, Grohs, Philipp
Format:	Preprint
Published:	2026
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

Double Momentum and Error Feedback for Clipping with Fast Rates and Differential Privacy
by: Islamov, Rustem, et al.
Published: (2025)

Regularized Gradient Clipping Provably Trains Wide and Deep Neural Networks
by: Tucat, Matteo, et al.
Published: (2024)

Differentially Private Clipped-SGD: High-Probability Convergence with Arbitrary Clipping Level
by: Khah, Saleh Vatan, et al.
Published: (2025)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
by: Sadiev, Abdurakhmon, et al.
Published: (2025)

Efficient Private SCO for Heavy-Tailed Data via Averaged Clipping
by: Jin, Chenhan, et al.
Published: (2022)

Non-Asymptotic Global Convergence of PPO-Clip
by: Liu, Yin, et al.
Published: (2025)

From Gradient Clipping to Normalization for Heavy Tailed SGD
by: Hübler, Florian, et al.
Published: (2024)

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

LAGO: A Local-Global Optimization Framework Combining Trust Region Methods and Bayesian Optimization
by: Van Dieren, Eliott, et al.
Published: (2026)

Offline Policy Learning with Weight Clipping and Heaviside Composite Optimization
by: Liu, Jingren, et al.
Published: (2026)

Gap Safe Screening Rules for Fast Training of Robust Support Vector Machines under Feature Noise
by: Nguyen, Tan-Hau, et al.
Published: (2026)

Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Clipping Bias and Remedies
by: Li, Qiang, et al.
Published: (2024)

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
by: Armacki, Aleksandar, et al.
Published: (2026)

Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters
by: Yukhimchuk, Alexander, et al.
Published: (2026)

Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
by: Chezhegov, Savelii, et al.
Published: (2024)

Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
by: Gorbunov, Eduard, et al.
Published: (2024)

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
by: Liu, Zijian, et al.
Published: (2024)

On the Convergence of DP-SGD with Adaptive Clipping
by: Shulgin, Egor, et al.
Published: (2024)

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
by: Liu, Zijian
Published: (2025)

Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration
by: Sun, Tao, et al.
Published: (2024)

Convergence of Clipped-SGD for Convex $(L_0,L_1)$-Smooth Optimization with Heavy-Tailed Noise
by: Chezhegov, Savelii, et al.
Published: (2025)

Group Distributionally Robust Optimization with Flexible Sample Queries
by: Bai, Haomin, et al.
Published: (2025)

Sample Complexity of Variance-reduced Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2025)

Clapping: Removing Per-sample Storage for Pipeline Parallel Distributed Optimization with Communication Compression
by: Kong, Boao, et al.
Published: (2025)

Neighbor-Sampling Based Momentum Stochastic Methods for Training Graph Neural Networks
by: Noel, Molly, et al.
Published: (2025)

Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods
by: O'Leary-Roseberry, Thomas, et al.
Published: (2024)

Certified Robust Invariant Polytope Training in Neural Controlled ODEs
by: Harapanahalli, Akash, et al.
Published: (2024)

Fast sparse optimization via adaptive shrinkage
by: Cerone, Vito, et al.
Published: (2025)

Improving Feasibility via Fast Autoencoder-Based Projections
by: Chzhen, Maria, et al.
Published: (2026)

Fast Nonlinear Two-Time-Scale Stochastic Approximation: Achieving $O(1/k)$ Finite-Sample Complexity
by: Doan, Thinh T.
Published: (2024)

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
by: Zhang, Runyu, et al.
Published: (2023)

Clip-and-Verify: Linear Constraint-Driven Domain Clipping for Accelerating Neural Network Verification
by: Zhou, Duo, et al.
Published: (2025)

Gaussian Process Thompson Sampling via Rootfinding
by: Adebiyi, Taiwo A., et al.
Published: (2024)

Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks
by: Bernardelli, Ambrogio Maria, et al.
Published: (2022)

Safety Beyond the Training Data: Robust Out-of-Distribution MPC via Conformalized System Level Synthesis
by: Srinivasan, Anutam, et al.
Published: (2026)

Conditional Sampling via Wasserstein Autoencoders and Triangular Transport
by: Al-Jarrah, Mohammad, et al.
Published: (2026)

Optimizing Posterior Samples for Bayesian Optimization via Rootfinding
by: Adebiyi, Taiwo A., et al.
Published: (2024)

Practical Bayesian Algorithm Execution via Posterior Sampling
by: Cheng, Chu Xin, et al.
Published: (2024)

Achieving Margin Maximization Exponentially Fast via Progressive Norm Rescaling
by: Wang, Mingze, et al.
Published: (2023)