Block Basis Factorization for Scalable Kernel Evaluation
From MaRDI portal
Publication:5203970
DOI10.1137/18M1212586zbMath1453.65091arXiv1505.00398WikidataQ126575411 ScholiaQ126575411MaRDI QIDQ5203970
Ruoxi Wang, Yingzhou Li, Michael W. Mahoney, Eric Darve
Publication date: 9 December 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.00398
Learning and adaptive systems in artificial intelligence (68T05) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Numerical radial basis function approximation (65D12)
Related Items (6)
Kernel Approximation on Algebraic Varieties ⋮ Structured Matrix Approximations via Tensor Decompositions ⋮ Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations ⋮ Hierarchical Matrix Approximation for Kernel-Based Scattered Data Interpolation ⋮ Scalable Gaussian Process Computations Using Hierarchical Matrices ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- The black-box fast multipole method
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Multidimensional butterfly factorization
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- The fast multipole method: Numerical implementation
- A fast block low-rank dense solver with applications to finite-element matrices
- A fast directional algorithm for high frequency acoustic scattering in two dimensions
- Randomized algorithms for the low-rank approximation of matrices
- Fast algorithms for hierarchically semiseparable matrices
- Randomized Algorithms for Matrices and Data
- Solution of Sparse Indefinite Systems of Linear Equations
- The Fast Multipole Method I: Error Analysis and Asymptotic Complexity
- On the Numerical Rank of Radial Basis Function Kernels in High Dimensions
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- Butterfly Factorization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- On the Compression of Low Rank Matrices
- Kernel Methods for the Approximation of Nonlinear Systems
- The Fast Gauss Transform
- Methods of conjugate gradients for solving linear systems
- A fast algorithm for particle simulations
This page was built for publication: Block Basis Factorization for Scalable Kernel Evaluation
