Talks
Fall 2018

On Using Graph Distances to Estimate Euclidean and Related Distances
Monday, Oct. 29, 2018 4:00 pm – 4:40 pm PDT
Speaker:
Ery Arias-Castro (UC San Diego)
Graph distances have proven quite useful in machine learning/statistics, particularly in the estimation of Euclidean or geodesic distances. The talk will include a partial review of the literature, and then present more recent developments on the estimation of curvature-constrained distances on a surface, as well as on the estimation of Euclidean distances based on an unweighted and noisy neighborhood graph.
Attachment | Size |
---|---|
![]() | 773.01 KB |