ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2101.11108
  4. Cited By
New Riemannian preconditioned algorithms for tensor completion via
  polyadic decomposition

New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition

26 January 2021
Shuyu Dong
Bin Gao
Yu Guan
Franccois Glineur
ArXivPDFHTML

Papers citing "New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition"

2 / 2 papers shown
Title
Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
Fengmiao Bian
Jian-Feng Cai
Xiaoqun Zhang
Yuanwei Zhang
78
0
0
23 Jan 2025
Tensor-on-Tensor Regression: Riemannian Optimization,
  Over-parameterization, Statistical-computational Gap, and Their Interplay
Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay
Yuetian Luo
Anru R. Zhang
38
19
0
17 Jun 2022
1