Research map / Learning theory and algorithms / Optimal transport
Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Schrödinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentres (NeurIPS 2025 · similarity 0.92)
- Generalized Schrödinger Bridge Matching (ICLR 2024 · similarity 0.89)
- Light and Optimal Schrödinger Bridge Matching (ICML 2024 · similarity 0.89)
- Finding Local Diffusion Schrodinger Bridge using Kolmogorov-Arnold Network (CVPR 2025 · similarity 0.88)
- Linear convergence of Sinkhorn's algorithm for generalized static Schrödinger bridge (ICML 2025 · similarity 0.88)
- Go With the Flow: Fast Diffusion for Gaussian Mixture Models (NeurIPS 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.