scientific article; zbMATH DE number 6276143
From MaRDI portal
Publication:5405152
zbMATH Open1283.68292MaRDI QIDQ5405152FDOQ5405152
Authors: Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar 
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/kumar12a.html
Title of this publication is not available (Why is that?)
Recommendations
- A Prony-like method for non-uniform sampling
- Nested sampling methods
- scientific article; zbMATH DE number 3860188
- scientific article; zbMATH DE number 1943012
- Sampling Methods
- Sampling methods
- Sampling Methods for Surrogate Modeling and Optimization
- Nonlinear and Nonideal Sampling: Theory and Methods
- Efficient numerical methods in non-uniform sampling theory
- scientific article; zbMATH DE number 815737
Learning and adaptive systems in artificial intelligence (68T05) Inequalities; stochastic orderings (60E15)
Cited In (35)
- 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
- On the mathematical foundations of stable RKHSs
- A Prony-like method for non-uniform sampling
- MREKLM: a fast multiple empirical kernel learning machine
- Fast density-weighted low-rank approximation spectral clustering
- Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- Lower bounds for column matrix approximations
- Randomized numerical linear algebra: Foundations and algorithms
- Spectrally-truncated kernel ridge regression and its free lunch
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Approximating spectral clustering via sampling: a review
- Nyström landmark sampling and regularized Christoffel functions
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations
- Title not available (Why is that?)
- Canonical kernel dimension reduction
- Analytical low-rank compression via proxy point selection
- Quick-means: accelerating inference for K-means by learning fast transforms
- Low-rank decomposition meets kernel learning: a generalized Nyström method
- Nyström-based approximate kernel subspace learning
- Large scale variable fidelity surrogate modeling
- Literature survey on low rank approximation of matrices
- Energy-based sequential sampling for low-rank PSD-matrix approximation
- Kernel embedding of measures and low-rank approximation of integral operators
- Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
- Robust low-rank multiple kernel learning with compound regularization
- Stochastic gradient descent for linear inverse problems in Hilbert spaces
- Multi-manifold discriminant Isomap for visualization and classification
- Faster kernel ridge regression using sketching and preconditioning
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- On expected error of randomized Nyström kernel regression
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Optimal Quadrature-Sparsification for Integral Operator Approximation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405152)
