conftrace_

high probability bound

17 papers

Explore in graph

Co-occurring keywords

stochastic gradient descent (1091) generalization bound (652) stochastic optimization (1060) high probability convergence (3) gradient clipping (54) regret bound (1926) strongly convex (89) sample complexity (1169) convex optimization (1321) online learning (1777)

Papers

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise JMLR 2024
High Probability Bounds for Stochastic Continuous Submodular Maximization AISTATS 2023
The One-Inclusion Graph Algorithm is not Always Optimal COLT 2023
Optimal Excess Risk Bounds for Empirical Risk Minimization on $p$-Norm Linear Regression NIPS 2023
Learning via Wasserstein-Based High Probability Generalisation Bounds NIPS 2023
Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise NIPS 2023
Large deviations rates for stochastic gradient descent with strongly convex functions AISTATS 2023
Parameter-free Regret in High Probability with Heavy Tails NIPS 2022
High Probability Guarantees for Nonconvex Stochastic Gradient Descent with Heavy Tails ICML 2022
From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021
Explaining fast improvement in online imitation learning UAI 2021
Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize NIPS 2021
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NIPS 2020
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate COLT 2019
Tight analyses for non-smooth stochastic gradient descent COLT 2019
Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities NIPS 2018
Fast rates with high probability in exp-concave statistical learning AISTATS 2017