Abstract
We consider the exact and approximate computational complexity of the multivariate least median-of-squares (LMS) linear regression estimator. The LMS estimator is among the most widely used robust linear statistical estimators. Given a set of n points in \({\Bbb R}^d\) and a parameter k, the problem is equivalent to computing the narrowest slab bounded by two parallel hyperplanes that contains k of the points. We present algorithms for the exact and approximate versions of the multivariate LMS problem. We also provide nearly matching lower bounds for these problems. These lower bounds hold under the assumptions that k is Ω(n) and that deciding whether n given points in \({\Bbb R}^d\) are affinely non-degenerate requires Ω(nd) time.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Erickson, J., Har-Peled, S. & Mount, D. On the Least Median Square Problem. Discrete Comput Geom 36, 593–607 (2006). https://doi.org/10.1007/s00454-006-1267-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-006-1267-6