Outlier-robust neural network training: variation regularization meets trimmed loss to prevent functional breakdown
Not on the map. Why?
Abstract (arXiv)
In this study, we tackle the challenge of outlier-robust predictive modeling using highly expressive neural networks. Our approach integrates two key components: (1) a transformed trimmed loss (TTL), a computationally efficient variant of the classical trimmed loss, and (2) higher-order variation regularization (HOVR), which imposes smoothness constraints on the prediction function. While traditional robust statistics typically assume low-complexity models such as linear and kernel models, applying TTL alone to modern neural networks may fail to ensure robustness, as their high expressive power allows them to fit both inliers and outliers, even when a robust loss is used. To address this, we revisit the traditional notion of breakdown point and adapt it to the nonlinear function setting, introducing a regularization scheme via HOVR that controls the model's capacity and suppresses overfitting to outliers. We theoretically establish that our training procedure retains a high functional breakdown point, thereby ensuring robustness to outlier contamination. We develop a stochastic optimization algorithm tailored to this framework and provide a theoretical guarantee of its convergence.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 60 references that are in the map. First posted on arXiv 4 Aug 2023.
Builds on
21 of 60 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023A Survey on Evaluation of Large Language Modelscited by 1,242
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2022Scientific Machine Learning through Physics-Informed Neural Networks: Where we are and What's nextcited by 608
- 2016Error bounds for approximations with deep ReLU networkscited by 574
- 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 434
- 2017A unified deep artificial neural network approach to partial differential equations in complex geometriescited by 122
- 2018Data augmentation instead of explicit regularizationcited by 63
- 2021What Kinds of Functions do Deep Neural Networks Learn? Insights from Variational Spline Theorycited by 60
- 2018Towards Understanding Regularization in Batch Normalizationcited by 56
9 more
- 2020Neural Splines: Fitting 3D Surfaces with Infinitely-Wide Neural Networkscited by 52
- 2021Understanding neural networks with reproducing kernel Banach spacescited by 50
- 2022Ridges, Neural Networks, and the Radon Transformcited by 18
- 2021Structured Sparsity Inducing Adaptive Optimizers for Deep Learningcited by 17
- 2018Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergencecited by 16
- 2019Non-asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problemscited by 14
- 2019Higher-order total variation approaches and generalisationscited by 14
- 2019Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimizationcited by 4
- 2019Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimizationcited by 3
Built on by
Not cited yet.