ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2411.12965
  4. Cited By
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
v1v2 (latest)

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion

20 November 2024
Tathagata Sadhukhan
Manit Paul
Raaz Dwivedi
ArXiv (abs)PDFHTMLGithub

Papers citing "Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion"

1 / 1 papers shown
Adaptively-weighted Nearest Neighbors for Matrix Completion
Adaptively-weighted Nearest Neighbors for Matrix Completion
Tathagata Sadhukhan
Manit Paul
Raaz Dwivedi
280
1
0
14 May 2025
1
Page 1 of 1