Parametric kernel low-rank approximations using tensor train decomposition
From MaRDI portal
Cites work
- A fast algorithm for particle simulations
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A theory of pseudoskeleton approximations
- Adaptive low-rank approximation of collocation matrices
- Analytical low-rank compression via proxy point selection
- Approximation in the extended functional tensor train format
- Approximation of boundary element matrices
- Approximation theory and approximation practice
- Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach
- Efficient iterative methods for hyperparameter estimation in large-scale linear inverse problems
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- Fast Deterministic Approximation of Symmetric Indefinite Kernel Matrices with High Dimensional Datasets
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices: algorithms and analysis
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- Hybrid cross approximation of integral operators
- On selecting a maximum volume sub-matrix of a matrix and related problems
- On the Compressibility of Tensors
- On the numerical rank of radial basis function kernels in high dimensions
- Parallel Algorithms for Computing the Tensor-Train Decomposition
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Quasi-Monte Carlo feature maps for shift-invariant kernels
- Quasioptimality of maximum-volume cross interpolation of tensors
- Randomized low-rank approximation of parameter-dependent matrices.
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Scikit-learn: machine learning in Python
- Tensor trains approximation estimates in the Chebyshev norm
- Tensor-train decomposition
- The black-box fast multipole method
- The Fast Gauss Transform
- The maximal-volume concept in approximation by low-rank matrices
- TT-cross approximation for multidimensional arrays
This page was built for publication: Parametric kernel low-rank approximations using tensor train decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993631)
