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. 2201.13052
  4. Cited By
Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm

Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm

31 January 2022
Pini Zilber
B. Nadler
ArXivPDFHTML

Papers citing "Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm"

2 / 2 papers shown
Title
Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
Yao Wang
Yiyang Yang
Kaidong Wang
Shanxing Gao
Xiuwu Liao
63
0
0
12 Feb 2025
GNMR: A provable one-line algorithm for low rank matrix recovery
GNMR: A provable one-line algorithm for low rank matrix recovery
Pini Zilber
B. Nadler
48
13
0
24 Jun 2021
1