Pages that link to "Item:Q4643335"

The following pages link to A Practical Randomized CP Tensor Decomposition (Q4643335):

Displaying 50 items.

• A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
• Numerical CP decomposition of some difficult tensors (Q508007) (← links)
• The numerical approximation of nonlinear functionals and functional differential equations (Q1708692) (← links)
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
• Supervised multiway factorization (Q1746558) (← links)
• Parallel tensor methods for high-dimensional linear PDEs (Q2002269) (← links)
• Fast randomized matrix and tensor interpolative decomposition using countsketch (Q2025436) (← links)
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems (Q2112682) (← links)
• Tensor methods for the Boltzmann-BGK equation (Q2123758) (← links)
• An ATLD-ALS method for the trilinear decomposition of large third-order tensors (Q2156526) (← links)
• A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition (Q2161453) (← links)
• An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
• Time-aware tensor decomposition for sparse tensors (Q2163199) (← links)
• The Hanson-Wright inequality for random tensors (Q2164658) (← links)
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
• Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization (Q2224916) (← links)
• Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
• Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies (Q2322234) (← links)
• Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees (Q4603494) (← links)
• A Trust-Region-Based Alternating Least-Squares Algorithm for Tensor Decompositions (Q4688178) (← links)
• On Koopman mode decomposition and tensor component analysis (Q4993697) (← links)
• Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836) (← links)
• Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition (Q5009907) (← links)
• Tensor-Structured Sketching for Constrained Least Squares (Q5021024) (← links)
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024) (← links)
• Stochastic Gradients for Large-Scale Tensor Decomposition (Q5037555) (← links)
• Low-Rank Tucker Approximation of a Tensor from Streaming Data (Q5037558) (← links)
• Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition (Q5099421) (← links)
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations (Q5137221) (← links)
• Structured Random Sketching for PDE Inverse Problems (Q5146630) (← links)
• (Q5159482) (← links)
• Quantized CP approximation and sparse tensor interpolation of function‐generated data (Q5206497) (← links)
• Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion (Q5232122) (← links)
• Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking (Q5258607) (← links)
• Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC (Q5300549) (← links)
• Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
• Johnson–Lindenstrauss Embeddings with Kronecker Structure (Q5885797) (← links)
• Real eigenstructure of regular simplex tensors (Q6044312) (← links)
• A literature survey of matrix methods for data science (Q6068265) (← links)
• Randomized tensor decomposition for large-scale data assimilation problems for carbon dioxide sequestration (Q6084299) (← links)
• Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition (Q6087747) (← links)
• A Higher-Order Generalized Singular Value Decomposition for Rank-Deficient Matrices (Q6116662) (← links)
• A block-randomized stochastic method with importance sampling for CP tensor decomposition (Q6126539) (← links)
• A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes (Q6143819) (← links)
• Accelerated doubly stochastic gradient descent for tensor CP decomposition (Q6161551) (← links)
• Provable stochastic algorithm for large-scale fully-connected tensor network decomposition (Q6184280) (← links)
• Randomized tensor wheel decomposition (Q6551213) (← links)
• A random sampling algorithm for fully-connected tensor network decomposition with applications (Q6552670) (← links)
• Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering (Q6593833) (← links)