Research map / Learning theory and algorithms / Matrix and tensor methods
Fundamental Conditions for Low-CP-Rank Tensor Completion
Morteza Ashraphijuo, Xiaodong Wang
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
- Rank Determination for Low-Rank Data Completion (JMLR 2017 · similarity 0.90)
- Nonnegative Tensor Completion via Integer Optimization (NeurIPS 2022 · similarity 0.89)
- Union of Low-Rank Tensor Spaces: Clustering and Completion (JMLR 2020 · similarity 0.89)
- Fast Tensor Completion via Approximate Richardson Iteration (ICML 2025 · similarity 0.87)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.85)
- Fast Sampling-Based Sketches for Tensors (ICML 2024 · similarity 0.85)
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.
