3 citations · 5 across the 4 of their papers we have counts for
4 papers
A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
Chandra Kundu, Abiy Tasissa, HanQin Cai
Euclidean Distance Matrix (EDM), which consists of pairwise squared Euclidean distances of a given point configuration, finds many applications in modern machine learning. This pap…
Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery
HanQin Cai, Chandra Kundu, Jialin Liu +1
Robust matrix completion (RMC) is a widely used machine learning tool that simultaneously tackles two critical issues in low-rank data analysis: missing data entries and extreme ou…
Structured Sampling for Robust Euclidean Distance Geometry
Chandra Kundu, Abiy Tasissa, HanQin Cai
This paper addresses the problem of estimating the positions of points from distance measurements corrupted by sparse outliers. Specifically, we consider a setting with two types o…
On the Robustness of Cross-Concentrated Sampling for Matrix Completion
HanQin Cai, Longxiu Huang, Chandra Kundu +1
Matrix completion is one of the crucial tools in modern data science research. Recently, a novel sampling model for matrix completion coined cross-concentrated sampling (CCS) has c…