Research map / Learning theory and algorithms / Matrix and tensor methods
Provable Tensor-Train Format Tensor Completion by Riemannian Optimization
Jian-Feng Cai, Jingyang Li, Dong Xia
Read the paperCheck your idea against 137,217 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
- Fast Tensor Completion via Approximate Richardson Iteration (ICML 2025 · similarity 0.91)
- Guaranteed Nonconvex Factorization Approach for Tensor Train Recovery (JMLR 2024 · similarity 0.90)
- On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm (NeurIPS 2017 · similarity 0.90)
- Tensor Completion Made Practical (NeurIPS 2020 · similarity 0.90)
- Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion (ICML 2025 · similarity 0.89)
- Efficient Leverage Score Sampling for Tensor Train Decomposition (NeurIPS 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
