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. 2208.11246
  4. Cited By
Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix
  Completion

Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion

24 August 2022
G. Zhang
Hong-Ming Chiu
Richard Y. Zhang
ArXivPDFHTML

Papers citing "Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion"

4 / 4 papers shown
Title
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent
Yicheng Li
Xinghua Sun
39
0
0
28 Apr 2025
Sample-Efficient Geometry Reconstruction from Euclidean Distances using
  Non-Convex Optimization
Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization
Ipsita Ghosh
Abiy Tasissa
Christian Kümmerle
27
1
0
22 Oct 2024
Matrix Completion in Almost-Verification Time
Matrix Completion in Almost-Verification Time
Jonathan A. Kelner
Jungshian Li
Allen Liu
Aaron Sidford
Kevin Tian
14
4
0
07 Aug 2023
Fast and Accurate Estimation of Low-Rank Matrices from Noisy
  Measurements via Preconditioned Non-Convex Gradient Descent
Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent
Jialun Zhang
Hong-Ming Chiu
Richard Y. Zhang
37
5
0
26 May 2023
1