{"total":52,"rows":[{"id":"2306.16156","title":"Recent Advances in Optimal Transport for Machine Learning","created":"2023-06-28","cited_by_count":66,"area":null},{"id":"2203.01570","title":"Representing Mixtures of Word Embeddings with Mixtures of Topic Embeddings","created":"2022-03-03","cited_by_count":36,"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":"2111.08366","title":"Multi-Vector Models with Textual Guidance for Fine-Grained Scientific Document Similarity","created":"2021-11-16","cited_by_count":35,"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":"2208.11726","title":"Wasserstein Task Embedding for Measuring Task Similarities","created":"2022-08-24","cited_by_count":25,"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":"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":"2105.07623","title":"Sentence Similarity Based on Contexts","created":"2021-05-17","cited_by_count":12,"area":null},{"id":"2101.11520","title":"Supervised Tree-Wasserstein Distance","created":"2021-01-27","cited_by_count":10,"area":null},{"id":"2105.14403","title":"Re-evaluating Word Mover's Distance","created":"2021-05-30","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":"2501.18901","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","created":"2025-01-31","cited_by_count":10,"area":null},{"id":"2205.15059","title":"Hilbert Curve Projection Distance for Distribution Comparison","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2503.03025","title":"Hierarchical Refinement: Optimal Transport to Infinity and Beyond","created":"2025-03-04","cited_by_count":9,"area":null},{"id":"2204.10086","title":"OTExtSum: Extractive Text Summarisation with Optimal Transport","created":"2022-04-21","cited_by_count":8,"area":null},{"id":"2201.12933","title":"Riemannian block SPD coupling manifold and its application to optimal transport","created":"2022-01-30","cited_by_count":7,"area":null},{"id":"2405.03664","title":"A New Robust Partial $p$-Wasserstein-Based Metric for Comparing Distributions","created":"2024-05-06","cited_by_count":7,"area":null},{"id":"2204.08324","title":"Hierarchical Optimal Transport for Comparing Histopathology Datasets","created":"2022-04-18","cited_by_count":6,"area":null},{"id":"2501.05635","title":"Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport","created":"2025-01-10","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":"2410.21107","title":"Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchy","created":"2024-10-28","cited_by_count":5,"area":null},{"id":"2509.22138","title":"Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport","created":"2025-09-26","cited_by_count":5,"area":null},{"id":"2110.07275","title":"Order Constraints in Optimal Transport","created":"2021-10-14","cited_by_count":4,"area":null},{"id":"2408.13648","title":"Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance","created":"2024-08-24","cited_by_count":4,"area":null},{"id":"2511.19741","title":"Efficient Transferable Optimal Transport via Min-Sliced Transport Plans","created":"2025-11-24","cited_by_count":4,"area":null},{"id":"2211.11424","title":"Modeling Hierarchical Structural Distance for Unsupervised Domain Adaptation","created":"2022-11-21","cited_by_count":3,"area":null},{"id":"2308.15005","title":"Few-Shot Object Detection via Synthetic Features with Optimal Transport","created":"2023-08-29","cited_by_count":3,"area":null},{"id":"2111.01023","title":"Interpretable contrastive word mover's embedding","created":"2021-11-01","cited_by_count":2,"area":null},{"id":"2409.06997","title":"What is the Right Notion of Distance between Predict-then-Optimize Tasks?","created":"2024-09-11","cited_by_count":2,"area":null},{"id":"2602.01427","title":"Robust Generalization with Adaptive Optimal Transport Priors for Decision-Focused Learning","created":"2026-02-01","cited_by_count":2,"area":null},{"id":"2107.13494","title":"Limit Distribution Theory for the Smooth 1-Wasserstein Distance with Applications","created":"2021-07-28","cited_by_count":1,"area":null},{"id":"2210.13630","title":"Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport","created":"2022-10-24","cited_by_count":1,"area":null},{"id":"2303.13102","title":"Keypoint-Guided Optimal Transport: Models, Algorithms, and Applications","created":"2023-03-23","cited_by_count":1,"area":null},{"id":"2307.12564","title":"Towards Generalising Neural Topical Representations","created":"2023-07-24","cited_by_count":1,"area":null},{"id":"2310.15298","title":"TaskDiff: A Similarity Metric for Task-Oriented Conversations","created":"2023-10-23","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":"2502.00737","title":"Scalable Sobolev IPM for Probability Measures on a Graph","created":"2025-02-02","cited_by_count":1,"area":null},{"id":"2604.16220","title":"OT on the Map: Quantifying Domain Shifts in Geographic Space","created":"2026-04-17","cited_by_count":1,"area":null},{"id":"2102.02741","title":"Hawkes Processes on Graphons","created":"2021-02-04","cited_by_count":0,"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":"2201.02846","title":"Coherence-Based Distributed Document Representation Learning for Scientific Documents","created":"2022-01-08","cited_by_count":0,"area":null},{"id":"2304.12814","title":"A Novel Dual of Shannon Information and Weighting Scheme","created":"2023-04-25","cited_by_count":0,"area":null},{"id":"2502.18292","title":"How Vital is the Jurisprudential Relevance: Law Article Intervened Legal Case Retrieval and Matching","created":"2025-02-25","cited_by_count":0,"area":null},{"id":"2510.25591","title":"Generalized Sobolev IPM for Graph-Based Measures","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2601.12423","title":"HOT-POT: Optimal Transport for Sparse Stereo Matching","created":"2026-01-18","cited_by_count":0,"area":null},{"id":"2602.05419","title":"Grammatical Error Correction Evaluation by Optimally Transporting Edit Representation","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2602.06810","title":"Calibrating Tabular Anomaly Detection via Optimal Transport","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2605.11742","title":"Online Continual Learning with Dynamic Label Hierarchies","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2605.23028","title":"RADAR: Relative Angular Divergence Across Representations","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2607.04563","title":"Fidelity-Diversity Metrics for Text","created":"2026-07-06","cited_by_count":0,"area":null},{"id":"2609.30974","title":"Coupled Usage-Sense Processes: Temporal and Attributable Lexical Semantic Change","created":"2026-09-25","cited_by_count":0,"area":null}],"next_cursor":null}