mlsanityData to 14 Oct 2026

Empirical Risk Minimization for Losses without Variance

arXiv 2309.03818 ↗First posted 7 Sep 2023stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper considers an empirical risk minimization problem under heavy-tailed settings, where data does not have finite variance, but only has p-th moment with p ∈ (1,2). Instead of using estimation procedure based on truncated observed data, we choose the optimizer by minimizing the risk value. Those risk values can be robustly estimated via using the remarkable Catoni's method (Catoni, 2012). Thanks to the structure of Catoni-type influence functions, we are able to establish excess risk upper bounds via using generalized generic chaining methods. Moreover, we take computational issues into consideration. We especially theoretically investigate two types of optimization methods, robust gradient descent algorithm and empirical risk-based methods. With an extensive numerical study, we find that the optimizer based on empirical risks via Catoni-style estimation indeed shows better performance than other baselines. It indicates that estimation directly based on truncated data may lead to unsatisfactory results.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 42 references that are in the map. First posted on arXiv 7 Sep 2023.

Builds on

11 of 42 references.

References · 11

  1. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  2. 2016An overview of gradient descent optimization algorithmscited by 1,033
  3. 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 136
  4. 2013Loss minimization and parameter estimation with heavy tailscited by 50
  5. 2020Outlier Robust Mean Estimation with Subgaussian Rates via Stabilitycited by 50
  6. 2014Empirical risk minimization for heavy-tailed lossescited by 37
  7. 2016Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entriescited by 18
  8. 2021On Empirical Risk Minimization with Dependent and Heavy-Tailed Datacited by 16
  9. 2021No-Regret Reinforcement Learning with Heavy-Tailed Rewardscited by 14
  10. 2019Excess risk bounds in robust empirical risk minimizationcited by 9
  11. 2018Learning with Non-Convex Truncated Losses by SGDcited by 7

Built on by

Not cited yet.