Outlier-robust Estimation of a Sparse Linear Model Using Invexity
Machine Learning
2023-06-23 v1
Abstract
In this paper, we study problem of estimating a sparse regression vector with correct support in the presence of outlier samples. The inconsistency of lasso-type methods is well known in this scenario. We propose a combinatorial version of outlier-robust lasso which also identifies clean samples. Subsequently, we use these clean samples to make a good estimation. We also provide a novel invex relaxation for the combinatorial problem and provide provable theoretical guarantees for this relaxation. Finally, we conduct experiments to validate our theory and compare our results against standard lasso.
Cite
@article{arxiv.2306.12678,
title = {Outlier-robust Estimation of a Sparse Linear Model Using Invexity},
author = {Adarsh Barik and Jean Honorio},
journal= {arXiv preprint arXiv:2306.12678},
year = {2023}
}