Pages that link to "Item:Q5037558"

The following pages link to Low-Rank Tucker Approximation of a Tensor from Streaming Data (Q5037558):

Displaying 33 items.

• An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
• Tensor decision trees for continual learning from drifting data streams (Q2071480) (← links)
• Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions (Q2093707) (← links)
• An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
• Learning mean-field equations from particle data using WSINDy (Q2167982) (← links)
• Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
• Randomized Sketching Algorithms for Low-Memory Dynamic Optimization (Q4989933) (← links)
• Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836) (← links)
• Structured Matrix Approximations via Tensor Decompositions (Q5057769) (← 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)
• (Q5159466) (← links)
• Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
• Tensor Manifold with Tucker Rank Constraints (Q5865922) (← links)
• Generative modeling via tensor train sketching (Q6051158) (← links)
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
• Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches (Q6066095) (← links)
• Parallel Algorithms for Computing the Tensor-Train Decomposition (Q6097870) (← links)
• Practical sketching algorithms for low-rank Tucker approximation of large tensors (Q6101551) (← links)
• Incremental algorithms for truncated higher-order singular value decompositions (Q6139252) (← links)
• A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes (Q6143819) (← links)
• Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation (Q6154935) (← links)
• Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery (Q6172173) (← links)
• Randomized tensor wheel decomposition (Q6551213) (← links)
• Riemannian preconditioned coordinate descent for low multilinear rank approximation (Q6561638) (← links)
• SVD-based algorithms for fully-connected tensor network decomposition (Q6563146) (← links)
• Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering (Q6593833) (← links)
• Two-sided randomized algorithms for approximate \(K\)-term t-SVD (Q6595465) (← links)
• A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format (Q6620442) (← links)
• Scalable symmetric Tucker tensor decomposition (Q6623664) (← links)
• A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format (Q6623671) (← links)
• SVD-based algorithms for tensor wheel decomposition (Q6624467) (← links)
• Tracking tensor ring decompositions of streaming tensors (Q6659771) (← links)