Research map / Learning theory and algorithms / Matrix and tensor methods

Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning

NeurIPS 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized tensor decomposition algorithms · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion (AAAI 2019 · similarity 0.89)
• SWIFT: Scalable Wasserstein Factorization for Sparse Nonnegative Tensors (AAAI 2021 · similarity 0.88)
• Partitioned Tensor Factorizations for Learning Mixed Membership Models (ICML 2017 · similarity 0.88)
• Expected Tensor Decomposition with Stochastic Gradient Descent (AAAI 2016 · similarity 0.88)
• SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling (NeurIPS 2016 · similarity 0.88)
• Fast Tensor Completion via Approximate Richardson Iteration (ICML 2025 · similarity 0.87)