← Search

Guillaume Houry

2 accepted papers

2024

Fast 1-Wasserstein distance approximations using greedy strategies

AISTATS 2024poster

Among numerous linear approximation methods proposed for optimal transport (OT), tree-based methods appear to be fairly reliable, notably for language processing applications. Inspired by these tree methods, we introduce several greedy heuristics aiming to compute even faster approximations of OT. W…