English
Related papers

Related papers: Making Convex Loss Functions Robust to Outliers us…

200 papers

Nonlinear estimation in robotics and vision is typically plagued with outliers due to wrong data association, or to incorrect detections from signal processing and machine learning methods. This paper introduces two unifying formulations…

Computer Vision and Pattern Recognition · Computer Science 2021-07-05 Pasquale Antonante , Vasileios Tzoumas , Heng Yang , Luca Carlone

This work proposes a new loss function targeting classification problems, utilizing a source of information overlooked by cross entropy loss. First, we derive a series of the tightest upper and lower bounds for the probability of a random…

Computer Vision and Pattern Recognition · Computer Science 2021-10-26 Ali Ghobadzadeh , Amir Lashkari

In this paper, we study the support recovery guarantees of underdetermined sparse regression using the $\ell_1$-norm as a regularizer and a non-smooth loss function for data fidelity. More precisely, we focus in detail on the cases of…

Information Theory · Computer Science 2016-11-04 Kévin Degraux , Gabriel Peyré , Jalal M. Fadili , Laurent Jacques

Object grasping is a crucial technology enabling robots to perceive and interact with the environment sufficiently. However, in practical applications, researchers are faced with missing or noisy ground truth while training the…

Robotics · Computer Science 2024-09-10 Yangfan Deng , Mengyao Zhang , Yong Zhao

In this paper, we address the problem of how to robustly train a ConvNet for regression, or deep robust regression. Traditionally, deep regression employs the L2 loss function, known to be sensitive to outliers, i.e. samples that either lie…

Computer Vision and Pattern Recognition · Computer Science 2018-08-29 Stéphane Lathuilière , Pablo Mesejo , Xavier Alameda-Pineda , Radu Horaud

We establish risk bounds for Regularized Empirical Risk Minimizers (RERM) when the loss is Lipschitz and convex and the regularization function is a norm. In a first part, we obtain these results in the i.i.d. setup under subgaussian…

Statistics Theory · Mathematics 2021-01-07 Geoffrey Chinot , Guillaume Lecué , Matthieu Lerasle

While the traditional formulation of machine learning tasks is in terms of performance on average, in practice we are often interested in how well a trained model performs on rare or difficult data points at test time. To achieve more…

Machine Learning · Computer Science 2025-12-29 Matthew J. Holland , Toma Hamada

Robust loss minimization is an important strategy for handling robust learning issue on noisy labels. Current robust loss functions, however, inevitably involve hyperparameter(s) to be tuned, manually or heuristically through cross…

Machine Learning · Computer Science 2020-02-18 Jun Shu , Qian Zhao , Keyu Chen , Zongben Xu , Deyu Meng

Optimization problems involving minimization of a rank-one convex function over constraints modeling restrictions on the support of the decision variables emerge in various machine learning applications. These problems are often modeled…

Optimization and Control · Mathematics 2023-11-29 Soroosh Shafiee , Fatma Kılınç-Karzan

We consider the problem of learning a loss function which, when minimized over a training dataset, yields a model that approximately minimizes a validation error metric. Though learning an optimal loss function is NP-hard, we present an…

Machine Learning · Computer Science 2019-07-02 Matthew Streeter

We provide a unified framework that applies to a general family of convex losses across binary and multiclass settings in the overparameterized regime to approximately characterize the implicit bias of gradient descent in closed form.…

Machine Learning · Statistics 2025-06-11 Kuo-Wei Lai , Vidya Muthukumar

Loss functions serve as the foundation of supervised learning and are often chosen prior to model development. To avoid potentially ad hoc choices of losses, statistical decision theory describes a desirable property for losses known as…

Machine Learning · Statistics 2023-11-30 Kevin Lam , Christian Walder , Spiridon Penev , Richard Nock

We consider the problem of minimizing a difference-of-convex (DC) function, which can be written as the sum of a smooth convex function with Lipschitz gradient, a proper closed convex function and a continuous possibly nonsmooth concave…

Optimization and Control · Mathematics 2018-04-20 Tianxiang Liu , Ting Kei Pong , Akiko Takeda

Loss functions drive the optimization of machine learning algorithms. The choice of a loss function can have a significant impact on the training of a model, and how the model learns the data. Binary classification is one of the major…

Machine Learning · Computer Science 2022-11-02 Rayan Wali

In many applications, when building linear regression models, it is important to account for the presence of outliers, i.e., corrupted input data points. Such problems can be formulated as mixed-integer optimization problems involving cubic…

Optimization and Control · Mathematics 2023-07-13 Andrés Gómez , José Neto

Loss function learning is a new meta-learning paradigm that aims to automate the essential task of designing a loss function for a machine learning model. Existing techniques for loss function learning have shown promising results, often…

Machine Learning · Computer Science 2025-10-14 Christian Raymond , Qi Chen , Bing Xue , Mengjie Zhang

A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…

Information Theory · Computer Science 2018-05-11 Amichai Painsky , Gregory W. Wornell

Regression is the workhorse of statistics, and is often faced with real data that contain outliers. When these are casewise outliers, that is, cases that are entirely wrong or belong to a different population, the issue can be remedied by…

Methodology · Statistics 2026-03-06 Jakob Raymaekers , Peter J. Rousseeuw

We study the excess minimum risk in statistical inference, defined as the difference between the minimum expected loss in estimating a random variable from an observed feature vector and the minimum expected loss in estimating the same…

Information Theory · Computer Science 2023-09-29 László Györfi , Tamás Linder , Harro Walk

In this paper, we propose a fuzzy adaptive loss function for enhancing deep learning performance in classification tasks. Specifically, we redefine the cross-entropy loss to effectively address class-level noise conditions, including the…

Machine Learning · Computer Science 2023-10-13 Sebastián Maldonado , Carla Vairetti , Katherine Jara , Miguel Carrasco , Julio López