Fast 1-Wasserstein distance approximations using greedy strategies.

Guillaume Houry Han Bao Han Zhao Makoto Yamada

Published in: AISTATS (2024)

Keyphrases

greedy algorithm
search algorithm
euclidean distance
dynamic programming
distance metric
approximation methods
distance measurement
feature selection
case study
lower bound
search strategies
dissimilarity measure
hamming distance
optimal strategy
pointwise
average distance