Revisiting the Nyström method for improved large-scale machine learning
From MaRDI portal
Recommendations
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Learning Theory
- SPSD matrix approximation vis column selection: theories, algorithms, and extensions
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- Towards more efficient SPSD matrix approximation and CUR matrix decomposition
Cited in
(75)- Large-scale eigenvector approximation via Hilbert space embedding Nyström
- Kernel conjugate gradient methods with random projections
- Fixed inducing points online Bayesian calibration for computer models with an application to a scale-resolving CFD simulation
- Nyström landmark sampling and regularized Christoffel functions
- Fast spectral analysis for approximate nearest neighbor search
- Randomized Nyström features for fast regression: an error analysis
- On the mathematical foundations of stable RKHSs
- Fast kernel \(k\)-means clustering using incomplete Cholesky factorization
- A random features-based method for interpolating digital terrain models with high efficiency
- Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers
- Small-deviation inequalities for sums of random matrices
- Far-field compression for fast kernel summation methods in high dimensions
- Randomized matrix-free trace and log-determinant estimators
- On convergence rates of adaptive ensemble Kalman inversion for linear ill-posed problems
- Generalized pseudoskeleton decompositions
- SPSD matrix approximation vis column selection: theories, algorithms, and extensions
- On data preconditioning for regularized loss minimization
- Large-scale SVD and manifold learning
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Approximating spectral clustering via sampling: a review
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- scientific article; zbMATH DE number 1149453 (Why is no real title available?)
- Optimal Quadrature-Sparsification for Integral Operator Approximation
- Faster kernel ridge regression using sketching and preconditioning
- Max-Plus Algebraic Statistical Leverage Scores
- Literature survey on low rank approximation of matrices
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Distributed learning with regularized least squares
- scientific article; zbMATH DE number 6860845 (Why is no real title available?)
- On the numerical rank of radial basis function kernels in high dimensions
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- Convergence of sparse variational inference in Gaussian processes regression
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Dimension-free bounds for largest singular values of matrix Gaussian series
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- Improved Variants of the Hutch++ Algorithm for Trace Estimation
- Self-assignment flows for unsupervised data labeling on graphs
- Analytical low-rank compression via proxy point selection
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Two-level Nyström-Schur preconditioner for sparse symmetric positive definite matrices
- Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views
- Block basis factorization for scalable kernel evaluation
- Perturbations of CUR Decompositions
- Kernel Approximation on Algebraic Varieties
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- An Online Projection Estimator for Nonparametric Regression in Reproducing Kernel Hilbert Spaces
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations
- Efficient kernel canonical correlation analysis using Nyström approximation
- Randomized Nyström Preconditioning
- Randomized Low-Rank Approximation of Monotone Matrix Functions
- Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning
- Making the Nystr\"om method highly accurate for low-rank approximations
- Kernel embedding of measures and low-rank approximation of integral operators
- A review on design inspired subsampling for big data
- Preconditioner design via Bregman divergences
- An adaptive factorized Nyström preconditioner for regularized kernel matrices
- Single-pass Nyström approximation in mixed precision
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- Projection-based techniques for high-dimensional optimal transport problems
- Constrained clustering and multiple kernel learning without pairwise constraint relaxation
- Energy-based sequential sampling for low-rank PSD-matrix approximation
- Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
- On the randomized SVD in infinite dimensions
- Estimating singular functions of kernel cross-covariance operators: an investigation of the Nyström method
- Randomized Nyström approximation of non-negative self-adjoint operators
- Co-Factor Analysis of Citation Networks
- A generalized Nyström method with subspace iteration for low-rank approximations of large-scale nonsymmetric matrices
- Convergence analysis of regularised Nyström method for functional linear regression
- \texttt{FedPower}: privacy-preserving distributed eigenspace estimation
- Algorithm-agnostic low-rank approximation of operator monotone matrix functions
- Kernel-based L₂-boosting with structure constraints
- Rigidity theorem for hypersurfaces in a unit sphere
This page was built for publication: Revisiting the Nyström method for improved large-scale machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188054)
