Efficient rounding for the noncommutative grothendieck inequality

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 71-80

  Naor, Assaf ^a   Regev, Oded ^a   Vidick, Thomas ^b  

^a NEW YORK UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Grothendieck inequality; Principal component analysis; Rounding algorithm; Semidefinite programming

Indexed keywords

GROTHENDIECK INEQUALITY; NONCOMMUTATIVE GENERALIZATIONS; OPTIMIZATION PROBLEMS; ORTHOGONAL PROCRUSTES PROBLEM; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; PRINCIPLE COMPONENT ANALYSIS; ROUNDING ALGORITHM; SEMI-DEFINITE PROGRAMMING;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL PROGRAMMING;

PRINCIPAL COMPONENT ANALYSIS;

EID: 84879833771     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488618     Document Type: Conference Paper

References (41)

1. N. Alon, K. Makarychev, Y. Makarychev, and A. Naor. Quadratic forms on graphs. Invent. Math., 163(3):499-522, 2006.
2. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. In Proc. of the 36th STOC, pages 72-80, New York, 2004. ACM.
3. P. Bourgeois. Extension de la méthode Procuste à la comparaison de nuages de points situés dans des espaces de dimensions différentes. RAIRO Rech. Opér., 16(1):45-63, 1982.
4. M. Braverman, K. Makarychev, Y. Makarychev, and A. Naor. The Grothendieck constant is strictly smaller than Krivine's bound. In Proc. 52nd FOCS, pages 453-462, 2011.
5. E. R. Caianiello and R. M. Capocelli. On form and language: the Procrustes algorithm for feature extraction. Kybernetik (Berlin), 8(6):223-233, 1971.
6. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. In Proc. 19th IEEE Conf. on Computational Complexity (CCC'04), pages 236-249, 2004.
7. L. Devroye. Nonuniform random variate generation. Springer-Verlag, New York, 1986.
8. C. Ding, D. Zhou, X. He, and H. Zha. R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization. In Proceedings of the 23rd ICML, pages 281-288, 2006.
9. I. L. Dryden and K. V. Mardia. Statistical shape analysis. Wiley, 1998.
10. A. Frieze and R. Kannan. Quick approximation to matrices and applications. Combinatorica, 19:175-220, 1999.
11. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115-1145, Nov. 1995.
12. J. Gower. Generalized Procrustes analysis. Psychometrika, 40:33-51, 1975.
13. J. Gower and G. Dijksterhuis. Procrustes problems, volume 30 of Oxford Statistical Science Series. Oxford University Press, 2004.
14. A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques. Bol. Soc. Mat. São Paulo, 8:1-79, 1953.
15. M. Götschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin, second edition, 1993.
16. U. Haagerup. The Grothendieck inequality for bilinear forms on C*-algebras. Adv. in Math., 56(2):93 - 116, 1985.
17. U. Haagerup. A new upper bound for the complex Grothendieck constant. Israel J. Math., 60:199-224, 1987.
18. U. Haagerup and T. Itoh. Grothendieck type norms for bilinear forms on C*-algebras. J. Operator Theory, 34(2):263-283, 1995.
19. U. Haagerup and M. Musat. The Effros-Ruan conjecture for bilinear forms on C*-algebras. Invent. Math., 174:139-163, 2008.
20. N. L. Johnson, S. Kotz, and N. Balakrishnan. Continuous Univariate Distributions, volume 2. Wiley, 1995.
21. S. Kaijser. A simple-minded proof of the Pisier-Grothendieck inequality. In R. Blei and S. Sidney, editors, Banach Spaces, Harmonic Analysis, and Probability Theory, volume 995 of Lecture Notes in Mathematics, pages 33-55. Springer, 1983.
22. S. Khot and A. Naor. Grothendieck-type inequalities in combinatorial optimization. Commun. Pure Appl. Math., 65(7):992-1035, 2012.
23. J. L. Krivine. Constantes de Grothendieck et fonctions de type positif sur les sphéres. Adv. in Math., 31:16-30, 1979.
24. N. Kwak. Principal component analysis based on L1-norm maximization. IEEE Trans. Pattern Anal. Mach. Intell., 30(9):1672-1680, Sept. 2008.
25. J. Lindenstrauss and A. Pe lczyński. Absolutely summing operators in Lp-spaces and their applications. Studia Math., 29:275-326, 1968.
26. L. Lovász and B. Szegedy. Szemerédi's lemma for the analyst. Geom. Funct. Anal., 17(1):252-270, 2007.
27. M. McCoy and J. A. Tropp. Two proposals for robust PCA using semidefinite programming. Electron. J. Statist., 5:1123-1160, 1012.
28. E. Morand and J. Pagés. Analyse factorielle multiple procustéenne. J. Soc. Fr. Stat. & Rev. Stat. Appl., 148(2):65-97, 2007.
29. A. Naor, O. Regev, and T. Vidick. Efficient rounding for the noncommutative Grothendieck inequality, 2012. Full version of this extended abstract, available at arXiv:1210.7656.
30. A. Nemirovski. Sums of random symmetric matrices and quadratic optimization under orthogonality constraints. Math. Program., 109(2):283-317, Jan. 2007.
31. G. Pisier. Grothendieck's theorem for noncommutative C*-algebras, with an appendix on Grothendieck's constants. J. Funct. Anal., 29(3):397-415, 1978.
32. G. Pisier. Grothendieck's theorem, past and present. Bull. Amer. Math. Soc., 49(2):237-323, 2012. also available at arXiv:1101.4195.
33. G. Pisier and D. Shlyakhtenko. Grothendieck's theorem for operator spaces. Invent. Math., 150:185-217, 2002.
34. J. A. Reeds. A new lower bound on the real Grothendieck constant. Unpublished manuscript, http://www.dtc.umn.edu/reedsj/bound2.dvi, 1991.
35. O. Regev and T. Vidick. Elementary proofs of Grothendieck theorems for completely bounded norms. Journal of Operator Theory, 2012. To appear.
36. O. Regev and T. Vidick. Quantum XOR games, 2012. Submitted. Available at arXiv:1207.4939.
37. A. Shapiro and J. D. Botha. Dual algorithms for orthogonal Procrustes rotations. SIAM J. Matrix Anal. Appl., 9(3):378-383, 1988.
38. A. So. Moment inequalities for sums of random matrices and their applications in optimization. Math. Program., 130:125-151, 2011.
39. M. B. Stegmann and D. D. Gomez. A brief introduction to statistical shape analysis. Informatics and Mathematical Modelling, DTU, page 15, 2002.
40. J. M. F. Ten Berge. Orthogonal Procrustes rotation for two or more matrices. Psychometrika, 42(2):267-276, 1977.
41. B. S. Tsirelson. Quantum analogues of the Bell inequalities. The case of two spatially separated domains. J. Soviet Math., 36:557-570, 1987.