No article text was recorded for this version.
tree-based optimal transport approximation
Version 2 of 257 papers85 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem
- Blog: Fast 1-Wasserstein distance approximations using greedy strategies
- Blog: Tree Structure for the Categorical Wasserstein Weisfeiler-Lehman Graph Kernel
- Blog: Scalable Nearest Neighbor Search for Optimal Transport
- Blog: Unsupervised Ground Metric Learning with Tree Wasserstein Distance
- Blog: Computing Optimal Assignments in Linear Time for Approximate Graph Matching
- Blog: Computationally Efficient Wasserstein Loss for Structured Labels
- Blog: The Phylogenetic Kantorovich–Rubinstein Metric for Environmental Sequence Samples
- Blog: Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport
- Blog: Fixed Support Tree-Sliced Wasserstein Barycenter
- Blog: Tree-Sliced Wasserstein Distance with Nonlinear Projection
- Blog: Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy
- Blog: Unbalanced Multi-marginal Optimal Transport
- Blog: Fast unsupervised ground metric learning with tree-Wasserstein distance
- Blog: Tree-Sliced Wasserstein Distance: A Geometric Perspective
- Blog: Entropy Partial Transport with Tree Metrics: Theory and Practice
- Blog: Large-scale similarity search with Optimal Transport
- Blog: Optimal Transport for Probabilistic Circuits
- Blog: Tree-Sliced Variants of Wasserstein Distances
- Blog: Spherical Tree-Sliced Wasserstein Distance
- Blog: Tree-Sliced Entropy Partial Transport
- Blog: Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance
- Blog: Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metrics
- Blog: An Empirical Study of Simplicial Representation Learning with Wasserstein Distance
- Blog: On Efficient Low Distortion Ultrametric Embedding
- Blog: Fast Unbalanced Optimal Transport on Tree
- Blog: Mixed-Curvature Tree-Sliced Wasserstein Distance
- Blog: UltraTWD: Optimizing Ultrametric Trees for Tree-Wasserstein Distance
- Blog: Large-scale similarity search with Optimal Transport
- Blog: Data-Driven Tree Transforms and Metrics
- Blog: Learning Binary Decision Trees by Argmin Differentiation
- Blog: Flow-based Alignment Approaches for Probability Measures in Different Spaces
- Blog: Supervised Tree-Wasserstein Distance
- Blog: EmbAssi: embedding assignment costs for similarity search in large graph databases
- Blog: A linear time approximation of Wasserstein distance with word embedding selection
- Blog: Tree-Sliced Approximation of Wasserstein Distances
- Blog: Tree-sliced Sobolev IPM
- Blog: Scalable Unbalanced Sobolev Transport for Measures on a Graph
- Blog: Estimating Latent Population Flows from Aggregated Data via Inversing Multi-Marginal Optimal Transport
- Blog: Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport
- Blog: On the complexity of the optimal transport problem with graph-structured cost
- Blog: Efficient and Exact Multimarginal Optimal Transport with Pairwise Costs
- Blog: Scalable Nearest Neighbor Search for Optimal Transport
- Blog: Real-Time Salient Object Detection with a Minimum Spanning Tree
- Blog: Computationally Efficient Wasserstein Loss for Structured Labels
- Blog: A Principal Component Analysis for Trees
- Blog: Wasserstein Graph Distance Based on L1-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees
- Blog: Distance-Based Tree-Sliced Wasserstein Distance
- Blog: Data-driven memory-dependent abstractions of dynamical systems via a Cantor-Kantorovich metric
- Blog: Fast Unbalanced Optimal Transport on a Tree
- Blog: On Scalable Variant of Wasserstein Barycenter
- Blog: Efficient Algorithms for Robust and Partial Semi-Discrete Optimal Transport
- Blog: Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy
- Blog: Metric Learning for Ordered Labeled Trees with pq-grams
- Blog: Tree-Sliced Wasserstein Distance on a System of Lines
- Blog: Approximating 1-Wasserstein Distance with Trees
- Blog: Joint Hierarchical Representation Learning of Samples and Features via Informed Tree-Wasserstein Distance
History & citation
Current · Permanent link
- Tree-Sliced Optimal Transport for Geometric Data Analysis merged into this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_tree_based_optimal_transport_approximati_8ed3fc67,
title = {tree-based optimal transport approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tree-based-optimal-transport-approximation/rdr_8ed3fc679f09492dbe316b647886bf6a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_tree_based_optimal_transport_approximati_8ed3fc67_v2,
title = {tree-based optimal transport approximation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tree-based-optimal-transport-approximation/rdr_8ed3fc679f09492dbe316b647886bf6a/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}