Graphics enhanced version of this site

Kernel Conjugate Gradient
N. Ratliff and J. Bagnell
tech. report CMU-RI-TR-05-30, Robotics Institute, Carnegie Mellon University, June, 2005.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Adobe portable document format (pdf) [102 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

We propose a novel variant of conjugate gradient based on the Reproducing Kernel Hilbert Space (RKHS) inner product. An analysis of the algorithm suggests it enjoys better performance properties than standard iterative methods when applied to learning kernel machines. Experimental results for both classification and regression bear out the theoretical implications. We further address the dominant cost of the algorithm by reducing the complexity of RKHS function evaluations and inner products through the use of space-partitioning tree data-structures.

Number of pages: 8

N. Ratliff and J. Bagnell, Kernel Conjugate Gradient, tech. report CMU-RI-TR-05-30, Robotics Institute, Carnegie Mellon University, June, 2005.

@techreport{Ratliff_2005_5051,
   author = "Nathan Ratliff and James (Drew) Bagnell",
   title = "Kernel Conjugate Gradient",
   institution = "Robotics Institute, Carnegie Mellon University",
   month = "June",
   year = "2005",
   number = "CMU-RI-TR-05-30",
   address = "Pittsburgh, PA"
}