Outlier Detection Using Nonconvex Penalized Regression
Yiyuan She, Art B. Owen

TL;DR
This paper introduces a fast, thresholding-based iterative method called -IPOD for outlier detection in regression, which outperforms existing methods in speed and accuracy, especially in high-dimensional settings.
Contribution
The paper proposes -IPOD, a novel outlier detection algorithm using nonconvex penalized regression with hard thresholding, improving speed and robustness over traditional methods.
Findings
-IPOD accurately detects outliers in various datasets.
It is significantly faster than iteratively reweighted least squares.
The method performs well in high-dimensional sparse settings.
Abstract
This paper studies the outlier detection problem from the point of view of penalized regressions. Our regression model adds one mean shift parameter for each of the data points. We then apply a regularization favoring a sparse vector of mean shift parameters. The usual penalty yields a convex criterion, but we find that it fails to deliver a robust estimator. The penalty corresponds to soft thresholding. We introduce a thresholding (denoted by ) based iterative procedure for outlier detection (-IPOD). A version based on hard thresholding correctly identifies outliers on some hard test problems. We find that -IPOD is much faster than iteratively reweighted least squares for large data because each iteration costs at most (and sometimes much less) avoiding an least squares estimate. We describe the connection between -IPOD…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Statistical Methods and Inference · Advanced Statistical Process Monitoring
