Outlier-Robust Nonlinear Moving Horizon Estimation using Adaptive Loss Functions

• URL: http://arxiv.org/abs/2604.04862v1
• Date: Mon, 06 Apr 2026 17:06:33 GMT
• Title: Outlier-Robust Nonlinear Moving Horizon Estimation using Adaptive Loss Functions
• Abstract summary: The proposed approach prioritizes the fitting of uncontaminated data and downweights the contaminated ones.<n>A tuning parameter is incorporated into the framework to control the shape of the loss function for adjusting the estimator's robustness to outliers.<n>The simulation results demonstrate that adaptation occurs in just a few iterations, whereas the traditional behaviour predominates when the measurements are free of outliers.
• Score: 40.32737814489449
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we propose an adaptive robust loss function framework for MHE, integrating an adaptive robust loss function to reduce the impact of outliers with a regularization term that avoids naive solutions. The proposed approach prioritizes the fitting of uncontaminated data and downweights the contaminated ones. A tuning parameter is incorporated into the framework to control the shape of the loss function for adjusting the estimator's robustness to outliers. The simulation results demonstrate that adaptation occurs in just a few iterations, whereas the traditional behaviour $\mathrm{L_2}$ predominates when the measurements are free of outliers.

Related papers

• Non-Parametric Rehearsal Learning via Conditional Mean Embeddings [88.89267783967263]
  We propose a non-parametric rehearsal learning approach for textitavoiding undesired future (AUF) problems.<n>Specifically, we use kernel machinery to reformulate the AUF objective into a unified representation that disentangles desirability modeling from action-induced distributional changes.
  arXiv  Detail & Related papers  (2026-05-09T15:30:52Z)
• Variational Rectification Inference for Learning with Noisy Labels [74.85528327499662]
  We propose variational rectification inference (VRI) to formulate the adaptive rectification for loss functions.<n>VRI is constructed as a hierarchical Bayes by treating the rectifying vector as a latent variable.<n>By introducing the variational term in VRI, the conditional posterior is estimated accurately and avoids collapsing to a Dirac delta function.
  arXiv  Detail & Related papers  (2026-03-18T01:25:08Z)
• A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage [0.554780083433538]
  We consider supervised learning problems in which set predictions provide explicit uncertainty estimates.<n>We propose a convex loss function for nondecreasing subset-valued functions obtained as level sets of a real-valued function.<n>We show how to naturally obtain sets with optimized conditional coverage.
  arXiv  Detail & Related papers  (2025-12-22T08:41:31Z)
• Variation-Bounded Loss for Noise-Tolerant Learning [105.20373602308284]
  We introduce the Variation Ratio as a novel property related to the robustness of loss functions.<n>We propose a new family of robust loss functions, termed Variation-Bounded Loss (VBL), which is characterized by a bounded variation ratio.
  arXiv  Detail & Related papers  (2025-11-15T10:15:29Z)
• Matrix Sensing with Kernel Optimal Loss: Robustness and Optimization Landscape [10.674539579679871]
  In traditional regression tasks, mean squared error (MSE) loss is a common choice, but it can be unreliable non-Gaussian or heavy-tailed noise.<n>We adopt a robust loss formulation based on a kernel-based estimate of the residual density and maximize the estimated log-likelihood.
  arXiv  Detail & Related papers  (2025-11-03T23:22:37Z)
• Error-quantified Conformal Inference for Time Series [55.11926160774831]
  Uncertainty quantification in time series prediction is challenging due to the temporal dependence and distribution shift on sequential data.<n>We propose itError-quantified Conformal Inference (ECI) by smoothing the quantile loss function.<n>ECI can achieve valid miscoverage control and output tighter prediction sets than other baselines.
  arXiv  Detail & Related papers  (2025-02-02T15:02:36Z)
• Adaptive Conformal Inference by Betting [51.272991377903274]
  We consider the problem of adaptive conformal inference without any assumptions about the data generating process.<n>Existing approaches for adaptive conformal inference are based on optimizing the pinball loss using variants of online gradient descent.<n>We propose a different approach for adaptive conformal inference that leverages parameter-free online convex optimization techniques.
  arXiv  Detail & Related papers  (2024-12-26T18:42:08Z)
• LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization [56.67706781191521]
  An adversary can introduce outliers by corrupting loss functions in an arbitrary number of k, unknown to the learner. We present a robust online rounds optimization framework, where an adversary can introduce outliers by corrupting loss functions in an arbitrary number of k, unknown.
  arXiv  Detail & Related papers  (2024-08-12T17:08:31Z)
• Robust support vector machines via conic optimization [0.8594140167290099]
  We consider the problem of convex computational machines robust to uncertainty. We show that the proposed estimator is competitive with the SVMs with the loss in outlier-free and better in the presence of outliers.
  arXiv  Detail & Related papers  (2024-02-02T05:42:50Z)
• Loss-Controlling Calibration for Predictive Models [5.51361762392299]
  We propose a learning framework for calibrating predictive models to make loss-controlling prediction for exchangeable data. By comparison, the predictors built by the proposed loss-controlling approach are not limited to set predictors. Our proposed method is applied to selective regression and high-impact weather forecasting problems.
  arXiv  Detail & Related papers  (2023-01-11T09:44:55Z)
• Support estimation in high-dimensional heteroscedastic mean regression [2.07180164747172]
  We consider a linear mean regression model with random design and potentially heteroscedastic, heavy-tailed errors.<n>We use a strictly convex, smooth variant of the Huber loss function with tuning parameter depending on the parameters of the problem.<n>For the resulting estimator we show sign-consistency and optimal rates of convergence in the $ell_infty$ norm.
  arXiv  Detail & Related papers  (2020-11-03T09:46:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.