A quantized, tree-based backward dynamic programming algorithm computes adapted Wasserstein distances with statistical consistency and claimed, but unbenchmarked, parallel speedups.
Estimating processes in adapted wasserstein distance.The Annals of Applied Probability, 32(1):529–550, 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Nested Optimal Transport Distances
A quantized, tree-based backward dynamic programming algorithm computes adapted Wasserstein distances with statistical consistency and claimed, but unbenchmarked, parallel speedups.