Sampling algorithms for ℓ 2 regression and applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1127-1136

  Drineas, Petros ^a   Mahoney, Michael W ^b   Muthukrishnan, S ^c  

^a Rensselaer Polytechnic Institute   (United States)

^b YAHOO RESEARCH   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR-ALGEBRAIC PROBLEM; MOORE-PENROSE GENERALIZED INVERSE; RELATIVE ERROR; SAMPLING ALGORITHM;

INVERSE PROBLEMS; MATRIX ALGEBRA; PROBABILITY; PROBLEM SOLVING; REGRESSION ANALYSIS; VECTORS;

ALGORITHMS;

EID: 33244493810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109682     Document Type: Conference Paper

References (21)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 611-618, 2001.
2. R. Bhatia. Matrix Analysis. Springer-Verlag, New York, 1997.
3. K. Clarkson. Subgradient and sampling algorithms for L1 regression. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.
4. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. Technical Report YALEU/DCS/TR-1269, Yale University Department of Computer Science, New Haven, CT, February 2004.
5. Accepted for publication in the SIAM Journal on Computing.
6. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. Technical Report YALEU/DCS/TR-1270, Yale University Department of Computer Science, New Haven, CT, February 2004.
7. Accepted for publication in the SIAM Journal on Computing.
8. P. Drineas, R. Kannan, and M.W. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. Technical Report YALEU/DCS/TR-1271, Yale University Department of Computer Science, New Haven, CT, February 2004.
9. Accepted for publication in the SIAM Journal on Computing.
10. P. Drineas and M.W. Mahoney. A randomized algorithm for a tensor-based generalization of the Singular Value Decomposition. Technical Report YALEU/DCS/TR-1327, Yale University Department of Computer Science, New Haven, CT, June 2005.
11. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 370-378, 1998.
12. A. Frieze, R. Kannan, and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. Journal of the ACM, 51(6):1025-1041, 2004.
13. G.H. Golub and C.F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 1989.
14. R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, New York, 1985.
15. S. S. Keerthi and D. DeCoste. A modified finite Newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research, 6:341-361, 2005.
16. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, New York, 1996.
17. M.Z. Nashed, editor. Generalized Inverses and Applications. Academic Press, New York, 1976.
18. L. Rademacher, S. Vempala, and G. Wang. Matrix approximation and projective clustering via iterative sampling. Technical Report MIT-LCS-TR-983, Massachusetts Institute of Technology, Cambridge, MA, March 2005.
19. M. Rudelson and R. Vershynin. Approximation of matrices. manuscript.
20. G.W. Stewart and J.G. Sun. Matrix Perturbation Theory. Academic Press, New York, 1990.
21. n. manuscript.