Research map / Learning theory and algorithms / Matrix and tensor methods
Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completion
Haifeng Wang, Jinchi Chen, Ke Wei
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
- A Dual Framework for Low-rank Tensor Completion (NeurIPS 2018 · similarity 0.93)
- Low-rank tensor completion: a Riemannian manifold preconditioning approach (ICML 2016 · similarity 0.93)
- Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion (ICML 2025 · similarity 0.92)
- Fast Tensor Completion via Approximate Richardson Iteration (ICML 2025 · similarity 0.89)
- Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms (ICML 2024 · 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.
