Rank minimization via online learning

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 656-663

  Meka, Raghu ^a   Jain, Prateek ^a   Caramanis, Constantine ^a   Dhillon, Inderjit S ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; DECISION MAKING; LEARNING ALGORITHMS; MACHINE LEARNING; APPLICATIONS; E-LEARNING; EDUCATION; INTERNET; LEARNING SYSTEMS; OPTIMIZATION; ROBOT LEARNING;

MACHINE LEARNING APPLICATIONS; MINIMUM RANK PROBLEMS; MULTIPLICATIVE UPDATES; NOVEL APPLICATIONS; ONLINE LEARNING ALGORITHMS; PROGRAMMING FRAMEWORK; RANK MINIMIZATIONS; REAL-LIFE APPLICATIONS; CONVEX PROGRAMMING; DECISION MAKERS; KERNEL LEARNING; MINIMIZATION PROBLEMS; MINIMUM RANKS; ON-LINE LEARNING; POLYHEDRAL SETS; SALIENT FEATURES;

E-LEARNING; LEARNING ALGORITHMS;

EID: 56449126249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390239     Document Type: Conference Paper

References (21)

1. Amaldi, E., & Kann, V. (1998). On the approximability of minimizing non-zero variables or unsatisfied relations in linear systems. Theoretical Computer Science, 209, 237-260.
2. Arora, S., Hazan, E., & Kale, S. (2005a). Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. FOCS (pp. 339-348).
3. Arora, S., Hazan, E., & Kale, S. (2005b). Multiplicative weights method: a meta-algorithm and its applications. Survey, http://www.cs. princeton.edu/arora/pubs/MWsurvey.pdf.
4. Bach, F. R., & Jordan, M. I. (2005). Predictive low-rank decomposition for kernel methods. ICML (pp. 33-40).
5. Barvinok, A. (2002). A course in convexity. American Mathematical Society.
6. Candès, E. J., & Tao, T. (2005). Decoding by linear programming. IEEE Transactions on Information Theory, 51, 4203-4215.
7. Fazel, M., Hindi, H., & Boyd, S. (2001). A rank minimization heuristic with application to minimum order system approximation. American Control Conference, Arlington, Virginia.
8. Fazel, M., Hindi, H., & Boyd, S. (2003). Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. American Control Conference, Denver, Colorado.
9. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55, 119-139.
10. Hazan, E., Kalai, A., Kale, S., & Agarwal, A. (2006). Logarithmic regret algorithms for online convex optimization. COLT (pp. 499-513).
11. Kalai, A. T., & Vempala, S. (2005). Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71, 291-307.
12. Kim, D., Sra, S., & Dhillon, I. S. (2007). Fast Newton-type methods for the least squares nonnegative matrix approximation problem. SDM (pp. 343-354).
13. Kulis, B., Sustik, M., & Dhillon, I. S. (2006). Learning low-rank kernel matrices. ICML (pp. 505-512).
14. Lee, D. D., & Seung, H. S. (2000). Algorithms for non-negative matrix factorization. NIPS (pp. 556-562).
15. Littlestone, N., & Warmuth, M. K. (1989). The weighted majority algorithm. FOCS (pp. 256-261).
16. Meka, R., Jain, P., Caramanis, C., & Dhillon, I. S. (2008). Rank minimization via online learning (Technical Report TR-08-23). The Univ. of Texas at Austin, Dept. of Comp. Sci.
17. Plotkin, S. A., Shmoys, D. B., & Tardos, E. (1991). Fast approximation algorithms for fractional packing and covering problems. IEEE Symposium on Foundations of Computer Science (pp. 495-504).
18. Recht, B., Fazel, M., & Parrilo, P. (2007). Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. Preprint, http://www.optimization-online.org/DB_HTML/2007/06/1707.html.
19. Rockafellar, R. T. (1970). Convex analysis. Princeton University Press.
20. Weinberger, K. Q., Sha, F., & Saul, L. K. (2004). Learning a kernel matrix for nonlinear dimensionality reduction. ICML.
21. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. ICML (pp. 928-936).