Energy-based sequential sampling for low-rank PSD-matrix approximation
From MaRDI portal
conditional gradientdifferentiable relaxationgeneralized convexityNyström approximationreproducing kernel Hilbert spaces
Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Linear operators in reproducing-kernel Hilbert spaces (including de Branges, de Branges-Rovnyak, and other structured spaces) (47B32) Numerical optimization and variational techniques (65K10)
Recommendations
- SPSD matrix approximation vis column selection: theories, algorithms, and extensions
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Low-Rank PSD Approximation in Input-Sparsity Time
- Making the Nystr\"om method highly accurate for low-rank approximations
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
Cites work
- An introduction to the theory of reproducing kernel Hilbert spaces
- Determinantal point processes in randomized numerical linear algebra
- Gaussian processes for machine learning.
- How to generate random matrices from the classical compact groups
- scientific article; zbMATH DE number 6276143 (Why is no real title available?)
- Kernel embedding of measures and low-rank approximation of integral operators
- Kernel Mean Embedding of Distributions: A Review and Beyond
- On the empirical estimation of integral probability metrics
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Optimal Quadrature-Sparsification for Integral Operator Approximation
- Revisiting the Nyström method for improved large-scale machine learning
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
This page was built for publication: Energy-based sequential sampling for low-rank PSD-matrix approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655075)
