{"total":107,"rows":[{"id":"2109.12004","title":"Entropic estimation of optimal transport maps","created":"2021-09-24","cited_by_count":90,"area":null},{"id":"2304.00917","title":"Diffusion Bridge Mixture Transports, Schr\\\"odinger Bridge Problems and Generative Modeling","created":"2023-04-03","cited_by_count":80,"area":null},{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67,"area":null},{"id":"2306.01187","title":"Training neural operators to preserve invariant measures of chaotic attractors","created":"2023-06-01","cited_by_count":46,"area":null},{"id":"2108.09645","title":"Improving Mini-batch Optimal Transport via Partial Transportation","created":"2021-08-22","cited_by_count":41,"area":null},{"id":"2310.18286","title":"Optimal Transport for Treatment Effect Estimation","created":"2023-10-27","cited_by_count":32,"area":null},{"id":"2302.10363","title":"Transformed Distribution Matching for Missing Value Imputation","created":"2023-02-20","cited_by_count":31,"area":null},{"id":"2205.07146","title":"Trajectory Inference via Mean-field Langevin in Path Space","created":"2022-05-14","cited_by_count":30,"area":null},{"id":"2102.06857","title":"On Robust Optimal Transport: Computational Complexity and Barycenter Computation","created":"2021-02-13","cited_by_count":27,"area":null},{"id":"2308.02989","title":"Novel Class Discovery for Long-tailed Recognition","created":"2023-08-06","cited_by_count":19,"area":null},{"id":"2310.01174","title":"Light Schr\\\"odinger Bridge","created":"2023-10-02","cited_by_count":18,"area":null},{"id":"2202.03618","title":"On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Error","created":"2022-02-08","cited_by_count":16,"area":null},{"id":"2303.10100","title":"Unified Mask Embedding and Correspondence Learning for Self-Supervised Video Segmentation","created":"2023-03-17","cited_by_count":16,"area":null},{"id":"2110.00627","title":"On the complexity of the optimal transport problem with graph-structured cost","created":"2021-10-01","cited_by_count":14,"area":null},{"id":"2210.04144","title":"Adaptive Distribution Calibration for Few-Shot Learning with Hierarchical Optimal Transport","created":"2022-10-09","cited_by_count":14,"area":null},{"id":"2103.06263","title":"Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution","created":"2021-03-10","cited_by_count":13,"area":null},{"id":"2108.10961","title":"Entropic Gromov-Wasserstein between Gaussian Distributions","created":"2021-08-24","cited_by_count":12,"area":null},{"id":"2202.02881","title":"Approximate Policy Iteration with Bisimulation Metrics","created":"2022-02-06","cited_by_count":12,"area":null},{"id":"2208.14995","title":"Discovering Conservation Laws using Optimal Transport and Manifold Learning","created":"2022-08-31","cited_by_count":12,"area":null},{"id":"2301.13731","title":"A relaxed proximal gradient descent algorithm for convergent plug-and-play with proximal denoiser","created":"2023-01-31","cited_by_count":12,"area":null},{"id":"2306.13580","title":"Lower Complexity Adaptation for Empirical Entropic Optimal Transport","created":"2023-06-23","cited_by_count":12,"area":null},{"id":"2107.06876","title":"Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More","created":"2021-07-14","cited_by_count":11,"area":null},{"id":"2401.12253","title":"Accelerating Sinkhorn Algorithm with Sparse Newton Iterations","created":"2024-01-20","cited_by_count":11,"area":null},{"id":"2101.11041","title":"Complementary Composite Minimization, Small Gradients in General Norms, and Applications","created":"2021-01-26","cited_by_count":9,"area":null},{"id":"2112.15265","title":"Entropy Regularized Optimal Transport Independence Criterion","created":"2021-12-31","cited_by_count":9,"area":null},{"id":"2205.15059","title":"Hilbert Curve Projection Distance for Distribution Comparison","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2108.07992","title":"On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity","created":"2021-08-18","cited_by_count":8,"area":null},{"id":"2504.02544","title":"Fourier Sliced-Wasserstein Embedding for Multisets and Measures","created":"2025-04-03","cited_by_count":8,"area":null},{"id":"2109.01991","title":"Optimal transport weights for causal inference","created":"2021-09-05","cited_by_count":7,"area":null},{"id":"2301.09675","title":"Improved Rate of First Order Algorithms for Entropic Optimal Transport","created":"2023-01-23","cited_by_count":7,"area":null},{"id":"2307.08507","title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","created":"2023-07-17","cited_by_count":7,"area":null},{"id":"2312.13970","title":"On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient Methods","created":"2023-12-21","cited_by_count":7,"area":null},{"id":"2408.11620","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","created":"2024-08-21","cited_by_count":7,"area":null},{"id":"2409.17500","title":"GLinSAT: The General Linear Satisfiability Neural Network Layer By Accelerated Gradient Descent","created":"2024-09-26","cited_by_count":7,"area":null},{"id":"2203.00554","title":"Neural Score Matching for High-Dimensional Causal Inference","created":"2022-03-01","cited_by_count":6,"area":null},{"id":"2203.00813","title":"An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenters","created":"2022-03-02","cited_by_count":6,"area":null},{"id":"2210.06574","title":"Gaussian Processes on Distributions based on Regularized Optimal Transport","created":"2022-10-12","cited_by_count":6,"area":null},{"id":"2211.10420","title":"Mirror Sinkhorn: Fast Online Optimization on Transport Polytopes","created":"2022-11-18","cited_by_count":6,"area":null},{"id":"2504.02067","title":"A Truncated Newton Method for Optimal Transport","created":"2025-04-02","cited_by_count":6,"area":null},{"id":"2510.21250","title":"Improved Training Technique for Shortcut Models","created":"2025-10-24","cited_by_count":6,"area":null},{"id":"2102.12731","title":"Improving Approximate Optimal Transport Distances using Quantization","created":"2021-02-25","cited_by_count":5,"area":null},{"id":"2110.12678","title":"Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal Transport","created":"2021-10-25","cited_by_count":5,"area":null},{"id":"2112.03152","title":"Bounding Wasserstein distance with couplings","created":"2021-12-06","cited_by_count":5,"area":null},{"id":"2306.06866","title":"Generating Synthetic Datasets by Interpolating along Generalized Geodesics","created":"2023-06-12","cited_by_count":5,"area":null},{"id":"2309.08241","title":"Topological Node2vec: Enhanced Graph Embedding via Persistent Homology","created":"2023-09-15","cited_by_count":5,"area":null},{"id":"2502.01416","title":"Categorical Schr\\\"odinger Bridge Matching","created":"2025-02-03","cited_by_count":5,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2210.02284","title":"Unsupervised Sentence Textual Similarity with Compositional Phrase Semantics","created":"2022-10-05","cited_by_count":4,"area":null},{"id":"2312.01432","title":"Fast Dual Subgradient Optimization of the Integrated Transportation Distance Between Stochastic Kernels","created":"2023-12-03","cited_by_count":4,"area":null},{"id":"2403.00147","title":"Analysis of Kernel Mirror Prox for Measure Optimization","created":"2024-02-29","cited_by_count":4,"area":null},{"id":"2501.06247","title":"A Survey on Algorithmic Developments in Optimal Transport Problem with Applications","created":"2025-01-08","cited_by_count":4,"area":null},{"id":"2503.01140","title":"DDEQs: Distributional Deep Equilibrium Models through Wasserstein Gradient Flows","created":"2025-03-03","cited_by_count":4,"area":null},{"id":"2109.15030","title":"On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport","created":"2021-09-29","cited_by_count":3,"area":null},{"id":"2203.01161","title":"Discrete Optimal Transport with Independent Marginals is #P-Hard","created":"2022-03-02","cited_by_count":3,"area":null},{"id":"2206.05880","title":"Confident Sinkhorn Allocation for Pseudo-Labeling","created":"2022-06-13","cited_by_count":3,"area":null},{"id":"2209.14440","title":"GeONet: a neural operator for learning the Wasserstein geodesic","created":"2022-09-28","cited_by_count":3,"area":null},{"id":"2210.16645","title":"Solving a Special Type of Optimal Transport Problem by a Modified Hungarian Algorithm","created":"2022-10-29","cited_by_count":3,"area":null},{"id":"2403.05054","title":"A Sinkhorn-type Algorithm for Constrained Optimal Transport","created":"2024-03-08","cited_by_count":3,"area":null},{"id":"2403.13864","title":"Optimal Transport for Fairness: Archival Data Repair using Small Research Data Sets","created":"2024-03-20","cited_by_count":3,"area":null},{"id":"2404.13401","title":"Approximate Algorithms For $k$-Sparse Wasserstein Barycenter With Outliers","created":"2024-04-20","cited_by_count":3,"area":null},{"id":"2203.11627","title":"Centered plug-in estimation of Wasserstein distances","created":"2022-03-22","cited_by_count":2,"area":null},{"id":"2301.13006","title":"Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods","created":"2023-01-30","cited_by_count":2,"area":null},{"id":"2306.08233","title":"OT-Net: A Reusable Neural Optimal Transport Solver","created":"2023-06-14","cited_by_count":2,"area":null},{"id":"2502.16152","title":"DUPRE: Data Utility Prediction for Efficient Data Valuation","created":"2025-02-22","cited_by_count":2,"area":null},{"id":"2602.10697","title":"Fast and Large-Scale Unbalanced Optimal Transport via its Semi-Dual and Adaptive Gradient Methods","created":"2026-02-11","cited_by_count":2,"area":null},{"id":"2205.13846","title":"On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance Gaps","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2210.06934","title":"On the potential benefits of entropic regularization for smoothing Wasserstein estimators","created":"2022-10-13","cited_by_count":1,"area":null},{"id":"2311.01984","title":"Optimal Image Transport on Sparse Dictionaries","created":"2023-11-03","cited_by_count":1,"area":null},{"id":"2406.01130","title":"SAVA: Scalable Learning-Agnostic Data Valuation","created":"2024-06-03","cited_by_count":1,"area":null},{"id":"2506.14780","title":"Faster Computation of Entropic Optimal Transport via Stable Low Frequency Modes","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2507.19627","title":"Federated Calculation of the Free-Support Transportation Barycenter by Single-Loop Dual Decomposition","created":"2025-07-25","cited_by_count":1,"area":null},{"id":"2508.08476","title":"Sparse Partial Optimal Transport via Quadratic Regularization","created":"2025-08-11","cited_by_count":1,"area":null},{"id":"2509.10626","title":"Optimal Multimarginal Schr\\\"odinger Bridge: Minimum Spanning Tree over Measure-valued Vertices","created":"2025-09-12","cited_by_count":1,"area":null},{"id":"2510.04579","title":"Busemann Functions in the Wasserstein Space: Existence, Closed-Forms, and Applications to Slicing","created":"2025-10-06","cited_by_count":1,"area":null},{"id":"2602.01372","title":"Robust Sublinear Convergence Rates for Iterative Bregman Projections","created":"2026-02-01","cited_by_count":1,"area":null},{"id":"2104.05802","title":"Efficient Optimal Transport Algorithm by Accelerated Gradient descent","created":"2021-04-12","cited_by_count":0,"area":null},{"id":"2107.11858","title":"Estimation of Stationary Optimal Transport Plans","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2109.12222","title":"Accelerated nonlinear primal-dual hybrid gradient methods with applications to supervised machine learning","created":"2021-09-24","cited_by_count":0,"area":null},{"id":"2112.00838","title":"Convergence of Batch Greenkhorn for Regularized Multimarginal Optimal Transport","created":"2021-12-01","cited_by_count":0,"area":null},{"id":"2205.02938","title":"Immiscible Color Flows in Optimal Transport Networks for Image Classification","created":"2022-05-04","cited_by_count":0,"area":null},{"id":"2209.13803","title":"FedVeca: Federated Vectorized Averaging on Non-IID Data with Adaptive Bi-directional Global Objective","created":"2022-09-28","cited_by_count":0,"area":null},{"id":"2303.17410","title":"Removing supervision in semantic segmentation with local-global matching and area balancing","created":"2023-03-30","cited_by_count":0,"area":null},{"id":"2307.13370","title":"Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterations","created":"2023-07-25","cited_by_count":0,"area":null},{"id":"2310.16123","title":"Anchor Space Optimal Transport as a Fast Solution to Multiple Optimal Transport Problems","created":"2023-10-24","cited_by_count":0,"area":null},{"id":"2311.13147","title":"Optimal Transport with Cyclic Symmetry","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2403.04259","title":"Decentralized and Equitable Optimal Transport","created":"2024-03-07","cited_by_count":0,"area":null},{"id":"2403.16557","title":"Accelerating Federated Learning by Selecting Beneficial Herd of Local Gradients","created":"2024-03-25","cited_by_count":0,"area":null},{"id":"2405.14459","title":"Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularization","created":"2024-05-23","cited_by_count":0,"area":null},{"id":"2405.16519","title":"Fourier Sliced-Wasserstein Embedding for Multisets and Measures","created":"2024-05-26","cited_by_count":0,"area":null},{"id":"2410.02628","title":"Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization","created":"2024-10-03","cited_by_count":0,"area":null},{"id":"2503.13893","title":"A Relaxed Wasserstein Distance Formulation for Mixtures of Radially Contoured Distributions","created":"2025-03-18","cited_by_count":0,"area":null},{"id":"2505.23078","title":"Document-Level Text Generation with Minimum Bayes Risk Decoding using Optimal Transport","created":"2025-05-29","cited_by_count":0,"area":null},{"id":"2506.02757","title":"Investigating Mask-aware Prototype Learning for Tabular Anomaly Detection","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2507.12246","title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","created":"2025-07-16","cited_by_count":0,"area":null},{"id":"2510.27340","title":"Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport","created":"2025-10-31","cited_by_count":0,"area":null},{"id":"2512.05926","title":"BalLOT: Balanced $k$-means clustering with optimal transport","created":"2025-12-05","cited_by_count":0,"area":null},{"id":"2601.17196","title":"Accelerated Sinkhorn Algorithms for Partial Optimal Transport","created":"2026-01-23","cited_by_count":0,"area":null},{"id":"2602.04335","title":"Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2604.26170","title":"EvoSelect: Data-Efficient LLM Evolution for Targeted Task Adaptation","created":"2026-04-28","cited_by_count":0,"area":null},{"id":"2605.00837","title":"Fast Log-Domain Sinkhorn Optimal Transport with Warp-Level GPU Reductions","created":"2026-04-04","cited_by_count":0,"area":null}],"next_cursor":"100"}