{"total":20,"rows":[{"id":"2101.01100","title":"Wasserstein barycenters are NP-hard to compute","created":"2021-01-04","cited_by_count":28,"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":"2210.06671","title":"Wasserstein Barycenter-based Model Fusion and Linear Mode Connectivity of Neural Networks","created":"2022-10-13","cited_by_count":15,"area":null},{"id":"2402.03828","title":"Estimating Barycenters of Distributions with Neural Optimal Transport","created":"2024-02-06","cited_by_count":14,"area":null},{"id":"2110.08991","title":"Dimensionality Reduction for Wasserstein Barycenter","created":"2021-10-18","cited_by_count":13,"area":null},{"id":"2303.11844","title":"Doubly Regularized Entropic Wasserstein Barycenters","created":"2023-03-21","cited_by_count":10,"area":null},{"id":"2110.11707","title":"Variational Wasserstein Barycenters with c-Cyclical Monotonicity","created":"2021-10-22","cited_by_count":7,"area":null},{"id":"2405.04034","title":"Differentially Private Post-Processing for Fair Regression","created":"2024-05-07","cited_by_count":5,"area":null},{"id":"2207.14727","title":"Tangential Wasserstein Projections","created":"2022-07-29","cited_by_count":4,"area":null},{"id":"2101.09225","title":"Continual Learning of Generative Models with Limited Data: From Wasserstein-1 Barycenter to Adaptive Coalescence","created":"2021-01-22","cited_by_count":2,"area":null},{"id":"2110.01955","title":"Distribution Mismatch Correction for Improved Robustness in Deep Neural Networks","created":"2021-10-05","cited_by_count":2,"area":null},{"id":"2409.00553","title":"Multi-Output Distributional Fairness via Post-Processing","created":"2024-08-31","cited_by_count":2,"area":null},{"id":"2509.24920","title":"A Spectral-Grassmann Wasserstein metric for operator representations of dynamical systems","created":"2025-09-29","cited_by_count":2,"area":null},{"id":"2401.13913","title":"Spectral Clustering for Discrete Distributions","created":"2024-01-25","cited_by_count":1,"area":null},{"id":"2411.01115","title":"Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems","created":"2024-11-02","cited_by_count":1,"area":null},{"id":"2202.00954","title":"Approximative Algorithms for Multi-Marginal Optimal Transport and Free-Support Wasserstein Barycenters","created":"2022-02-02","cited_by_count":0,"area":null},{"id":"2208.05891","title":"Optimal Transport Features for Morphometric Population Analysis","created":"2022-08-11","cited_by_count":0,"area":null},{"id":"2210.07401","title":"Estimation of the Sample Frechet Mean: A Convolutional Neural Network Approach","created":"2022-10-13","cited_by_count":0,"area":null},{"id":"2411.10204","title":"Fused Gromov-Wasserstein Variance Decomposition with Linear Optimal Transport","created":"2024-11-15","cited_by_count":0,"area":null},{"id":"2609.07974","title":"A Sub-4 Approximation for Fair $k$-Means","created":"2026-09-07","cited_by_count":0,"area":null}],"next_cursor":null}