Mirror descent for metric learning: A unified approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7523 LNAI, Issue PART 1, 2012, Pages 859-874

  Kunapuli, Gautam ^a   Shavlik, Jude ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENSPECTRUM; LARGE DATASETS; LEARNING PROBLEM; LOSS FUNCTIONS; MAHALANOBIS METRIC; METRIC LEARNING; POSITIVE SEMIDEFINITE MATRICES; PROJECTION METHOD; TRACE-NORMS; UNIFIED APPROACH;

LEARNING SYSTEMS; MIRRORS;

LEARNING ALGORITHMS;

EID: 84866867133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33460-3_60     Document Type: Conference Paper

References (32)

1. MacQueen, J.: On convergence of k-means and partitions with minimum average variance. Annals of Mathematical Statistics 36, 1084 (1965)
2. Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory IT-13(1) , 21-27 (1967)
3. Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman and Hall (2001)
4. Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: Proc. 18th ICML, pp. 577-584 (2001)
5. Xing, E.P., Ng, A.Y., Jordan, M.I., Russell, S.: Distance metric learning, with application to clustering with side-information. In: NIPS, vol. 15, pp. 505-512 (2002)
6. Weinberger, K.Q., Blitzer, J., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. In: NIPS, vol. 19 (2006)
7. Davis, J.V., Kulis, B., Jain, P., Sra, S., Dhillon, I.S.: Information-theoretic metric learning. In: Proc. 24th ICML, pp. 209-216 (2007)
8. Shen, C., Kim, J., Wang, L., van den Hengel, A.: Positive semidefinite metric learning with boosting. In: NIPS, vol. 22, pp. 629-633 (2009)
9. Shalev-Shwartz, S., Singer, Y., Ng, A.Y.: Online and batch learning of pseudometrics. In: Proc. 21st ICML, pp. 94-102 (2004)
10. Chopra, S., Hadsell, R., Lecun, Y.: Learning a similarity metric discriminatively, with application to face verification. In: Proceedings of Computer Vision and Pattern Recognition Conference, pp. 539-546. IEEE Press (2005)
11. Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B 58, 267-288 (1994)
12. Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471-501 (2010)
13. Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7, 200-217 (1967)
14. Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters 31, 167-175 (2003)
15. Duchi, J., Shalev-Shwartz, S., Singer, Y., Tewari, A.: Composite objective mirror descent. In: COLT, pp. 14-26 (2010)
16. Chatpatanasiri, R., Korsrilabutr, T., Tangchanachaianan, P., Kijsirikul, B.: On kernelization of supervised Mahalanobis distance learners. Computing Research Repoisitory (CoRR) abs/0804.1441 (2008)
17. Censor, Y.A., Zenios, S.A.: Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press (1997)
18. Kakade, S.M., Shalev-Shwartz, S., Tewari, A.: On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization (preprint)
19. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press (1990)
20. Cai, J.F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20, 1956-1982 (2010)
21. Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. Journal of Convex Analysis 2, 173-183 (1995)
22. Lewis, A.S.: The mathematics of eigenvalue optimization. Mathematical Programming 97, 155-176 (2003)
23. Golub, G.H., Van Loan, C.F.: Matrix Computations (Johns Hopkins Studies in Mathematical Sciences). 3rd edn. The Johns Hopkins University Press (1996)
24. Gu, M., Eisenstat, S.C.: A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM Journal on Matrix Analysis and Applications 15(4), 1266-1276 (1994)
25. Kulis, B., Sustik, M.A., Dhillon, I.S.: Low-rank kernel learning with bregman matrix divergences. J. Mach. Learn. Res. 10, 341-376 (2009)
26. Schultz, M., Joachims, T.: Learning a distance metric from relative comparisons. In: NIPS, vol. 16 (2004)
27. Guillaumin, M., Verbeek, J.J., Schmid, C.: Is that you? metric learning approaches for face identification. In: ICCV, pp. 498-505 (2009)
28. Hastie, T., Tibshirani, R.: Discriminant adaptive nearest neighbor classification. IEEE Trans. on Pattern Analysis and Machine Intelligence 18(6), 607-616 (1996)
29. Goldberger, J., Roweis, S.T., Hinton, G.E., Salakhutdinov, R.: Neighbourhood components analysis. In: NIPS, vol. 17 (2004)
30. Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning distance functions using equivalence relations. In: Proc. 20th ICML, pp. 11-18 (2003)
31. Jain, P., Kulis, B., Dhillon, I.S., Grauman, K.: Online metric learning and fast similarity search. In: NIPS, pp. 761-768 (2008)
32. Watson, G.A.: Characterization of the subdifferential of some matrix norms. Linear Algebra and its Applications 170, 33-45 (1992)