An Unrestricted Learning Procedure

DOI10.1145/3361699zbMath1473.68156arXiv1707.05342OpenAlexW3011981266MaRDI QIDQ5215471

Shahar Mendelson

Publication date: 11 February 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.05342

zbMATH Keywords

heavy-tailed learning problemsunrestricted learning procedure

Mathematics Subject Classification ID

Statistics of extreme values; tail inference (62G32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

On least squares estimation under heteroscedastic and heavy-tailed errors ⋮ Regularization, sparse recovery, and median-of-means tournaments ⋮ Robust classification via MOM minimization ⋮ Extending the scope of the small-ball method ⋮ Mean estimation and regression under heavy-tailed distributions: A survey ⋮ On Monte-Carlo methods in convex stochastic optimization ⋮ Distribution-free robust linear regression

This page was built for publication: An Unrestricted Learning Procedure