PSDBoost: Matrix-generation linear programming for positive semidefinite matrices learning

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 1473-1480

  Shen, Chunhua ^a,b   Welsh, Alan ^b   Wang, Lei ^b  

^a CSIRO   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; LEARNING SYSTEMS; LINEAR PROGRAMMING; MATRIX ALGEBRA;

BOOSTING ALGORITHM; CONVEX OPTIMISATION; CRITICAL ISSUES; LINEAR-PROGRAMMING; MACHINE-LEARNING; MATRIX; OPTIMIZATION FRAMEWORK; POSITIVE SEMIDEFINITE; POSITIVE SEMIDEFINITE MATRICES; POSITIVE SEMIDEFINITENESS;

CONVEX OPTIMIZATION;

EID: 84863362632     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Demiriz, K.P. Bennett, and J. Shawe-Taylor. Linear programming boosting via column generation. Mach. Learn., 46(1-3):225-254, 2002. (Pubitemid 34129970)
2. T. Zhang. Sequential greedy approximation for certain convex optimization problems. IEEE Trans. Inf. Theory, 49(3):682-691, 2003.
3. M. E. Lübbecke and J. Desrosiers. Selected topics in column generation. Operation Res., 53(6):1007-1023, 2005. (Pubitemid 43061815)
4. ILOG, Inc. CPLEX 11.1, 2008. http://www.ilog.com/products/cplex/.
5. G. B. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operation Res., 8(1):101-111, 1960.
6. E. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. In Proc. Adv. Neural Inf. Process. Syst. MIT Press, 2002.
7. K. Q. Weinberger, J. Blitzer, and L. K. Saul. Distance metric learning for large margin nearest neighbor classification. In Proc. Adv. Neural Inf. Process. Syst., pages 1473-1480, 2005.
8. R. Rosales and G. Fung. Learning sparse metrics via linear programming. In Proc. ACM Int. Conf. Knowledge Discovery & Data Mining, pages 367-373, Philadelphia, PA, USA, 2006. (Pubitemid 44535533)
9. M. Krein and D. Milman. On extreme points of regular convex sets. Studia Mathematica, 9:133-138, 1940.
10. M. L. Overton and R. S. Womersley. On the sum of the largest eigenvalues of a symmetric matrix. SIAM J. Matrix Anal. Appl., 13(1):41-45, 1992.
11. P. A. Fillmore and J. P. Williams. Some convexity theorems for matrices. Glasgow Math. Journal, 12:110-117, 1971.
12. R. E. Schapire. Theoretical views of boosting and applications. In Proc. Int. Conf. Algorithmic Learn. Theory, pages 13-25, London, UK, 1999. Springer-Verlag.
13. B. Kulis, M. Sustik, and I. Dhillon. Learning low-rank kernel matrices. In Proc. Int. Conf. Mach. Learn., pages 505-512, Pittsburgh, Pennsylvania, 2006.
14. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
15. B. Borchers. CSDP, a C library for semidefinite programming. Optim. Methods and Softw., 11(1):613-623, 1999.
16. D. Calvetti, L. Reichel, and D. C. Sorensen. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Elec. Trans. Numer. Anal, 2:1-21, Mar 1994. http://etna.mcs.kent.edu.
17. J. F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizábal. Numerical Optimization: Theoretical and Practical Aspects (1st edition). Springer-Verlag, Berlin, 2003.