Why Should Q=P in the Wasserstein Distance Between Persistence Diagrams?
Offered By: Applied Algebraic Topology Network via YouTube
Course Description
Overview
Syllabus
Intro
Matchings between diagrams
Bottleneck distance distance
The main contenders
Coordinates have separate meanings
An example with height functions
An example with point clouds
Recall: Sublevel sets of functions on simplicial complexes
Local Stability for functions on simplicial complexes
Interleaving distance
The p-norm of a persistence module
Morphisms between persistence diagrams
Example with persistence modules of a single interval
Constructing a span from a matching
Spans for the bottleneck distance - matching the diagonal
Mean as minimiser of sum of distances squared
Candidates for the Mean
Candidates for the Median
Median of a selection - q=p=1
A case for change - replace
Lipschitz stability corollaries
Taught by
Applied Algebraic Topology Network
Related Courses
Regularization for Optimal Transport and Dynamic Time Warping Distances - Marco CuturiAlan Turing Institute via YouTube Analysis of Mean-Field Games - Lecture 1
International Centre for Theoretical Sciences via YouTube Washington Mio - Stable Homology of Metric Measure Spaces
Applied Algebraic Topology Network via YouTube Wasserstein Distributionally Robust Optimization - Theory and Applications in Machine Learning
Institute for Pure & Applied Mathematics (IPAM) via YouTube Wasserstein Distances, Geodesics and Barycenters of Merge Trees
Applied Algebraic Topology Network via YouTube