{"total":213,"rows":[{"id":"2109.12004","title":"Entropic estimation of optimal transport maps","created":"2021-09-24","cited_by_count":90,"area":null},{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67,"area":null},{"id":"2101.01792","title":"Minibatch optimal transport distances; analysis and applications","created":"2021-01-05","cited_by_count":65,"area":null},{"id":"2106.01128","title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","created":"2021-06-02","cited_by_count":61,"area":null},{"id":"2102.07850","title":"Differentiable Particle Filtering via Entropy-Regularized Optimal Transport","created":"2021-02-15","cited_by_count":59,"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":"2210.01906","title":"Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks","created":"2022-10-04","cited_by_count":41,"area":null},{"id":"2106.03812","title":"Neural Monge Map estimation and its applications","created":"2021-06-07","cited_by_count":40,"area":null},{"id":"2106.01098","title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","created":"2021-06-02","cited_by_count":39,"area":null},{"id":"2109.11926","title":"Sinkhorn Distributionally Robust Optimization","created":"2021-09-24","cited_by_count":38,"area":null},{"id":"2102.08622","title":"Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-Training","created":"2021-02-17","cited_by_count":32,"area":null},{"id":"2106.08502","title":"Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent","created":"2021-06-16","cited_by_count":32,"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":"2206.05262","title":"Meta Optimal Transport","created":"2022-06-10","cited_by_count":28,"area":null},{"id":"2407.05364","title":"PTaRL: Prototype-based Tabular Representation Learning via Space Calibration","created":"2024-07-07","cited_by_count":28,"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":"2305.05080","title":"Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey","created":"2023-05-08","cited_by_count":27,"area":null},{"id":"2202.04235","title":"Towards Compositional Adversarial Robustness: Generalizing Adversarial Training to Composite Semantic Perturbations","created":"2022-02-09","cited_by_count":26,"area":null},{"id":"2204.01188","title":"Revisiting Sliced Wasserstein on Images: From Vectorization to Convolution","created":"2022-04-04","cited_by_count":25,"area":null},{"id":"2208.11726","title":"Wasserstein Task Embedding for Measuring Task Similarities","created":"2022-08-24","cited_by_count":25,"area":null},{"id":"2204.03342","title":"Domain Adaptation for Time-Series Classification to Mitigate Covariate Shift","created":"2022-04-07","cited_by_count":24,"area":null},{"id":"2209.13570","title":"Hierarchical Sliced Wasserstein Distance","created":"2022-09-27","cited_by_count":23,"area":null},{"id":"2202.03813","title":"Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenters","created":"2022-02-08","cited_by_count":22,"area":null},{"id":"2502.03609","title":"Multivariate Conformal Prediction using Optimal Transport","created":"2025-02-05","cited_by_count":22,"area":null},{"id":"2305.04691","title":"Self-supervised Learning for Pre-Training 3D Point Clouds: A Survey","created":"2023-05-08","cited_by_count":21,"area":null},{"id":"2203.10453","title":"Fine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport","created":"2022-03-20","cited_by_count":19,"area":null},{"id":"2203.13417","title":"Amortized Projection Optimization for Sliced Wasserstein Generative Models","created":"2022-03-25","cited_by_count":17,"area":null},{"id":"2102.05912","title":"On Transportation of Mini-batches: A Hierarchical Approach","created":"2021-02-11","cited_by_count":16,"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":"2407.13917","title":"LinSATNet: The Positive Linear Satisfiability Neural Networks","created":"2024-07-18","cited_by_count":16,"area":null},{"id":"2101.04039","title":"Smooth $p$-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applications","created":"2021-01-11","cited_by_count":15,"area":null},{"id":"2307.02402","title":"Unbalanced Optimal Transport: A Unified Framework for Object Detection","created":"2023-07-05","cited_by_count":15,"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":"2406.07475","title":"Partially Observed Trajectory Inference using Optimal Transport and a Dynamics Prior","created":"2024-06-11","cited_by_count":13,"area":null},{"id":"2410.22729","title":"Identifying Drift, Diffusion, and Causal Structure from Temporal Snapshots","created":"2024-10-30","cited_by_count":13,"area":null},{"id":"2510.24574","title":"DistDF: Time-Series Forecasting Needs Joint-Distribution Wasserstein Alignment","created":"2025-10-28","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":"2302.07373","title":"Linearized Wasserstein dimensionality reduction with approximation guarantees","created":"2023-02-14","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":"2403.01781","title":"Integrating Efficient Optimal Transport and Functional Maps For Unsupervised Shape Correspondence Learning","created":"2024-03-04","cited_by_count":12,"area":null},{"id":"2108.08129","title":"Quantitative Uniform Stability of the Iterative Proportional Fitting Procedure","created":"2021-08-18","cited_by_count":11,"area":null},{"id":"2205.13573","title":"Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification","created":"2022-05-26","cited_by_count":11,"area":null},{"id":"2301.03749","title":"Markovian Sliced Wasserstein Distances: Beyond Independent Projections","created":"2023-01-10","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":"2602.03067","title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","created":"2026-02-03","cited_by_count":11,"area":null},{"id":"2102.02992","title":"Learning High Dimensional Wasserstein Geodesics","created":"2021-02-05","cited_by_count":10,"area":null},{"id":"2112.02073","title":"Hierarchical Optimal Transport for Unsupervised Domain Adaptation","created":"2021-12-03","cited_by_count":10,"area":null},{"id":"2406.05061","title":"Progressive Entropic Optimal Transport Solvers","created":"2024-06-07","cited_by_count":10,"area":null},{"id":"2501.18901","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","created":"2025-01-31","cited_by_count":10,"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":"2110.11738","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation","created":"2021-10-22","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":"2411.07154","title":"Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps","created":"2024-11-11","cited_by_count":9,"area":null},{"id":"2102.03390","title":"Projection Robust Wasserstein Barycenters","created":"2021-02-05","cited_by_count":8,"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":"2202.00769","title":"Distributional Reinforcement Learning with Regularized Wasserstein Loss","created":"2022-02-01","cited_by_count":8,"area":null},{"id":"2204.10086","title":"OTExtSum: Extractive Text Summarisation with Optimal Transport","created":"2022-04-21","cited_by_count":8,"area":null},{"id":"2209.12172","title":"Optimal Transport-based Identity Matching for Identity-invariant Facial Expression Recognition","created":"2022-09-25","cited_by_count":8,"area":null},{"id":"2408.11686","title":"Plug-in estimation of Schr\\\"odinger bridges","created":"2024-08-21","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":"2206.11386","title":"Bi-stochastically normalized graph Laplacian: convergence to manifold Laplacian and robustness to outlier noise","created":"2022-06-22","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":"2304.06549","title":"Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach","created":"2023-04-13","cited_by_count":7,"area":null},{"id":"2305.19727","title":"Unbalanced Low-rank Optimal Transport Solvers","created":"2023-05-31","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":"2408.11620","title":"Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing","created":"2024-08-21","cited_by_count":7,"area":null},{"id":"2505.17293","title":"Graph Data Selection for Domain Adaptation: A Model-Free Approach","created":"2025-05-22","cited_by_count":7,"area":null},{"id":"2201.02057","title":"GLAN: A Graph-based Linear Assignment Network","created":"2022-01-05","cited_by_count":6,"area":null},{"id":"2202.04732","title":"Online Learning to Transport via the Minimal Selection Principle","created":"2022-02-09","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":"2204.08324","title":"Hierarchical Optimal Transport for Comparing Histopathology Datasets","created":"2022-04-18","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":"2306.06581","title":"Importance Sparsification for Sinkhorn Algorithm","created":"2023-06-11","cited_by_count":6,"area":null},{"id":"2311.17101","title":"A High-Quality Robust Diffusion Framework for Corrupted Dataset","created":"2023-11-28","cited_by_count":6,"area":null},{"id":"2406.04056","title":"Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently","created":"2024-06-06","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":"2102.06278","title":"Unsupervised Ground Metric Learning using Wasserstein Singular Vectors","created":"2021-02-11","cited_by_count":5,"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":"2307.01770","title":"Fast Optimal Transport through Sliced Wasserstein Generalized Geodesics","created":"2023-07-04","cited_by_count":5,"area":null},{"id":"2307.03043","title":"A Near-Linear Time Algorithm for the Chamfer Distance","created":"2023-07-06","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":"2401.09191","title":"An Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification","created":"2024-01-17","cited_by_count":5,"area":null},{"id":"2502.03749","title":"PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport","created":"2025-02-06","cited_by_count":5,"area":null},{"id":"2105.14337","title":"Optimal transport with $f$-divergence regularization and generalized Sinkhorn algorithm","created":"2021-05-29","cited_by_count":4,"area":null},{"id":"2110.07275","title":"Order Constraints in Optimal Transport","created":"2021-10-14","cited_by_count":4,"area":null},{"id":"2111.06546","title":"Approximating Optimal Transport via Low-rank and Sparse Factorization","created":"2021-11-12","cited_by_count":4,"area":null},{"id":"2212.01938","title":"Hierarchical Policy Blending As Optimal Transport","created":"2022-12-04","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":"2405.15441","title":"Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances","created":"2024-05-24","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}],"next_cursor":"100"}