Spectrum-Revealing Cholesky Factorization for Kernel Methods
From MaRDI portal
Publication:6300342
DOI10.1109/ICDM.2016.0175arXiv1804.05158WikidataQ55950594 ScholiaQ55950594MaRDI QIDQ6300342FDOQ6300342
Authors: Jianwei Xiao, Ming Gu 
Publication date: 13 April 2018
Abstract: Kernel methods represent some of the most popular machine learning tools for data analysis. Since exact kernel methods can be prohibitively expensive for large problems, reliable low-rank matrix approximations and high-performance implementations have become indispensable for practical applications of kernel methods. In this work, we introduce spectrum-revealing Cholesky factorization, a reliable low-rank matrix factorization, for kernel matrix approximation. We also develop an efficient and effective randomized algorithm for computing this factorization. Our numerical experiments demonstrate that this algorithm is as effective as other Cholesky factorization based kernel methods on machine learning problems, but significantly faster.
This page was built for publication: Spectrum-Revealing Cholesky Factorization for Kernel Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300342)
