Kernel conjugate gradient for fast kernel machines

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1017-1022

  Ratliff, Nathan D ^a   Bagnell, J Andrew ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUGATE GRADIENT ALGORITHMS; INNER PRODUCT; KERNEL LEARNING; KERNEL MACHINE; LOSS FUNCTIONS; NUMBER OF ITERATIONS; OPTIMIZATION PROBLEMS; REPRODUCING KERNEL HILBERT SPACES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONJUGATE GRADIENT METHOD;

ITERATIVE METHODS;

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

References (17)

1. Amari, S., & Nagaoka, H. (2000). Methods of information geometry. Oxford University Press.
2. Aronszajn, N. (1950). Theory of reproducing kernels. Transactions of the American Mathematical Society.
3. Ashby, S. F., Manteuffel, T. A., & Saylor, P. E. (1990). A taxonomy for conjugate gradient methods. SIAM Journal on Numerical Analysis (pp. 1542-1568).
4. Gibbs, M. N. (1997). Bayesian gaussian processes for regression and classification. Doctoral dissertation, University of Cambridge.
5. Gonzalez, J. P. (2005). Carnegie Mellon University, PhD. candidate.
6. Gray, A., & Moore, A. (2001). N-body problems in statistical learning. Advances in Neural Information Processing Systems. MIT Press.
7. Hassani, S. (1998). Mathematical physics. Springer.
8. Kimeldorf, G. S., & Wahba, G. (1971). Some results on Tchebycheffian spline functions. J. Math. Anal. Applic. (pp. 82-95).
9. Luenberger, D. G. (2003). Linear and nonlinear programming, second edition. Springer.
10. Mason, L., J.Baxter, Bartlett, P., & Frean, M. (1999). Functional gradient techniques for combining hypotheses. MIT Press.
11. Moore, A. (1990). Efficient memory-based learning for robot control. Doctoral dissertation, University of Cambridge.
12. Rifkin, Yeo, & Poggio (2003). Regularized least squares classification. Advances in Learning Theory: Methods, Models and Applications. IOS Press.
13. Schölkopf, B., Herbrich, R., & Smola, A. J. (2001). A generalized representer theorem. Lecture Notes in Computer Science (pp. 416-426). Springer-Verlag. (Pubitemid 33312837)
14. Schölkopf, B., & Smola, A. J. (2002). Learning with kernels: Support vector machines, regularization, optimization, and beyond. MIT Press.
15. Shen, Y., Ng, A., & Seeger, M. (2006). Fast gaussian process regression using kd-trees. In Y. Weiss, B. Schölkopf and J. Platt (Eds.), Advances in neural information processing systems 18, 1227-1234. Cambridge, MA: MIT Press.
16. Smola, A. J., & Schölkopf, B. (2000). Sparse greedy matrix approximation for machine learning. International Conference on Machine Learning.
17. Zhu, J., & Hastie, T. (2001). Kernel logistic regression and the import vector machine. Advances in Neural Information Processing Systems.