Randomized interpolative decomposition of separated representations
From MaRDI portal
Publication:728743
DOI10.1016/j.jcp.2014.10.009zbMath1352.65123arXiv1306.5013OpenAlexW2056649499MaRDI QIDQ728743
David J. Biagioni, Gregory Beylkin, Daniel Beylkin
Publication date: 20 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5013
alternating least squares algorithmcanonical tensor decompositioninterpolative decompositionrandomized projectionself-guiding tensor iteration
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Randomized algorithms (68W20)
Related Items
Numerical methods for high-dimensional probability density function equations, An efficient algorithm for computing the approximate t-URV and its applications, Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument, Optimization via separated representations and the canonical tensor decomposition, The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection, Reduction of multivariate mixtures and its applications, Randomized algorithms for the low multilinear rank approximations of tensors, Structured Random Sketching for PDE Inverse Problems, Fast randomized matrix and tensor interpolative decomposition using countsketch, Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data, HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation, Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion, Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- TT-cross approximation for multidimensional arrays
- Multiresolution representation of operators with boundary conditions on simple domains
- A randomized algorithm for the decomposition of matrices
- A fast algorithm for the inversion of general Toeplitz matrices
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A fast randomized algorithm for the approximation of matrices
- A comparison of algorithms for fitting the PARAFAC model
- Mosaic-skeleton approximations
- Pseudo-skeleton approximations by matrices of maximal volume
- A theory of pseudoskeleton approximations
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Incomplete cross approximation in the mosaic-skeleton method
- Black box approximation of tensors in hierarchical Tucker format
- Musings on multilinear fitting
- Low rank tensor recovery via iterative hard thresholding
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A literature survey of low-rank tensor approximation techniques
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Randomized algorithms for the low-rank approximation of matrices
- Fast wavelet transforms and numerical algorithms I
- Shifted Power Method for Computing Tensor Eigenpairs
- Extensions of Lipschitz mappings into a Hilbert space
- Approximating a wavefunction as an unconstrained sum of Slater determinants
- Fast computation of low-rank matrix approximations
- Sampling from large matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Multivariate Regression and Machine Learning with Sums of Separable Functions
- Tensor decomposition and approximation schemes for constraint satisfaction problems
- On the Representation of Operators in Bases of Compactly Supported Wavelets
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Numerical operator calculus in higher dimensions
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Accurate Singular Value Decompositions of Structured Matrices
- On the Compression of Low Rank Matrices
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Fast monte-carlo algorithms for finding low-rank approximations
- Algorithms for Numerical Analysis in High Dimensions
