Near-optimal coresets for least-squares regression

IEEE Transactions on Information Theory

Volumn 59, Issue 10, 2013, Pages 6880-6892

  Boutsidis, Christos ^a   Drineas, Petros ^b   Magdon Ismail, Malik ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Rensselaer Polytechnic Institute   (United States)

Author keywords

Least mean square algorithms; machine learning algorithms; regression analysis

Indexed keywords

APPROXIMATE SOLUTION; CORE SET; LEAST MEAN SQUARE ALGORITHMS; LEAST SQUARES REGRESSION; LOWER BOUNDS; MULTIPLE RESPONSE; NEAR-OPTIMAL; POLYNOMIAL-TIME ALGORITHMS;

LEARNING ALGORITHMS; LEARNING SYSTEMS; POLYNOMIAL APPROXIMATION; REGRESSION ANALYSIS;

APPROXIMATION ALGORITHMS;

EID: 84884377176     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2272457     Document Type: Article

References (18)

1. A. Björck, Numerical Methods for Least Squares Problems. Philadelphia, PA, USA: SIAM, 1996.
2. J. D. Batson, D. A. Spielman, and N. Srivastava, "Twice-Ramanujan sparsifiers," in Proc. 41st Annu. ACM Symp. Theory Comput., 2009, pp. 255-262.
3. S. Bellavia, M. Macconi, and B. Morini, "An interior point Newtonlike method for non-negative least squares problems with degenerate solution," Numer. Linear Algebra Appl., vol. 13, pp. 825-844, 2006.
4. D. S. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas with Applications to Linear Systems Theory. Princeton, NJ, USA: Princeton Univ. Press, 2005.
5. C. Boutsidis, "Topics inMatrix Sampling Algorithms," Ph.D. dissertation, Rensselaer Polytechnic Institute, Troy, NY, USA, 2011 [Online]. Available: http://arxiv.org/abs/1105.0709.
6. C. Boutsidis and P. Drineas, "Random projections for the nonnegative least-squares problem," Linear Algebra Appl., vol. 431, no. 5-7, pp. 760-771, 2009.
7. C. Boutsidis, P. Drineas, and M. Magdon-Ismail, "Near-Optimal Column Based Matrix Reconstruction," in Proc. IEEE 52nd Annu. Symp. Found. Comput. Sci., 2011, pp. 305-314, to be published.
8. L. Breiman and J. Friedman, "Predictingmultivariate responses inmultiple linear regression," J. Roy. Stat. Soc., vol. 59, no. 1, pp. 3-54, 1997. (Pubitemid 127686939)
9. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge, U.K.: Cambridge Univ. Press, 2000.
10. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, "Relative-error CUR matrix decompositions," SIAM J. Matrix Anal. Appl., vol. 30, no. 2, pp. 844-881, 2008.
11. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, "Sampling algorithms for regression and applications," in Proc. 17th Annu. ACMSIAM Symp. Discrete Algorithm, 2006, pp. 1127-1136.
12. D. Y. Gao, "Solutions and optimality criteria to box constrained nonconvex minimization problems," Management, vol. 3, no. 2, pp. 293-304, 2007.
13. I. Guyon and A. Elisseeff, "An introduction to variable and feature selection," J. Mach. Learning Res., vol. 3, pp. 1157-1182, 2003.
14. J. D. Hamilton, Time Series Analysis. Princeton, NJ, USA: Princeton Univ. Press, 1994.
15. R. Kannan and S. Vempala, "Nimble algorithms for cloud computing," 2013 [Online]. Available: arXiv:1304.3162
16. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems. Englewood Cliffs, NJ, USA: Prentice-Hall, 1974.
17. M. Rudelson and R. Vershynin, "Sampling from large matrices: An approach through geometric functional analysis," J. ACM, vol. 54, 2007.
18. G. A. F. Seber and A. J. Lee, Linear Regression Analysis. NewYork, NY, USA: Wiley, 1977.