{"total":53,"rows":[{"id":"2305.18455","title":"Diff-Instruct: A Universal Approach for Transferring Knowledge From Pre-trained Diffusion Models","created":"2023-05-29","cited_by_count":236,"area":"diffusion"},{"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":"2211.08775","title":"Unbalanced Optimal Transport, from Theory to Numerics","created":"2022-11-16","cited_by_count":46,"area":null},{"id":"2106.01963","title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","created":"2021-06-03","cited_by_count":35,"area":null},{"id":"2109.15025","title":"3D Pose Transfer with Correspondence Learning and Mesh Refinement","created":"2021-09-30","cited_by_count":30,"area":null},{"id":"2205.14814","title":"Your Contrastive Learning Is Secretly Doing Stochastic Neighbor Embedding","created":"2022-05-30","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":"2211.10278","title":"Unsupervised 3D Pose Transfer with Cross Consistency and Dual Reconstruction","created":"2022-11-18","cited_by_count":21,"area":null},{"id":"2104.02013","title":"Quantized Gromov-Wasserstein","created":"2021-04-05","cited_by_count":19,"area":null},{"id":"2202.10723","title":"Sobolev Transport: A Scalable Metric for Probability Measures with Graph Metrics","created":"2022-02-22","cited_by_count":18,"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":"2301.12721","title":"Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport","created":"2023-01-30","cited_by_count":15,"area":null},{"id":"2101.09756","title":"Entropy Partial Transport with Tree Metrics: Theory and Practice","created":"2021-01-24","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":"2205.10738","title":"OTAdapt: Optimal Transport-based Approach For Unsupervised Domain Adaptation","created":"2022-05-22","cited_by_count":12,"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":"2303.06595","title":"A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data","created":"2023-03-12","cited_by_count":11,"area":null},{"id":"2302.12498","title":"Scalable Unbalanced Sobolev Transport for Measures on a Graph","created":"2023-02-24","cited_by_count":10,"area":null},{"id":"2312.14572","title":"Semidefinite Relaxations of the Gromov-Wasserstein Distance","created":"2023-12-22","cited_by_count":10,"area":null},{"id":"2310.13653","title":"Optimal Transport for Measures with Noisy Tree Metric","created":"2023-10-20","cited_by_count":7,"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":"2302.04610","title":"Outlier-Robust Gromov-Wasserstein for Graph Data","created":"2023-02-09","cited_by_count":6,"area":null},{"id":"2501.09876","title":"Geometry-Preserving Encoder/Decoder in Latent Generative Models","created":"2025-01-16","cited_by_count":6,"area":"diffusion"},{"id":"2102.07115","title":"Sliced Multi-Marginal Optimal Transport","created":"2021-02-14","cited_by_count":5,"area":null},{"id":"2111.11328","title":"Cycle Consistent Probability Divergences Across Different Spaces","created":"2021-11-22","cited_by_count":5,"area":null},{"id":"2301.11447","title":"Personalised Federated Learning On Heterogeneous Feature Spaces","created":"2023-01-26","cited_by_count":5,"area":null},{"id":"2310.11256","title":"Gromov-Wasserstein-like Distances in the Gaussian Mixture Models Space","created":"2023-10-17","cited_by_count":4,"area":null},{"id":"2203.08149","title":"MoReL: Multi-omics Relational Learning","created":"2022-03-15","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":"2304.07199","title":"CROVIA: Seeing Drone Scenes from Car Perspective via Cross-View Adaptation","created":"2023-04-14","cited_by_count":3,"area":null},{"id":"2311.01375","title":"Monotone Generative Modeling via a Gromov-Monge Embedding","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2404.11868","title":"OTCXR: Rethinking Self-supervised Alignment using Optimal Transport for Chest X-ray Analysis","created":"2024-04-18","cited_by_count":3,"area":null},{"id":"2101.03196","title":"Sketching Merge Trees for Scientific Data Visualization","created":"2021-01-08","cited_by_count":2,"area":null},{"id":"2112.01806","title":"Music-to-Dance Generation with Optimal Transport","created":"2021-12-03","cited_by_count":2,"area":null},{"id":"2305.07500","title":"Learning representations that are closed-form Monge mapping optimal with application to domain adaptation","created":"2023-05-12","cited_by_count":2,"area":null},{"id":"2306.00785","title":"Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Are","created":"2023-06-01","cited_by_count":2,"area":null},{"id":"2404.08970","title":"Fast Gradient Computation for Gromov-Wasserstein Distance","created":"2024-04-13","cited_by_count":2,"area":null},{"id":"2407.10495","title":"Improving Hyperbolic Representations via Gromov-Wasserstein Regularization","created":"2024-07-15","cited_by_count":2,"area":null},{"id":"2106.02542","title":"Heterogeneous Wasserstein Discrepancy for Incomparable Distributions","created":"2021-06-04","cited_by_count":1,"area":null},{"id":"2205.08115","title":"Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data","created":"2022-05-17","cited_by_count":1,"area":null},{"id":"2209.00232","title":"Hybrid Gromov-Wasserstein Embedding for Capsule Learning","created":"2022-09-01","cited_by_count":1,"area":null},{"id":"2307.10093","title":"Revisiting invariances and introducing priors in Gromov-Wasserstein distances","created":"2023-07-19","cited_by_count":1,"area":null},{"id":"2312.12641","title":"Robust Point Matching with Distance Profiles","created":"2023-12-19","cited_by_count":1,"area":null},{"id":"2506.21507","title":"Robust Alignment via Partial Gromov-Wasserstein Distances","created":"2025-06-26","cited_by_count":1,"area":null},{"id":"2407.14957","title":"Strongly Isomorphic Neural Optimal Transport Across Incomparable Spaces","created":"2024-07-20","cited_by_count":0,"area":null},{"id":"2408.06525","title":"Note on computational complexity of the Gromov-Wasserstein distance","created":"2024-08-12","cited_by_count":0,"area":null},{"id":"2507.13194","title":"Relation-Aware Slicing in Cross-Domain Alignment","created":"2025-07-17","cited_by_count":0,"area":null},{"id":"2509.04089","title":"Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2601.13417","title":"SGW-GAN: Sliced Gromov-Wasserstein Guided GANs for Retinal Fundus Image Enhancement","created":"2026-01-19","cited_by_count":0,"area":null},{"id":"2607.16178","title":"Cluster-Aware Matching via Laplacian Optimal Transport","created":"2026-07-17","cited_by_count":0,"area":null},{"id":"2609.31848","title":"Averaged Mirror Descent and Dual Gradient Methods: Convergent Algorithms for Entropic Gromov-Wasserstein Problems","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.40047","title":"Gromov-Wasserstein Distillation for Inductive Multi-View Embedding","created":"2026-09-30","cited_by_count":0,"area":"distill"}],"next_cursor":null}