Spectral methods for matrices and tensors

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 1-12

  Kannan, Ravindran ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

algorithms; matrix; randomized; tensors

Indexed keywords

CONSTRAINT OPTIMIZATION PROBLEMS; DISCRETE OPTIMIZATION PROBLEMS; LOW RANK APPROXIMATIONS; MATRIX; NUMERICAL PROBLEMS; ON THE FLIES; RANDOMIZED; SALIENT FEATURES; SINGULAR VALUES; SPECTRAL METHODS; SUBMATRIX; TENSOR APPROXIMATION;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; MATRIX ALGEBRA; NUMERICAL METHODS; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; SPECTROSCOPY; SURVEYS;

TENSORS;

EID: 77954708484     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806691     Document Type: Conference Paper

References (63)

1. N. Alon, W.F. DeLaVega, R. Kannan, and M. Karpinski, Random sub-problems of max-snp problems, 34th STOC (2002), 668-677.
2. G. Andersson and L. Engebretsen, Property testers for dense constraint satisfaction programs on finite domains, Random Structures Algorithms 21 (2002), 14Ucombining double acute accent32.
3. Y. Azar, A. Fiat, A. Karlin, and F. McSherry, Spectral analysis of data, Proc. of STOC, 2001, pp. 619-626.
4. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of np-hard problems, 27th STOC (1995), 284-293.
5. N. Alon, M. Krivelevich, and B. Sudakov, Finding a large hidden clique in a random graph, Random Structures and Algorithms 13 (1998), 457-466.
6. D. Achlioptas and F. McSherry, On spectral learning of mixtures of distributions, Proc. of COLT, 2005.
7. D. Achlioptas and F. McSherry, -, Fast computation of low-rank matrix approximations, J. ACM 54 (2007), no. 2.
8. N. Alon and A. Naor, Approximating the cut-norm via grothendieck's inequality, SIAM J. Comput. 35(4) (2006), 787-803.
9. N. Alon, R.A.Duke, H.Lefmann, V.Rödl, and R.Yuster, The algorithmic aspects of the regularity lemma, Journal of Algorithms 16.
10. C. Borgs, J. Chayes, L. Lovász, V. Sós, B. Szegedy, and K. Vesztergombi, Graph limits and parameter testing, STOC, 2006.
11. S. Brin and L. Page, The anatomy of a large-scale hypertextual web search engine, Proc. 7th international conference on World Wide Web (WWW), 1998, p. 107Ucombining double acute accent117.
12. S. C. Brubaker, Robust pca and clustering on noisy mixtures, Proc. of SODA, 2009.
13. C. Brubaker and S. Vempala, Random Tensors and Planted Cliques, Proc. of APPROX-RANDOM, 2009. 406-415.
14. S. C. Brubaker and S. Vempala, Isotropic pca and affine-invariant clustering, Building Bridges Between Mathematics and Computer Science (M. Grötschel and G. Katona, eds.), Bolyai Society Mathematical Studies, vol. 19, 2008.
15. N. Bansal and R. Williams, Regularity lemmas and combinatorial algorithms, Proc. IEEE 50 th FOCS, 2009, pp. 745-755.
16. Z. Bar-Yossef, Sampling lower bounds via information theory, Proc. of STOC, 2003, pp. 335-344.
17. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, Clustering large graphs via the singular value decomposition, Machine Learning 56 (2004), 9-33.
18. S.T. Dumais, G.W. Furnas, T.K. Landauer, and S. Deerwester, Using latent semantic analysis to improve information retrieval, Proc. of CHI, 1988, pp. 281-285.
19. A. Dasgupta, J. Hopcroft, R. Kannan, and P. Mitra, Spectral clustering with limited independence, Proc. of SODA, 2007, pp. 1036-1045.
20. A. Dasgupta, J. Hopcroft, J. Kleinberg, and M. Sandler, On learning mixtures of heavy-tailed distributions, FOCS, 2005.
21. P. Drineas and R. Kannan, Fast monte-carlo algorithms for approximate matrix multiplication, FOCS, 2001, pp. 452-459.
22. P. Drineas and R. Kannan, -, Pass efficient algorithms for approximating large matrices, SODA '03, 2003, pp. 223-232.
23. P. Drineas, R. Kannan, and M. Mahoney, Fast monte carlo algorithms for matrices i: Approximating matrix multiplication, SIAM J. on Computing 36 (2006), 132-157.
24. P. Drineas, R. Kannan, and M. Mahoney, -, Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix, SIAM J. on Computing 36 (2006), 158-183.
25. P. Drineas, R. Kannan, and M. Mahoney, -, Fast monte carlo algorithms for matrices iii: Computing a compressed approximate matrix decomposition, SIAM J. on Computing 36 (2006), 184-206.
26. P. Drineas, I. Kerenidis, and P. Raghavan, Competitive Recommendation Systems, Proceedings of the 34th Annual ACM Symposium on Theory of Computing (2002), 82-90.
27. W. Fernandez de-la Vega, MAX-CUT has a Randomized Approximation Scheme in Dense Graphs, Random Structures and Algorithms 8 (1996), 187-199.
28. W. Fernandez de la Vega and C. Kenyon, A randomized approximation scheme for metric max-cut, J. Computer and System Sciences 63 (2001), 531-541.
29. W. Fernandez de la Vega, M. Karpinski, R. Kannan, and S. Vempala, Tensor decomposition and approximation schemes for constraint satisfaction problems, STOC '05, 2005, pp. 747-754.
30. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, Subspace sampling and relative error matrix approximation: column-based methods, Proc. of APPROX-RANDOM, 2006, pp. 316-326.
31. A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, Matrix approximation and projective clustering via volume sampling, Theory of Computing 2 (2006), no. 1, 225-247.
32. A. Deshpande and S. Vempala, Adaptive sampling and fast low-rank matrix approximation, APPROX-RANDOM, 2006, pp. 292-303.
33. M. Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory, Czech. Math. J. 25 (1975), 619-637.
34. Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981), no. 3, 233-241.
35. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), no. 2, 175-200.
36. A. Frieze and R. Kannan, -, A new approach to the planted clique problem, Proc. of FST & TCS, 2008.
37. A simple algorithm for constructing szemerédi's regularity partition, Electronic journal of combinatorics 6 (1999).
38. A. Frieze, R. Kannan, and S. Vempala, Fast monte-carlo algorithms for finding low-rank approximations, Proc. of FOCS, 1998, pp. 370-378.
39. A. Frieze, R. Kannan, and S. Vempala, Fast monte-carlo algorithms for finding low-rank approximations, J. ACM 51 (2004), no. 6, 1025-1041.
40. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM 5 (1998), no. 4, 653-750.
41. B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Annals of Mathematics 167 (2008), 481Ucombining double acute accent547.
42. J. Hastad, Tensor rank is np-complete, J. Algorithms 11 (1990), 644-654.
43. C. Hillar and Lek heng Lim, Most tensor problems are np hard, The Computing Research Repository (2009).
44. Har-Peled, Low-rank matrix approximation in linear-time, http://valis.cs.uiuc.edu/ sariel/papers/05/lrank/, 2005.
45. J. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the ACM 46 (1999).
46. I. Koutis and G. L. Miller, Graph partitioning into isolated, high conductance clusters: Theory, computation and applications to preconditioning, Proc. of SPAA, 2008.
47. J. B. Kruskal, Rank, decomposition, and uniqueness for 3-way and n-way arrays, Multiway Data Analysis, R. Coppi and S. Bolasco, eds. NorthUcombining double acute accentHolland, Amsterdam, 1989, p. 7Ucombining double acute accent18.
48. R. Kannan, H. Salmasian, and S. Vempala, The spectral method for general mixture models, SIAM Journal on Computing 38 (2008), no. 3, 1141-1156.
49. R. Kannan and S. Vempala, Spectral algorithms, Foundations and Trends in Theoretical Computer science 4:3-4 (2008).
50. R. Kannan, S. Vempala, and A. Vetta, On clusterings: Good, bad and spectral, J. ACM 51 (2004), no. 3, 497-515.
51. F. McSherry, Spectral partitioning of random graphs, FOCS, 2001, pp. 529-537.
52. M. W. Mahoney and P. Drineas, Cur matrix decompositions for improved data analysis, Proceedings of the National Academy of Sciences, vol. 106(3), 2009, pp. 697-702.
53. M. W. Mahoney, M. Maggioni, and P. Drineas, Tensor-cur decompositions for tensor-based data, SIAM Journal on Matrix Analysis and Applications 30(2).
54. P. Paschou, M. W. Mahoney, A. Javed, J. Kidd, A. Pakstis, S. Gu, K. Kidd, and P. Drineas, Intra- and inter-population genotype reconstruction from tagging snps, Genome Research 17(1) (2007), 96-107.
55. M. Rudelson and R. Vershynin, Sampling from large matrices: An approach through geometric functional analysis, Journal of the ACM 54 (2007), no. 4.
56. T. Sarlós, Improved approximation algorithms for large matrices via random projections, FOCS, 2006, pp. 143-152.
57. J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence 22 (2000), no. 8, 888-905.
58. D. A. Spielman and S. Teng, Spectral partitioning works: Planar graphs and finite element meshes, Linear Algebra and its Applications 421 (2007), no. 2-3, 284-305.
59. T. Strohmer and R. Vershynin, A randomized kaczmarz algorithm with exponential convergence, Journal of Fourier Analysis and Applications 15 (2009), 262-278.
60. J. Sun, Y. Xie, H. Zhang, and Christos Faloutsos, Less is more: Compact matrix decomposition for large sparse graphs, SIAM Conference on Date Mining, 2007, pp. 26-28.
61. L. Trevisan, M. Tulsiani, and Salil Vadhan, Regularity boosting and efficiently simulating every high-entropy distribution, Proc. of 24th IEEE Conference on Computational Complexity, 2009.
62. V. H. Vu, Spectral norm of random matrices, Proc. of STOC, 2005, pp. 423-430.
63. S. Vempala and G. Wang, A spectral algorithm for learning mixtures of distributions, Journal of Computer and System Sciences 68 (2004), no. 4, 841-860.