{"total":58,"rows":[{"id":"2111.12702","title":"Density-aware Chamfer Distance as a Comprehensive Metric for Point Cloud Completion","created":"2021-11-24","cited_by_count":112,"area":null},{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67,"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.04014","title":"Point-set Distances for Learning Representations of 3D Point Clouds","created":"2021-02-08","cited_by_count":48,"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":"2102.06857","title":"On Robust Optimal Transport: Computational Complexity and Barycenter Computation","created":"2021-02-13","cited_by_count":27,"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":"2209.13570","title":"Hierarchical Sliced Wasserstein Distance","created":"2022-09-27","cited_by_count":23,"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":"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":"2208.14391","title":"Convergence Rates for Regularized Optimal Transport via Quantization","created":"2022-08-30","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":"2203.00553","title":"Global-Local Regularization Via Distributional Robustness","created":"2022-03-01","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":"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":"2108.07992","title":"On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity","created":"2021-08-18","cited_by_count":8,"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":"2203.00813","title":"An Accelerated Stochastic Variance-Reduced Algorithm for Entropic Wasserstein Barycenters","created":"2022-03-02","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":"2504.02067","title":"A Truncated Newton Method for Optimal Transport","created":"2025-04-02","cited_by_count":6,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","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":"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":"2103.05857","title":"Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal transport","created":"2021-03-10","cited_by_count":3,"area":null},{"id":"2110.15520","title":"On Label Shift in Domain Adaptation via Wasserstein Distance","created":"2021-10-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":"2209.15092","title":"Improving Generative Flow Networks with Path Regularization","created":"2022-09-29","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":"2305.18483","title":"Bringing regularized optimal transport to lightspeed: a splitting method adapted for GPUs","created":"2023-05-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":"2404.13401","title":"Approximate Algorithms For $k$-Sparse Wasserstein Barycenter With Outliers","created":"2024-04-20","cited_by_count":3,"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.10268","title":"Fast Approximation of the Generalized Sliced-Wasserstein Distance","created":"2022-10-19","cited_by_count":1,"area":null},{"id":"2412.15695","title":"Hypergraph clustering using Ricci curvature: an edge transport perspective","created":"2024-12-20","cited_by_count":1,"area":null},{"id":"2505.17666","title":"Proto-FG3D: Prototype-based Interpretable Fine-Grained 3D Shape Classification","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":"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":"2112.06763","title":"A Homotopy Algorithm for Optimal Transport","created":"2021-12-13","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":"2205.14104","title":"Efficient Forecasting of Large Scale Hierarchical Time Series via Multilevel Clustering","created":"2022-05-27","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":"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.14670","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","created":"2025-05-20","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":"2605.00837","title":"Fast Log-Domain Sinkhorn Optimal Transport with Warp-Level GPU Reductions","created":"2026-04-04","cited_by_count":0,"area":null},{"id":"2605.09916","title":"The Observable Wasserstein Distance","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2605.20122","title":"Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation","created":"2026-05-19","cited_by_count":0,"area":null},{"id":"2608.11760","title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","created":"2026-08-12","cited_by_count":0,"area":null},{"id":"2609.40075","title":"Accelerated Algorithm for Sparse Regularized Partial Optimal Transport","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.04490","title":"BARQ: Balanced Codebook Refinement for Low-Bit LLM Quantization","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}