scientific article; zbMATH DE number 6276143
From MaRDI portal
Publication:5405152
zbMath1283.68292MaRDI QIDQ5405152
Sanjiv Kumar, Ameet Talwalkar, Mehryar Mohri
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/kumar12a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Inequalities; stochastic orderings (60E15) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (30)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Optimal Quadrature-Sparsification for Integral Operator Approximation ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Canonical kernel dimension reduction ⋮ Unnamed Item ⋮ On expected error of randomized Nyström kernel regression ⋮ Stochastic gradient descent for linear inverse problems in Hilbert spaces ⋮ Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets ⋮ Low-rank decomposition meets kernel learning: a generalized Nyström method ⋮ Large scale variable fidelity surrogate modeling ⋮ Multi-manifold discriminant Isomap for visualization and classification ⋮ Nyström-based approximate kernel subspace learning ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics ⋮ On the mathematical foundations of stable RKHSs ⋮ Fast density-weighted low-rank approximation spectral clustering ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ Lower bounds for column matrix approximations ⋮ Literature survey on low rank approximation of matrices ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ Spectrally-truncated kernel ridge regression and its free lunch ⋮ Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking ⋮ Robust low-rank multiple kernel learning with compound regularization ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ The Nyström minimum kernel risk-sensitive loss algorithm with \(k\)-means sampling ⋮ MREKLM: a fast multiple empirical kernel learning machine ⋮ Quick-means: accelerating inference for K-means by learning fast transforms ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
