Research map / Optimization / Nonconvex and smooth optimization
Anytime Guarantees under Heavy-Tailed Data
Matthew J. Holland
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| query gradients at weighted-average iterates instead of the current ancillary iterates | Anytime-Robust-SGD · adult, CIFAR-10, cod_rna, covtype, emnist_balanced, fashion_mnist, mnist, protein | training and test loss | Improved |
| robustify gradient feedback with the Process truncation step (ablation) | Anytime-SGD · CIFAR-10 | training and test loss | Hurt |
Closest papers by meaning
- Safe Online Convex Optimization with Heavy-Tailed Observation Noises (AAAI 2025 · similarity 0.89)
- Stochastic Zeroth-Order Optimization Under Heavy-Tailed Noise (NeurIPS 2026 · similarity 0.89)
- High Probability Guarantees for Nonconvex Stochastic Gradient Descent with Heavy Tails (ICML 2022 · similarity 0.88)
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.88)
- Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits (NeurIPS 2025 · similarity 0.88)
- High-Probability Bound for Non-Smooth Non-Convex Stochastic Optimization with Heavy Tails (ICML 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
