Efficient global optimization for exponential family PCA and low-rank matrix factorization

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 1100-1107

  Guo, Yuhong ^a   Schuurmans, Dale ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OBJECTIVES; EFFICIENT GLOBAL OPTIMIZATIONS; EIGENVECTOR COMPUTATIONS; EXPONENTIAL FAMILIES; GENERAL PURPOSE; GLOBAL SOLUTIONS; GLOBAL SOLVERS; LOCAL OPTIMIZATIONS; LOW-RANK MATRICES; NON CONVEXITIES; NON LINEARITIES; NON-GAUSSIAN DATUM; OPTIMIZATION PROBLEMS; OPTIMIZATION PROCEDURES; PRINCIPAL COMPONENTS; SEMI-DEFINITE PROGRAMMING; SOLUTION QUALITIES; SUB-GRADIENT OPTIMIZATIONS;

CONVEX OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; FACTORIZATION; GAUSSIAN NOISE (ELECTRONIC); LIGHT MEASUREMENT; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; TRELLIS CODES;

GLOBAL OPTIMIZATION;

EID: 64549154855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797683     Document Type: Conference Paper

References (29)

1. M. Collins, S. Dasgupta, and R. Schapire, "A generalization of principal component analysis to the exponential family," in Proceedings of Advances in Neural Information Processing Systems (NIPS), 2001.
2. Sajama and A. Orlitsky, "Semi-parametric exponential family pca," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 17, 2004.
3. -, "Semi-parametric exponential family PCA: Reducing dimensions via non-parametric latent distribution estimation," UCSD, Tech. Rep. CS2004-0790, 2004.
4. A. Kaban and M. Girolami, "A combined latent class and trait model fo the analysis and visualization of discrete data," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 859-872, 2001.
5. 2 models," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 15, 2002.
6. N. Roy and G. Gordon, "Exponential family PCA for belief compression in POMDPs," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 15, 2002.
7. N. Roy, G. Gordon, and S. Thrun, "Finding approximate POMDP solutions through belief compression," Journal of Artificial Intelligence Research, vol. 23, pp. 1-40, 2005.
8. N. Srebro, J. Rennie, and T. Jaakkola, "Maximum-margin matrix factorization," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 17, 2004.
9. N. Srebro and T. Jaakkola, "Linear dependent dimensionality reduction," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 16, 2003.
10. -, "Weighted low-rank approximations," in Proceedings of International Conference on Machine Learning (ICML), 2003.
11. A. Hyvarinen and E. Oja, "Independent component analysis: Algorithms and applications," Neural Networks, vol. 13, no. 4-5, pp. 411-430, 2000.
12. G. Blanchard, M. Sugiyama, M. Kawanabe, V. Spokoiny, and K.-R. Mueller, "Non-gaussian component analysis: a semi-parametric framework for linear dimension reduction," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 18, 2005.
13. B. Schoelkopf, A. Smola, and K.-R. Mueller, "Kernel principal component analysis," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 12, 1999.
14. B. Schoelkopf and A. Smola, Learning with Kernels. MIT Press, 2001.
15. S. Roweis and L. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science, vol. 290, no. 5500, pp. 2323-2326, 2000.
16. J. Tenenbaum, V. de Silva, and J. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, no. 5500, pp. 2319-2323, 2000.
17. K. Weinberger, F. Sha, and L. Saul, "Learning a kernel matrix for nonlinear dimensionality reduction," in Proceedings of the International Conference on Machine Learning (ICML), 2004.
18. H. Hotelling, "Analysis of complex statistical variables into components," Journal of Educational Psychology, vol. 24, pp. 417-441, 1933.
19. M. Overton and R. Womersley, "Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices," Mathematical Programming, vol. 62, pp. 321-357, 1993.
20. S. Roweis, "EM algorithms for PCA and SPCA," in Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 10, 1997.
21. M. Tipping and C. Bishop, "Probabilistic principal component analysis," Journal of the Royal Statistical Society, B, vol. 6, no. 3, pp. 611-622, 1999.
22. N. Lawrence, "Probabilistic non-linear principle component analysis with gaussian process latent variable models," Journal of Machine Learning Research, vol. 6, pp. 1783-1816, 2005.
23. M. Wainwright and M. Jordan, "Graphical models, exponential families, and variational inference," UC Berkeley, Dept. Statistics, Tech. Rep. TR-649, 2003.
24. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge U. Press, 2004.
25. R. Rockafellar, Convex Analysis. Princeton Univ. Press, 1970.
26. J. Borwein and A. Lewis, Convex Analysis and Nonlinear Optimization. Springer, 2000.
27. J. Peng and Y. Wei, "Approximating k-means-type clustering via semidefinite programming," SIAM Journal on Optimization, vol. 18, no. 1, pp. 186-205, 2007.
28. A. Belloni, "Introduction to bundle methods," MIT, Tech. Rep., 2005.
29. R. Freund, "Subgradient optimization, generalized. programming, and nonconvex duality," MIT, Tech. Rep., 2004.