Algorithms and hardness for subspace approximation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 482-511

  Deshpande, Amit ^a   Tulsiani, Madhur ^b   Vishnoi, Nisheeth K ^a  

^a MICROSOFT RESEARCH INDIA   (India)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS; POLYNOMIAL APPROXIMATION; RELAXATION PROCESSES;

CONVEX RELAXATION; DICTATORSHIP TESTS; INTEGRALITY GAPS; LEAST SQUARES FIT; LINEAR SUBSPACE; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SUBSPACE APPROXIMATION; UNIQUE GAMES CONJECTURE;

APPROXIMATION ALGORITHMS;

EID: 79955735616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.39     Document Type: Conference Paper

References (50)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequence moments. In ACM Symposium on Theory of Computing (STOC). pages 20-29, 1996.
2. N. Alon and A. Naor. Approximating the cut-norm via Grothendieck's inequality. SIAM Journal on Computing (SICOMP), 35(4):787-803, 2006. (Pubitemid 44231256)
3. S. Arora, E. Berger, E. Hazan, G. Kindler, and M. Safra. On non-approxiinability for quadratic programs. In IEEE Symposium on Foundations of Computer Science (FOCS), 2005.
4. Baruch Awerbuch, Yossi Azar, Edward Grove, Ming-Yang Kao, P. Krishnan, and Jeffrey Vitter. Load-balancing in the lp norm. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 383-391, 1995.
5. Nikhil Bansal and Kirk Pruhs. Server scheduling in the lp norm: a rising tide lifts all boat. In A CM Symposium on Theory of Computing (STOC), pages 242-250. 2003.
6. A. Bhaskara and A. Vijayaraghavan. Approximating matrix p-norms. 2010. manuscript, http://arxiv.org/abs/1001.
7. A. Brieden, P. Gritzniann, and V. Klee. Inapprox- imability of some geometric and quadratic optimization problems. In Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, 2000.
8. M. Bǎdoiu, S. Har-peled, and P. Indyk. Approximate clustering via coresets. In ACM Symposium on Theory of Computing (STOC), 2002.
9. K. Clarkson. Subgradient and sampling algorithms for 11 regression. In SODA'05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 257-266, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
10. A. Dasgupta, P. Drineas, B. Harb, R. Kumar, and M. Mahoney. Sampling algorithms and coresets for lp regression. In SODA'08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 932-941, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
11. A. Deshparide and K. Varadarajan. Sampling-based dimension reduction for subspace approximation. In ACM Symposium on Theory of Computing (STOC), 2007.
12. P. Drineas, M. Mahoney, and S. Muthukrishnan. Sampling algorithms for 12 regression and applications. In SODA'06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 1127-1136, New York, NY, USA, 2006. ACM.
13. Uriel Feige and Eran Ofek. Spectral techniques applied to sparse random graphs. Random Struct. Algorithms, 27(2):251-275, 2005. (Pubitemid 41482549)
14. D. Feldman, M. Monemizadeh, C. Sohler, and D. Woodruff. Coresets and sketches for high dimensional subspace approximation problems. In ACM- SIAM Symposium on Discrete Algorithms (SODA), 2010.
15. G. Golub and C. van Loan. Matrix Computations. Johns Hopkins University Press, 1996.
16. P. Gritzinann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Mathematical Programming, 59:163-213, 1993. (Pubitemid 23704554)
17. S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using coresets. In ACM Symposium on Computational Geometry (SOCG), 2002.
18. Ishay Haviv and Oded Regev. Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In ACM Symposium on Theory of Computing (STOC), pages 469-477, 2007. (Pubitemid 47630766)
19. S. Khot. On the power of unique 2-prover 1-round games. In IEEE Conference on Computational Complexity (CCC), 2002.
20. S. Khot and A Naor. Approximate kerkel clustering. In IEEE Symposium on Foundations of Computer Science (FOCS), 2008.
21. Subhash Khot. Hardness of approximating the shortest vector problem in high lp norms. Journal of Computing Systems and Sciences, 72(2):206-219.
22. G. Kindler, A. Naor, and G. Schechtman. The UGC hardness threshold of the lp Grothendieck problem. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008.
23. A. Nemirovski, C. Roos, and T. Terlaky. On maximization of quadratic forms over intersection of ellipsoids with common center. Mathematical Programming, Ser. A, 86:463-473, 1999.
24. Yu. Nesterov. Global quadratic optimization via conic relaxation, working paper, CORE, Catholic University of Louvain, Belgium, 1998.
25. G. Peskir and A. N. Shiryaev. The inequalities of khintchine and expanding sphere of their action. Russian Math. Surveys, 50(5):849-904, 1995. (Pubitemid 126065532)
26. I. G. Shevtsova. Sharpening of the upper bound of the absolute constant in the berry-esseen inequality. Theory of Probability and its Applications, 51(3):549-553, 2007.
27. N. Shyamalkumar and K. Varadarajan. Efficient subspace approximation algorithms. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.
28. A. M. So, Y. Ye, and J. Zhang. A unified theorem on SDP rank reduction. Mathematics of Operations Research, 33(4) :910-920, 2008.
29. K. Varadarajan, S. Venkatesh, Y. Ye, and J. Zhang. Approximating the radii of point sets. SIAM Journal on Computing (SICOMP), 36(6):1764-1776.
30. Noga Alon and Assaf Naor. Approximating the cut-norm via grothendieck's inequality. In STOC'04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 72-80, New York, NY, USA, 2004. ACM.
31. 1/4) approximation for densest k-subgraph. CoRR, abs/1001.2891, 2010.
32. David W. Boyd. The power method for p norms. Linear Algebra and its Applications, 9:95 - 101, 1974.
33. Moses Charikar and Anthony Wirth. Maximizing quadratic programs: Extending grothendieck's inequality. Foundations of Computer Science, Annual IEEE Symposium on, 0:54-60, 2004. (Pubitemid 40575266)
34. Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, and Nisheeth K. Vishnoi. Algorithms and hardness for subspace approximation. CoRR, abs/0912.1403, 2009.
35. Matthias Englert and Harald Räcke. Oblivious routing in the Lp-nonn. In Proc. of the 50th FOCS, 2009.
36. Anupam Gupta, Mohammad T. Hajiaghayi, and Harald Räcke. Oblivious network design. In SODA'06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 970-979, New York, NY, USA, 2006. ACM. (Pubitemid 43275323)
37. Martin Grötschel, László Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York, 1988.
38. Alexander Grothendieck. Resume de la theorie metrique des produits tensoriels topologiques. Bol. Soc. Mat. Sao Paulo, 8:1-79, 1953.
39. Johan Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
40. Nicholas J. Higham. Estimating the matrix p-norm. Numer. Math, 62:511-538, 1992.
41. Roger A. Horn and Charles R. Johnson. Matrix analysis/Roger A. Horn, Charles R. Johnson. Cambridge University Press, Cambridge [Cambridgeshire]; New York, 1985.
42. Subhash Khot. Hardness of approximating the shortest vector problem in lattices. Foundations of Computer Science, Annual IEEE Symposium on, 0:126-135, 2004. (Pubitemid 40575274)
43. J. Kahn, G. Kalai, and N. Linial. The influence of variables on boolean functions. In SFCS'88: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 68-80, Washington, DC, USA, 1988. IEEE Computer Society.
44. Guy Kindler, Assaf Naor, and Gideon Schechtman. The ugc hardness threshold of the lp grothendieck problem. In SODA'08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 64-73, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
45. 1. In FOCS'05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 53-62, Washington, DC, USA, 2005. IEEE Computer Society. (Pubitemid 44375719)
46. Yurii Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141-160, 1998. (Pubitemid 128542194)
47. Harald Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In STOC'08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 255-264, New York, NY, USA, 2008. ACM.
48. Oded Regev. Lattice-based cryptography. In In Proc. of the 26th Annual International Cryptology Conference (CRYPTO, pages 131-141, 2006. (Pubitemid 44532113)
49. Prasad Raghavendra and David Steurer. Graph expansion and the unique games conjecture. In STOC'10: Proceedings of the 42nd ACM symposium on Theory of computing, pages 755-764, New York, NY, USA, 2010. ACM.
50. Daureen Steinberg. Computation of matrix norms with applications to robust optimization. Research thesis, Technion - Israel University of Technology, 2005.