Heavy-Tailed Noise
Overview
The field asks how to estimate, optimize, and make predictions when noise has only a finite p-th moment, or occasionally infinite variance. Common approaches include clipping and truncation, Huber losses, median-of-means estimators, and robust variants of SGD, mirror descent, and bandit algorithms. These methods are studied in settings such as nonconvex optimization, time-series and system identification, federated learning, and stochastic bandits, with guarantees expressed in terms of tail moments and dependence. A central tension is that robustness can control rare large errors but may add bias or slow convergence, while methods that adapt to unknown tail behavior can have unavoidable performance costs.
Latest papers
34 papers3 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.