Fetching the paper…
Reading the bibliography…
The randomly pivoted partial Cholesky algorithm (RPCholesky) computes a factorized rank-k approximation of an N x N positive-semidefinite (psd) matrix.
An identity for the Schur complement of a matrix
D. E. Crabtree and E. V. Haynsworth · 1969
Earlier work this paper cites.
Analysis of the Cholesky decomposition of a semi-definite matrix
N. J. Higham · 1990
Earlier work this paper cites.
Efficient algorithms for computing a strong rank-revealing QR factorization
M. G. Gu and S. C. Eisenstat · 1996
Earlier work this paper cites.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Earlier work this paper cites.
Sparse greedy Gaussian process regression
A. Smola and P. Bartlett · 2000
Earlier work this paper cites.
Efficient SVM training using low-rank kernel representations
S. Fine and K. Scheinberg · 2002
Earlier work this paper cites.
Laplacian eigenmaps for dimensionality reduction and data representation
M. Belkin and P. Niyogi · 2003
Earlier work this paper cites.
Spectral grouping using the Nyström method
C. Fowlkes, S. Belongie, F. Chung, and J. Malik · 2004
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
A. Frieze, R. Kannan, and S. Vempala · 2004
Earlier work this paper cites.
Schur complements and matrix inequalities: Operator-theoretic approach
T. Ando · 2005
Earlier work this paper cites.
Predictive low-rank decomposition for kernel methods
F. R. Bach and M. I. Jordan · 2005
Earlier work this paper cites.
On the Nystr̈om method for approximating a Gram matrix for improved kernel-based learning
P. Drineas and M. W. Mahoney · 2005
Earlier work this paper cites.
Gaussian Processes for Machine Learning
C. E. Rasmussen and C. K. I. Williams · 2005
Earlier work this paper cites.
Basic properties of the Schur complement
F. Zhang and R. Horn · 2005
Earlier work this paper cites.
Adaptive sampling and fast low-rank matrix approximation
A. Deshpande and S. Vempala · 2006
Earlier work this paper cites.
Matrix approximation and projective clustering via volume sampling
A. Deshpande, L. Rademacher, S. S. Vempala, and G. Wang · 2006
Earlier work this paper cites.
k-means++: The advantages of careful seeding
D. Arthur and S. Vassilvitskii · 2007
Earlier work this paper cites.
Random features for large-scale kernel machines
A. Rahimi and B. Recht · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
U. von Luxburg · 2007
Earlier work this paper cites.
Spectral methods in machine learning and new strategies for very large datasets
M.-A. Belabbas and P. J. Wolfe · 2009
Earlier work this paper cites.
Trace inequalities and quantum entropy: An introductory course
E. Carlen · 2010
Earlier work this paper cites.
LIBSVM: A library for support vector machines
C.-C. Chang and C.-J. Lin · 2011
Earlier work this paper cites.
The spectral norm error of the naive Nyström extension, 2011
A. Gittens · 2011
Earlier work this paper cites.
Determination of reaction coordinates via locally scaled diffusion map
M. A. Rohrdanz, W. Zheng, M. Maggioni, and C. Clementi · 2011
Cited alongside, same era.
Matrix Theory: Basic Results and Techniques
F. Zhang · 2011
Cited alongside, same era.
Optimal column-based low-rank matrix reconstruction
V. Guruswami and A. K. Sinop · 2012
Cited alongside, same era.
Determinantal point processes for machine learning
A. Kulesza and B. Taskar · 2012
Cited alongside, same era.
Sampling methods for the Nyström method
S. Kumar, M. Mohri, and A. Talwalkar · 2012
Cited alongside, same era.
Enumeration of 166 billion organic small molecules in the chemical universe database GDB-17
L. Ruddigkeit, R. van Deursen, L. C. Blum, and J.-L. Reymond · 2012
Cited alongside, same era.
Exact sampling of determinantal point processes with sublinear time preprocessing
M. Derezinski, D. Calandriello, and M. Valko · 2019
Later among the works it cites.
DPPy: DPP sampling with Python
G. Gautier, G. Polito, R. Bardenet, and M. Valko · 2019
Later among the works it cites.
High-performance sampling of generic determinantal point processes
J. Poulson · 2019
Later among the works it cites.
Chemical diversity in molecular orbital energy predictions with kernel ridge regression
A. Stuke, M. Todorović, M. Rupp, C. Kunkel, K. Ghosh, L. Himanen, and P. Rinke · 2019
Later among the works it cites.
Python implementation of the RLS-Nyström method, July 19 2019
A. Vanraes · 2019
Later among the works it cites.
Harnessing the power of infinitely wide deep nets on small-data tasks
S. Arora, S. S. Du, Z. Li, R. Salakhutdinov, R. Wang, and D. Yu · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matrix Computations
G. H. Golub and C. F. Van Loan · 2013
Cited alongside, same era.
OpenML: Networked science in machine learning
J. Vanschoren, J. N. van Rijn, B. Bischl, and L. Torgo · 2013
Cited alongside, same era.
Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
S. Wang and Z. Zhang · 2013
Cited alongside, same era.
Approximate Inference for Determinantal Point Processes
J. Gillenwater · 2014
Cited alongside, same era.
Quantum chemistry structures and properties of 134 kilo molecules
R. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. von Lilienfeld · 2014
Cited alongside, same era.
Fast randomized kernel ridge regression with statistical guarantees
A. Alaoui and M. W. Mahoney · 2015
Cited alongside, same era.
Later among the works it cites.
Finite versus infinite neural networks: An empirical study
J. Lee, S. Schoenholz, J. Pennington, B. Adlam, L. Xiao, R. Novak, and J. Sohl-Dickstein · 2020
Later among the works it cites.
Randomized numerical linear algebra: Foundations and algorithms
P.-G. Martinsson and J. A. Tropp · 2020
Later among the works it cites.
Kernel methods through the roof: Handling billions of points efficiently
G. Meanti, L. Carratino, L. Rosasco, and A. Rudi · 2020
Later among the works it cites.
Determinantal point processes in randomized numerical linear algebra
M. Dereziński and M. W. Mahoney · 2021
Later among the works it cites.
Diversity sampling is an implicit regularization for kernel methods
M. Fanuel, J. Schreurs, and J. Suykens · 2021
Later among the works it cites.
Unsupervised learning methods for molecular simulation data
A. Glielmo, B. E. Husic, A. Rodriguez, C. Clementi, F. Noé, and A. Laio · 2021
Later among the works it cites.
Simple, fast, and flexible framework for matrix completion with infinite width neural networks
A. Radhakrishnan, G. Stefanakis, M. Belkin, and C. Uhler · 2022
Closest in time.
Toward large kernel models
A. Abedsoltan, M. Belkin, and P. Pandit · 2023
Closest in time.
Kernel approximation on algebraic varieties
J. M. Altschuler and P. A. Parrilo · 2023
Closest in time.
Kernel methods are competitive for operator learning
P. Batlle, M. Darcy, B. Hosseini, and H. Owhadi · 2023
Closest in time.
A framework and benchmark for deep batch active learning for regression
D. Holzmüller, V. Zaverkin, J. Kästner, and I. Steinwart · 2023
Closest in time.
The fast committor machine: Interpretable prediction with kernels
D. Aristoff, M. Johnson, G. Simpson, and R. J. Webber · 2024
Closest in time.
Robust, randomized preconditioning for kernel ridge regression
M. Díaz, E. N. Epperly, Z. Frangella, J. A. Tropp, and R. J. Webber · 2024
Closest in time.
Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky
E. N. Epperly, J. A. Tropp, and R. J. Webber · 2024
Closest in time.
Mechanism for feature learning in neural networks and backpropagation-free machine learning models
A. Radhakrishnan, D. Beaglehole, P. Pandit, and M. Belkin · 2024
Closest in time.
Randomly pivoted partial Cholesky: Random how?
S. Steinerberger · 2024
Closest in time.