mlsanityData to 7 Oct 2026

RIGID: Robust Linear Regression with Missing Data

arXiv 2205.13635 ↗First posted 26 May 2022cs.LG math.OC math.STcited by 2

Not on the map. Why?

Abstract (arXiv)

We present a robust framework to perform linear regression with missing entries in the features. By considering an elliptical data distribution, and specifically a multivariate normal model, we are able to conditionally formulate a distribution for the missing entries and present a robust framework, which minimizes the worst case error caused by the uncertainty about the missing data. We show that the proposed formulation, which naturally takes into account the dependency between different variables, ultimately reduces to a convex program, for which a customized and scalable solver can be delivered. In addition to a detailed analysis to deliver such solver, we also asymptoticly analyze the behavior of the proposed framework, and present technical discussions to estimate the required input parameters. We complement our analysis with experiments performed on synthetic, semi-synthetic, and real data, and show how the proposed formulation improves the prediction accuracy and robustness, and outperforms the competing techniques. Missing data is a common problem associated with many datasets in machine learning. With the significant increase in using robust optimization techniques to train machine learning models, this paper presents a novel robust regression framework that operates by minimizing the uncertainty associated with missing data. The proposed approach allows training models with incomplete data, while minimizing the impact of uncertainty associated with the unavailable data. The ideas developed in this paper can be generalized beyond linear models and elliptical data distributions.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 13 of its 43 references that are in the map. First posted on arXiv 26 May 2022.

Builds on

13 of 43 references.

References · 13

  1. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  2. 2021Convex optimizationcited by 2,479
  3. 2020Missing Data Imputation using Optimal Transportcited by 99
  4. 2018Sparse DNNs with Improved Adversarial Robustnesscited by 71
  5. 2021What's a good imputation to predict with missing values?cited by 61
  6. 2019On the consistency of supervised learning with missing valuescited by 52
  7. 2018Combating Adversarial Attacks Using Sparse Representationscited by 9
  8. 2020Imputation for High-Dimensional Linear Regressioncited by 9
  9. 2018Fast Convex Pruning of Deep Neural Networkscited by 8
  10. 2014Robust Linear Regression: A Review and Comparisoncited by 5
  11. 2018Sparse spectral estimation with missing and corrupted measurementscited by 5
  12. 2016Minimax Rate-optimal Estimation of High-dimensional Covariance Matrices with Incomplete Datacited by 2
1 more
  1. 2019Precision Matrix Estimation with Noisy and Missing Datacited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.