scientific article

zbMath1367.68223arXiv1303.1849MaRDI QIDQ3188054

Alex Gittens, Michael W. Mahoney

Publication date: 16 August 2016

Full work available at URL: https://arxiv.org/abs/1303.1849

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

numerical linear algebrakernel methodsrandomized algorithmsNyström approximationlow-rank approximation

Mathematics Subject Classification ID

Related Items (48)

Fixed inducing points online Bayesian calibration for computer models with an application to a scale-resolving CFD simulation ⋮ Kernel Approximation on Algebraic Varieties ⋮ On data preconditioning for regularized loss minimization ⋮ Optimal Quadrature-Sparsification for Integral Operator Approximation ⋮ Nyström landmark sampling and regularized Christoffel functions ⋮ Fast spectral analysis for approximate nearest neighbor search ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dimension-free bounds for largest singular values of matrix Gaussian series ⋮ Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets ⋮ Randomized matrix-free trace and log-determinant estimators ⋮ Improved Variants of the Hutch++ Algorithm for Trace Estimation ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ An Online Projection Estimator for Nonparametric Regression in Reproducing Kernel Hilbert Spaces ⋮ On convergence rates of adaptive ensemble Kalman inversion for linear ill-posed problems ⋮ On the mathematical foundations of stable RKHSs ⋮ Randomized Low-Rank Approximation for Symmetric Indefinite Matrices ⋮ An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ Max-Plus Algebraic Statistical Leverage Scores ⋮ Efficient kernel canonical correlation analysis using Nyström approximation ⋮ Randomized Nyström Preconditioning ⋮ Randomized Low-Rank Approximation of Monotone Matrix Functions ⋮ Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning ⋮ Generalized pseudoskeleton decompositions ⋮ Literature survey on low rank approximation of matrices ⋮ Optimal CUR Matrix Decompositions ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Self-Assignment Flows for Unsupervised Data Labeling on Graphs ⋮ Analytical Low-Rank Compression via Proxy Point Selection ⋮ Kernel conjugate gradient methods with random projections ⋮ On the Numerical Rank of Radial Basis Function Kernels in High Dimensions ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Fast kernel \(k\)-means clustering using incomplete Cholesky factorization ⋮ Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices ⋮ Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views ⋮ Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm ⋮ Block Basis Factorization for Scalable Kernel Evaluation ⋮ A random features-based method for interpolating digital terrain models with high efficiency ⋮ Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Small-deviation inequalities for sums of random matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perturbations of CUR Decompositions ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: