Co-occurring keywords · papers mentioning both
Papers
Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
ALT 2026
High-probability Convergence Bounds for Online Nonlinear Stochastic Gradient Descent under Heavy-tailed Noise
AISTATS 2025
Generalization Bounds for Heavy-Tailed SDEs through the Fractional Fokker-Planck Equation
ICML 2024
High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
JMLR 2024
Flexible risk design using bi-directional dispersion
AISTATS 2023
High Probability Bounds for Stochastic Continuous Submodular Maximization
AISTATS 2023
High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance
ICML 2023
Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise
NeurIPS 2023
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
ALT 2023
Large deviations rates for stochastic gradient descent with strongly convex functions
AISTATS 2023
Learning via Wasserstein-Based High Probability Generalisation Bounds
NeurIPS 2023
Optimal Excess Risk Bounds for Empirical Risk Minimization on p-Norm Linear Regression
NeurIPS 2023
The One-Inclusion Graph Algorithm is not Always Optimal
COLT 2023
High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize
ICLR 2022
High-probability bounds for robust stochastic Frank-Wolfe algorithm
UAI 2022
High Probability Generalization Bounds with Fast Rates for Minimax Problems
ICLR 2022
High Probability Guarantees for Nonconvex Stochastic Gradient Descent with Heavy Tails
ICML 2022
Parameter-free Regret in High Probability with Heavy Tails
NeurIPS 2022
Explaining fast improvement in online imitation learning
UAI 2021
From Low Probability to High Confidence in Stochastic Convex Optimization
JMLR 2021
High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails
NeurIPS 2021
Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize
NeurIPS 2021
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs
NeurIPS 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