Fast unsupervised ground metric learning with tree-Wasserstein distance

arXiv:2411.07432 · cs.LG · Submitted 2024-11-11 · Read on arXiv

cs.LG

Submitted: 2024-11-11

Updated: 2025-01-10

Terminology

• Clustering — 2× in this paper · explained in 2 episodes
• Wasserstein Distance — 2× in this paper · explained in 4 episodes
• Optimal Transport — 1× in this paper · explained in 5 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks