1 citations · 2 across the 6 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
stat.ML2025
Recovering Wasserstein Distance Matrices from Few Measurements
Muhammad Rana, Abiy Tasissa, HanQin Cai +2
This paper proposes two algorithms for estimating square Wasserstein distance matrices from a small number of entries. These matrices are used to compute manifold learning embeddin…
math.OC2025
Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
Chandler Smith, HanQin Cai, Abiy Tasissa
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a bro…
cs.LG2025
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…