Research map / Learning theory and algorithms / Matrix and tensor methods
Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms
Check 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use DCT instead of DFT for the transform in tensor nuclear norm completion (ablation) | Transform-based tensor nuclear norm minimization · Color image recovery | PSNR | Helped |
| Use a random orthogonal matrix instead of DCT for the transform (ablation) | Transform-based tensor nuclear norm minimization · Color image recovery | PSNR | Hurt |
| Use DCT instead of DFT for the transform in tensor nuclear norm completion (ablation) | Transform-based tensor nuclear norm minimization · Random tensor completion | relative Frobenius error | No clear effect |
Closest papers by meaning
- Efficient Sparse Low-Rank Tensor Completion Using the Frank-Wolfe Algorithm (AAAI 2017 · similarity 0.91)
- Nonconvex Low-Rank Tensor Completion from Noisy Data (NeurIPS 2019 · similarity 0.91)
- Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion (AAAI 2019 · similarity 0.90)
- Fast Tensor Completion via Approximate Richardson Iteration (ICML 2025 · similarity 0.89)
- Non-Convex Tensor Recovery from Local Measurements (AAAI 2025 · similarity 0.87)
- Symmetric Matrix Completion with ReLU Sampling (ICML 2024 · similarity 0.87)
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.