mlsanityData to 14 Oct 2026

Being Properly Improper

arXiv 2106.09920 ↗First posted 18 Jun 2021cs.LG cs.AI math.OCcited by 11

Not on the map. Why?

Abstract (arXiv)

Properness for supervised losses stipulates that the loss function shapes the learning algorithm towards the true posterior of the data generating distribution. Unfortunately, data in modern machine learning can be corrupted or twisted in many ways. Hence, optimizing a proper loss function on twisted data could perilously lead the learning algorithm towards the twisted posterior, rather than to the desired clean posterior. Many papers cope with specific twists (e.g., label/feature/adversarial noise), but there is a growing need for a unified and actionable understanding atop properness. Our chief theoretical contribution is a generalization of the properness framework with a notion called twist-properness, which delineates loss functions with the ability to "untwist" the twisted posterior into the clean posterior. Notably, we show that a nontrivial extension of a loss function called α-loss, which was first introduced in information theory, is twist-proper. We study the twist-proper α-loss under a novel boosting algorithm, called PILBoost, and provide formal and experimental results for this algorithm. Our overarching practical conclusion is that the twist-proper α-loss outperforms the proper log-loss on several variants of twisted data.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 33 of its 88 references that are in the map. First posted on arXiv 18 Jun 2021.

Builds on

33 of 88 references.

References · 33

  1. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  2. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  4. 2013Intriguing properties of neural networkscited by 5,155
  5. 2017On Calibration of Modern Neural Networkscited by 4,960
  6. 2019Advances and Open Problems in Federated Learningcited by 3,046
  7. 2021Convex optimizationcited by 2,515
  8. 2019Invariant Risk Minimizationcited by 1,854
  9. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 997
  10. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 665
  11. 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 443
  12. 2019AutoML: A Survey of the State-of-the-Artcited by 390
21 more
  1. 2020Calibrating Deep Neural Networks using Focal Losscited by 357
  2. 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
  3. 2017A General and Adaptive Robust Loss Functioncited by 236
  4. 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
  5. 2021Learning Noise Transition Matrix from Only Noisy Labels via Total Variation Regularizationcited by 62
  6. 2019Robust Bi-Tempered Logistic Loss Based on Bregman Divergencescited by 61
  7. 2021Data Poisoning Attacks to Deep Learning Based Recommender Systemscited by 43
  8. 2019Provably Robust Boosted Decision Stumps and Trees against Adversarial Attackscited by 26
  9. 2019A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalizationcited by 23
  10. 2020Systematic Evaluation of Backdoor Data Poisoning Attacks on Image Classifierscited by 23
  11. 2020A One-step Approach to Covariate Shift Adaptationcited by 21
  12. 2020On Focal Loss for Class-Posterior Probability Estimation: A Theoretical Perspectivecited by 21
  13. 2020Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Methodcited by 17
  14. 2020Boosting Simple Learnerscited by 16
  15. 2020Efficient, Noise-Tolerant, and Private Learning via Boostingcited by 15
  16. 2017Two-temperature logistic regression based on the Tsallis divergencecited by 14
  17. 2019A Tunable Loss Function for Binary Classificationcited by 11
  18. 2020Supervised Learning: No Loss No Crycited by 7
  19. 2020All your loss are belong to Bayescited by 3
  20. 2018Monge blunts Bayes: Hardness Results for Adversarial Trainingcited by 2
  21. 2015Rademacher Observations, Private Data, and Boostingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 4; 2023: 3; 2024: 2; 2025: 1; 2026: 1.

11 papers.