Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification
From MaRDI portal
Cites work
- A comparison of generalized linear discriminant analysis algorithms
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- A randomized Kaczmarz algorithm with exponential convergence
- Fast Low-Rank Kernel Matrix Factorization Using Skeletonized Interpolation
- Faster randomized block Kaczmarz algorithms
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrix approximation for kernel-based scattered data interpolation
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Interpolative decomposition via proxy points for kernel matrices
- Interpretable time series kernel analytics by pre-image estimation
- Kernel methods in machine learning
- Low-rank decomposition meets kernel learning: a generalized Nyström method
- Mathematical analysis I. Transl. from the Italian by Simon Chiossi
- Multiple kernel learning algorithms
- On spectral distribution of kernel matrices related to radial basis functions
- On the numerical rank of radial basis function kernels in high dimensions
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Pattern classification.
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Probability and random processes.
- Randomized block Kaczmarz method with projection for solving least squares
- Randomized extended Kaczmarz for solving least squares
- The trace ratio optimization problem
Cited in
(2)
This page was built for publication: Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163243)
