Sampling algorithms and coresets for ℓ p regression

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 2060-2078

  Dasgupta, Anirban ^a   Drineas, Petros ^b   Harb, Boulos ^c   Kumar, Ravi ^a   Mahoney, Michael W ^d  

^a YAHOO RESEARCH   (United States)

^b Rensselaer Polytechnic Institute   (United States)

^c GOOGLE INC   (United States)

^d STANFORD UNIVERSITY   (United States)

Author keywords

p regression; Randomized algorithms; Sampling algorithms

Indexed keywords

CLASSICAL PROBLEMS; CORE SET; DISCRETE ALGORITHMS; MATRIX; NEW YORK; OVER-CONSTRAINED; PHILADELPHIA; RANDOMIZED ALGORITHMS; REGRESSION PROBLEM; RESAMPLES; SAMPLING ALGORITHM; SAMPLING ALGORITHMS; SAMPLING-BASED; TWO STAGE;

APPROXIMATION ALGORITHMS; LEARNING ALGORITHMS;

REGRESSION ANALYSIS;

EID: 84863393897     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070696507     Document Type: Article

References (28)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, Approximating extent measures of points, J. ACM, 51 (2004), pp. 606-635.
2. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, Geometric approximation via coresets, in Combinatorial and Computational Geometry, J. E. Goodman, J. Pach, and E. Welzl, eds., Math. Sci. Res. Inst. Publ. 52, Cambridge University Press, Cambridge, UK, 2005, pp. 1-30.
3. N. Ailon and B. Chazelle, Approximate nearest neighbors and the fast Johnson- Lindenstrauss transform, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 557-563. (Pubitemid 44306590)
4. H. Auerbach, On the Area of Convex Curves with Conjugate Diameters, Ph.D. thesis, University of Lwów, Lwów, Poland, 1930 (in Polish).
5. B. Awerbuch and R. D. Kleinberg, Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 45-53.
6. M. Bädoiu and K. L. Clarkson, Smaller core-sets for balls, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2003, pp. 801-802.
7. S. Bernstein, Theory of Probability, Moscow, 1927 (in Russian).
8. J. Bourgain, J. Lindenstrauss, and V. Milman, Approximation of zonoids by zonotopes, Acta Math., 162 (1989), pp. 73-141.
9. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
10. S. Chatterjee, A. S. Hadi, and B. Price, Regression Analysis by Example, Wiley Series in Probability and Statistics, Wiley, New York, 2000.
11. 1 regression, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 257-266.
12. M. Day, Polygons circumscribed about closed convex curves, Trans. Amer. Math. Soc., 62 (1947), pp. 315-319.
13. 2 regression and applications, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2006, pp. 1127-1136.
14. D. Feldman, A. Fiat, and M. Sharir, Coresets for weighted facilities and their applications, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, D.C., 2006, pp. 315-324. (Pubitemid 351175520)
15. G. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins Studies in Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD, 1996.
16. S. Har-Peled and S. Mazumdar, On coresets for k-means and k-median clustering, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 291-300.
17. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning, Springer- Verlag, New York, 2003.
18. J. Kleinberg and M. Sandler, Using mixture models for collaborative filtering, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 569-578.
19. L. Lovasz, An Algorithmic Theory of Numbers, Graphs, and Convexity, CBMS-NSF Regoinal Conf. Ser. in Appl. Math. 50, SIAM, Philadelphia, 1986.
20. A. Maurer, A bound on the deviation probability for sums of non-negative random variables, JIPAM. J. Inequal. Pure Appl. Math., 4 (2003).
21. J. Matousek, Lectures on Discrete Geometry, Grad. Texts in Math., Springer-Verlag, New York, 2002.
22. T. Sarlós, Improved approximation algorithms for large matrices via random projections, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, D.C., 2006, pp. 143-152. (Pubitemid 351175504)
23. n, Compositio Math., 61 (1987), pp. 159-169.
24. n, 0 < p < 1, Math. Nachr., 227 (2001), pp. 133-142.
25. N, Proc. Amer. Math. Soc., 108 (1990), pp. 363-369.
26. N, Oper. Theory Adv. Appl., 77 (1995), pp. 311-325.
27. A. Taylor, A geometric theorem and its application to biorthogonal systems, Bull. Amer. Math. Soc., 53 (1947), pp. 614-616.
28. P. Wojtaszczyk, Banach Spaces for Analysts, Cambridge Stud. Adv. Math. 25, Cambridge University Press, Cambridge, UK, 1991.