Fetching the paper…
Reading the bibliography…
We study stochastic convex optimization under infinite noise variance.
On stochastic approximation processes with infinite variance
Tatiana P. Krasulina · 1969
Earlier work this paper cites.
Convex analysis
R. Tyrrell Rockafellar · 1970
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadi Nemirovski and David Yudin · 1983
Earlier work this paper cites.
On uniformly convex functions
Constantin Zalinescu · 1983
Earlier work this paper cites.
Uniformly convex and uniformly smooth convex functions
Dominique Azé and Jean-Paul Penot · 1995
Earlier work this paper cites.
The robustness of the p-norm algorithms
Claudio Gentile and Nick Littlestone · 1999
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
Robust statistics
Peter J Huber · 2004
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Concentration inequalities and model selection: Ecole d’Eté de Probabilités de Saint-Flour XXXIII-2003
Pascal Massart · 2007
Earlier work this paper cites.
Large deviations of vector-valued martingales in 2-smooth normed spaces
Anatoli Juditsky and Arkadii S Nemirovski · 2008
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
Alekh Agarwal, Martin J Wainwright, Peter Bartlett, and Pradeep Ravikumar · 2009
Earlier work this paper cites.
On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Earlier work this paper cites.
Information complexity of black-box convex optimization: A new look via feedback information theory
Maxim Raginsky and Alexander Rakhlin · 2009
Earlier work this paper cites.
Composite objective mirror descent
John C Duchi, Shai Shalev-Shwartz, Yoram Singer, and Ambuj Tewari · 2010
Earlier work this paper cites.
Convex games in Banach spaces
Karthik Sridharan and Ambuj Tewari · 2010
Earlier work this paper cites.
Heavy tail phenomenon and convergence to stable laws for iterated lipschitz maps
Mariusz Mirek · 2011
Earlier work this paper cites.
On the universality of online mirror descent
Nati Srebro, Karthik Sridharan, and Ambuj Tewari · 2011
Earlier work this paper cites.
Stochastic approximation with long range dependent and heavy tailed noise
Venkat Anantharam and Vivek S. Borkar · 2012
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
Alekh Agarwal, Peter L Bartlett, Pradeep Ravikumar, and Martin J Wainwright · 2012
Cited alongside, same era.
Challenging the empirical mean and empirical variance: A deviation study
Olivier Catoni · 2012
Cited alongside, same era.
Ergodic mirror descent
John C Duchi, Alekh Agarwal, Mikael Johansson, and Michael I Jordan · 2012
Cited alongside, same era.
Festschrift for Lucien Le Cam: Research papers in probability and statistics
David Pollard, Erik Torgersen, and Grace L Yang · 2012
Cited alongside, same era.
Learning from an optimization viewpoint
Karthik Sridharan · 2012
Cited alongside, same era.
Optimal rates for stochastic convex optimization under Tsybakov noise condition
A tail-index analysis of stochastic gradient noise in deep neural networks
Umut Simsekli, Levent Sagun, and Mert Gurbuzbalaban · 2019
Later among the works it cites.
Understanding gradient clipping in private sgd: A geometric perspective
Xiangyi Chen, Steven Z Wu, and Mingyi Hong · 2020
Later among the works it cites.
Stochastic optimization with heavy-tailed noise via accelerated gradient clipping, 2020
Eduard Gorbunov, Marina Danilova, and Alexander Gasnikov · 2020
Later among the works it cites.
Robust high dimensional learning for lipschitz and convex losses
Chinot Geoffrey, Lecué Guillaume, and Lerasle Matthieu · 2020
Later among the works it cites.
Mean estimation with sub-gaussian rates in polynomial time
Samuel B Hopkins · 2020
Later among the works it cites.
Robust machine learning by median-of-means: theory and practice
Guillaume Lecué and Matthieu Lerasle · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Aaditya Ramdas and Aarti Singh · 2013
Cited alongside, same era.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2014
Cited alongside, same era.
Primal-dual subgradient methods for minimizing uniformly convex functions
Anatoli Iouditski and Yuri Nesterov · 2014
Cited alongside, same era.
Geometric median and robust estimation in Banach spaces
Stanislav Minsker · 2015
Cited alongside, same era.
Loss minimization and parameter estimation with heavy tails
Daniel Hsu and Sivan Sabato · 2016
Cited alongside, same era.
First-order methods in optimization
Amir Beck · 2017
Cited alongside, same era.
Online estimation of the geometric median in Hilbert spaces: Nonasymptotic confidence balls
Hervé Cardot, Peggy Cénac, and Antoine Godichon-Baggioni · 2017
Cited alongside, same era.
Later among the works it cites.
Why are adaptive methods good for attention models?
Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim, Sashank Reddi, Sanjiv Kumar, and Suvrit Sra · 2020
Later among the works it cites.
On monte-carlo methods in convex stochastic optimization
Daniel Bartl and Shahar Mendelson · 2021
Later among the works it cites.
High-probability bounds for non-convex stochastic optimization with heavy tails
Ashok Cutkosky and Harsh Mehta · 2021
Later among the works it cites.
Asymmetric heavy tails and implicit bias in Gaussian noise injections
Alexander Camuto, Xiaoyu Wang, Lingjiong Zhu, Chris Holmes, Mert Gürbüzbalaban, and Umut Şimşekli · 2021
Later among the works it cites.
From low probability to high confidence in stochastic convex optimization
Damek Davis, Dmitriy Drusvyatskiy, Lin Xiao, and Junyu Zhang · 2021
Later among the works it cites.
Ryan D’Orazio, Nicolas Loizou, Issam Laradji, and Ioannis Mitliagkas · 2021
Later among the works it cites.
Eduard Gorbunov, Marina Danilova, Innokentiy Shibaev, Pavel Dvurechensky, and Alexander Gasnikov · 2021
Later among the works it cites.
Fractional moment-preserving initialization schemes for training deep neural networks
Mert Gürbüzbalaban and Yuanhan Hu · 2021
Later among the works it cites.
The heavy-tail phenomenon in sgd
Mert Gürbüzbalaban, Umut Şimşekli, and Lingjiong Zhu · 2021
Later among the works it cites.
Multiplicative noise and heavy tails in stochastic optimization
Liam Hodgkinson and Michael W. Mahoney · 2021
Later among the works it cites.
Stochastic Polyak step-size for sgd: An adaptive learning rate for fast convergence
Nicolas Loizou, Sharan Vaswani, Issam Hadj Laradji, and Simon Lacoste-Julien · 2021
Later among the works it cites.
Heavy-tailed streaming statistical estimation
Che-Ping Tsai, Adarsh Prasad, Sivaraman Balakrishnan, and Pradeep Ravikumar · 2021
Later among the works it cites.
Convergence rates of stochastic gradient descent under infinite noise variance
Hongjian Wang, Mert Gurbuzbalaban, Lingjiong Zhu, Umut Simsekli, and Murat A Erdogdu · 2021
Later among the works it cites.
Beyond sub-gaussian noises: Sharp concentration analysis for stochastic gradient descent
Zhipeng Lou, Wanrong Zhu, and Wei Biao Wu · 2022
Closest in time.