Sciweavers

Share
COMPGEOM
2004
ACM

On the least median square problem

12 years 5 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear statistical estimators. Given a set of n points in IRd and a parameter k, the problem is equivalent to computing the slab bounded by two parallel hyperplanes of minimum separation 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 on the computational complexity of these problems. The lower bounds hold if deciding whether d + 1 points are coplanar requires Ω(nd) time.
Jeff Erickson, Sariel Har-Peled, David M. Mount
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where COMPGEOM
Authors Jeff Erickson, Sariel Har-Peled, David M. Mount
Comments (0)
books