On the Nyström method for approximating a gram matrix for improved kernel-based learning
From MaRDI portal
Publication:3093333
zbMATH Open1222.68186MaRDI QIDQ3093333FDOQ3093333
Authors: Michael W. Mahoney, Petros Drineas 
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v6/drineas05a.html
Recommendations
- Learning Theory
- Revisiting the Nyström method for improved large-scale machine learning
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- Randomized Nyström features for fast regression: an error analysis
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Cited In (only showing first 100 items - show all)
- A scalable gaussian process analysis algorithm for biomass monitoring
- On the Numerical Rank of Radial Basis Function Kernels in High Dimensions
- The Nyström minimum kernel risk-sensitive loss algorithm with \(k\)-means sampling
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Title not available (Why is that?)
- New efficient algorithms for multiple change-point detection with reproducing kernels
- Fast density-weighted low-rank approximation spectral clustering
- Far-field compression for fast kernel summation methods in high dimensions
- Variable prioritization in nonlinear black box methods: a genetic association case study
- Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Column subset selection problem is UG-hard
- Randomized numerical linear algebra: Foundations and algorithms
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Accuracy of suboptimal solutions to kernel principal component analysis
- Self-Assignment Flows for Unsupervised Data Labeling on Graphs
- Analytical Low-Rank Compression via Proxy Point Selection
- The kernel Kalman rule. Efficient nonparametric inference by recursive least-squares and subspace projections
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- Perturbations of CUR Decompositions
- Multiple Spectral Kernel Learning and a Gaussian Complexity Computation
- Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix
- Stochastic subgradient estimation training for support vector machines
- Reduced-Dimensional Monte Carlo Maximum Likelihood for Latent Gaussian Random Field Models
- Perspectives on CUR decompositions
- Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications
- Randomized signal processing with continuous frames
- Nyström landmark sampling and regularized Christoffel functions
- Large-scale SVD and manifold learning
- An approximate linear solver in least square support vector machine using randomized singular value decomposition
- Low-rank kernel learning with Bregman matrix divergences
- Approximate kernel PCA: computational versus statistical trade-off
- Optimal CUR Matrix Decompositions
- An efficient kernel matrix evaluation measure
- Scalable Gaussian Process Computations Using Hierarchical Matrices
- Using an iterative linear solver in an interior-point method for generating support vector machines
- Canonical kernel dimension reduction
- Diffuse interface models on graphs for classification of high dimensional data
- Title not available (Why is that?)
- Randomized approximate class-specific kernel spectral regression analysis for large-scale face verification
- Randomized generalized singular value decomposition
- Approximation of kernel matrices by circulant matrices and its application in kernel selection methods
- Iterative ensemble normalized cuts
- Large-scale eigenvector approximation via Hilbert space embedding Nyström
- A Computationally Efficient Projection-Based Approach for Spatial Generalized Linear Mixed Models
- Title not available (Why is that?)
- Rigidity theorem for hypersurfaces in a unit sphere
- Low-rank decomposition meets kernel learning: a generalized Nyström method
- Nyström-based approximate kernel subspace learning
- Scalable Gaussian kernel support vector machines with sublinear training time complexity
- Large scale variable fidelity surrogate modeling
- Learning low-rank kernel matrices with column-based methods
- Literature survey on low rank approximation of matrices
- Sparse hierarchical regression with polynomials
- A memory-free spatial additive mixed modeling for big spatial data
- Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
- Triply stochastic gradient method for large-scale nonlinear similar unlabeled classification
- Title not available (Why is that?)
- Near-optimal coresets of kernel density estimates
- Robust low-rank multiple kernel learning with compound regularization
- Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation
- Learning Theory
- Title not available (Why is that?)
- Beam search algorithms for multilabel learning
- Title not available (Why is that?)
- Exemplar-based low-rank matrix decomposition for data clustering
- Optimized fixed-size kernel models for large data sets
- Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
- Optimal Quadrature-Sparsification for Integral Operator Approximation
- Discovering causal structure with reproducing-kernel Hilbert space \(\epsilon\)-machines
- Preconditioner design via Bregman divergences
- Block Basis Factorization for Scalable Kernel Evaluation
- M-estimation for varying coefficient models with a functional response in a reproducing kernel Hilbert space
- Linear-Cost Covariance Functions for Gaussian Random Fields
- Title not available (Why is that?)
- An adaptive factorized Nyström preconditioner for regularized kernel matrices
- Single-pass Nyström approximation in mixed precision
- Kernel Approximation on Algebraic Varieties
- Efficient kernel canonical correlation analysis using Nyström approximation
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Extreme entropy machines: robust information theoretic classification
- Title not available (Why is that?)
- Kernel embedding based variational approach for low-dimensional approximation of dynamical systems
- Randomized Low-Rank Approximation for Symmetric Indefinite Matrices
- Unconfused ultraconservative multiclass algorithms
- Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA
- Sparse Gaussian processes for solving nonlinear PDEs
- Spectral regularized Kernel two-sample tests
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Title not available (Why is that?)
- A literature survey of matrix methods for data science
- Spatially filtered unconditional quantile regression: application to a hedonic analysis
- Privacy preserving feature selection and multiclass classification for horizontally distributed data
- The kernel semi-least squares method for sparse distance approximation
- On convergence rates of adaptive ensemble Kalman inversion for linear ill-posed problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Energy-based sequential sampling for low-rank PSD-matrix approximation
This page was built for publication: On the Nyström method for approximating a gram matrix for improved kernel-based learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093333)
