sinkhorn algorithm

Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective ALT 2026 Extending Mean-Field Variational Inference via Entropic Regularization: Theory and Computation JMLR 2026 PAI at SemEval-2026 Task 3: An LLM and Data Redistribution Adaptation-Based Predictive Strategy for Valence-Arousal Scores SemEval 2026 Hierarchical Refinement: Optimal Transport to Infinity and Beyond ICML 2025 Learning conditional distributions on continuous spaces JMLR 2025 Optimal Flow Transport and its Entropic Regularization: a GPU-friendly Matrix Iterative Algorithm for Flow Balance Satisfaction ICLR 2025 PEARL: Towards Permutation-Resilient LLMs ICLR 2025 Accelerating Sinkhorn algorithm with sparse Newton iterations ICLR 2024 Adaptive Softassign via Hadamard-Equipped Sinkhorn CVPR 2024 An Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification JMLR 2024 Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently NeurIPS 2024 Contrasting Multiple Representations with the Multi-Marginal Matching Gap ICML 2024 Efficient Sketches for Training Data Attribution and Studying the Loss Landscape NeurIPS 2024 Entropic Gromov-Wasserstein Distances: Stability and Algorithms JMLR 2024 Multivariate Stochastic Dominance via Optimal Transport and Applications to Models Benchmarking NeurIPS 2024 On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient Methods AAAI 2024 Optimal Transport with Tempered Exponential Measures AAAI 2024 Safe and Sparse Newton Method for Entropic-Regularized Optimal Transport NeurIPS 2024 Sinkhorn Flow as Mirror Flow: A Continuous-Time Framework for Generalizing the Sinkhorn Algorithm AISTATS 2024 Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models ICML 2023 Doubly Stochastic Graph-based Non-autoregressive Reaction Prediction IJCAI 2023 Importance Sparsification for Sinkhorn Algorithm JMLR 2023 LinSATNet: The Positive Linear Satisfiability Neural Networks ICML 2023 Mirror Sinkhorn: Fast Online Optimization on Transport Polytopes ICML 2023 Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach. COLT 2023