Iterative row sampling

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 127-136

  Li, Mu ^a   Miller, Gary L ^a   Peng, Richard ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Regression; Sampling; Well conditioned basis

Indexed keywords

GRAPH SPARSIFICATION; ITERATIVE FASHION; MATRIX ALGORITHMS; REGRESSION; REGRESSION PROBLEM; STATE OF THE ART; THEORETICAL GUARANTEES; WELL-CONDITIONED BASIS;

COMPUTER SCIENCE; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; REGRESSION ANALYSIS; SAMPLING;

APPROXIMATION ALGORITHMS;

EID: 84893504141     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.22     Document Type: Conference Paper

References (42)

1. A. Dasgupta, P. Drineas, B. Harb, R. Kumar, and M. W. Mahoney, "Sampling algorithms and coresets for lp regression, " SIAM J. Comput., vol. 38, no. 5, pp. 2060-2078, 2009.
2. M. Magdon-Ismail, "Row sampling for matrix algorithms via a non-commutative Bernstein bound, " CoRR, vol. abs/1008.0587, 2010.
3. C. Sohler and D. P. Woodruff, "Subspace embeddings for the l1-norm with applications, " in Proceedings of the 43rd annual ACM symposium on Theory of computing, ser. STOC '11. New York, NY, USA: ACM, 2011, pp. 755-764.
4. P. Drineas, M. Magdon-Ismail, M. W. Mahoney, and D. P. Woodruff, "Fast approximation of matrix coherence and statistical leverage, " ICML, 2012.
5. K. L. Clarkson, P. Drineas, M. Magdon-Ismail, M. W. Mahoney, X. Meng, and D. P. Woodruff, "The fast cauchy transform and faster robust linear regression, " in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA '13. SIAM, 2013, pp. 466-477.
6. K. L. Clarkson and D. P. Woodruff, "Low rank approximation and regression in input sparsity time, " CoRR, vol. abs/0911.0547, 2012.
7. M. W. Mahoney and X. Meng, "Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression, " CoRR, vol. abs/1210.3135, 2012.
8. J. Nelson and H. L. Nguyen, "Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings, " CoRR, vol. abs/1211.1002, 2012.
9. G. Strang, Introduction to Linear Algebra. Wellesley- Cambridge Press, 1993.
10. Candes, E, "Compressive sampling, " Proceedings of the International Congress of Mathematicians, 2006. [Online]. Available: http://wwwstat.stanford.edu/̃candes/papers/CompressiveSampling.pdf.
11. P. M. Vaidya, "Speeding-up linear programming using fast matrix multiplication, " in Proceedings of the 30th Annual Symposium on Foundations of Computer Science. Washington, DC, USA: IEEE Computer Society, 1989, pp. 332-337.
12. V. V. Williams, "Multiplying matrices faster than coppersmith-winograd, " in Proceedings of the 44th symposium on Theory of Computing, ser. STOC '12. New York, NY, USA: ACM, 2012, pp. 887-898.
13. Y. Nesterov, "Gradient methods for minimizing composite objective function, " Universit catholique de Louvain, Center for Operations Research and Econometrics (CORE), CORE Discussion Papers 2007076, 2007.
14. K. L. Clarkson, E. Hazan, and D. P. Woodruff, "Sublinear optimization for machine learning, " J. ACM, vol. 59, no. 5, p. 23, 2012.
15. F. Song, H. Ltaief, B. Hadri, and J. Dongarra, "Scalable tile communication-avoiding QR factorization on multicore cluster systems, " in Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, ser. SC '10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 1-11.
16. E. Agullo, C. Coti, J. Dongarra, T. Herault, and J. Langou, "QR Factorization of Tall and Skinny Matrices in a Grid Computing Environment, " in 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, ́ Etats-Unis, 2010.
17. P. G. Constantine and D. F. Gleich, "Tall and skinny QR factorizations in mapreduce architectures, " in Proceedings of the second international workshop on MapReduce and its applications, ser. MapReduce '11. New York, NY, USA: ACM, 2011, pp. 43-50.
18. P. Drineas, R. Kannan, and M. W. Mahoney, "Fast monte carlo algorithms for matrices i: Approximating matrix multiplication, " SIAM J. Comput., vol. 36, no. 1, pp. 132-157, Jul. 2006.
19. P. Drineas, R. Kannan, and M. W. Mahoney, "Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix, " SIAM J. Comput., vol. 36, no. 1, pp. 158-183, Jul. 2006.
20. P. Drineas, R. Kannan, and M. W. Mahoney, "Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition, " SIAM J. Comput., vol. 36, no. 1, pp. 184-206, Jul. 2006.
21. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, "Sampling algorithms for l2 regression and applications, " in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, ser. SODA '06. New York, NY, USA: ACM, 2006, pp. 1127-1136.
22. H. Avron, P. Maymounkov, and S. Toledo, "Blendenpik: Supercharging lapack's least-squares solver, " SIAM J. Scientific Computing, pp. 1217-1236, 2010.
23. I. Koutis, A. Levin, and R. Peng, "Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices, " in 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), ser. Leibniz International Proceedings in Informatics (LIPIcs), C. D̈urr and T. Wilke, Eds., vol. 14. Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2012, pp. 266-277.
24. M. Li, G. L. Miller, and R. Peng, "Iterative row sampling, " CoRR, vol. abs/1211.2713, 2012.
25. J. D. Batson, D. A. Spielman, and N. Srivastava, "Twice- Ramanujan sparsifiers, " in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 255- 262.
26. C. Boutsidis, P. Drineas, and M. Magdon-Ismail, "Near optimal column-based matrix reconstruction, " in Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, 2011, pp. 305-314.
27. R. Ahlswede and A. Winter, "Strong converse for identification via quantum channels, " IEEE Transactions on Information Theory, vol. 48, no. 3, pp. 569-579, 2002.
28. M. Rudelson and R. Vershynin, "Sampling from large matrices: An approach through geometric functional analysis, " J. ACM, vol. 54, no. 4, p. 21, 2007.
29. R. Vershynin, "A note on sums of independent random matrices after ahlswede-winter, " 2009.
30. N. Harvey, "C&O 750: Randomized algorithms, winter 2011, lecture 11 notes, " 2011.
31. M. Badoiu, S. Har-Peled, and P. Indyk, "Approximate clustering via core-sets, " in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, ser. STOC '02. New York, NY, USA: ACM, 2002, pp. 250-257.
32. P. K. Agarwal, S. Har-peled, and K. R. Varadarajan, "Geometric approximation via coresets, " in Combinatorial and Computational Geometry, MSRI. University Press, 2005, pp. 1-30.
33. I. C. F. Ipsen and T. Wentworth, "The Effect of Coherence on Sampling from Matrices with Orthonormal Columns, and Preconditioned Least Squares Problems, " CoRR, vol. abs/1203.4809, 2012.
34. J. A. Tropp, "User-friendly tail bounds for sums of random matrices, " Found. Comput. Math., vol. 12, no. 4, pp. 389-434, Aug. 2012.
35. K. L. Clarkson, "Subgradient and sampling algorithms for l1 regression, " in Proceedings of the sixteenth annual ACMSIAM symposium on Discrete algorithms, ser. SODA '05. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2005, pp. 257-266.
36. H. Avron and S. Toledo, "Effective stiffness: Generalizing effective resistance sampling to finite element matrices, " CoRR, vol. abs/cs/1110.4437, 2011.
37. P. Drineas and M. W. Mahoney, "Effective resistances, statistical leverage, and applications to linear equation solving, " 2010.
38. P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarĺos, "Faster least squares approximation, " Numer. Math., vol. 117, no. 2, pp. 219-249, Feb. 2011.
39. D. A. Spielman and J. Woo, "A note on preconditioning by low-stretch spanning trees, " CoRR, vol. abs/0903.2816, 2009.
40. D. A. Spielman and N. Srivastava, "Graph sparsification by effective resistances, " in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), 2008, pp. 563- 568.
41. S. Dasgupta and A. Gupta, "An elementary proof of a theorem of johnson and lindenstrauss, " Random Structures & Algorithms, vol. 22, no. 1, pp. 60-65, 2003.
42. P. Indyk, "Stable distributions, pseudorandom generators, embeddings, and data stream computation, " J. ACM, vol. 53, no. 3, pp. 307-323, May 2006.