{"list":"other","total":51,"rows":[{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"1904.09675","title":"BERTScore: Evaluating Text Generation with BERT","created":"2019-04-21","cited_by_count":5512},{"id":"2004.04906","title":"Dense Passage Retrieval for Open-Domain Question Answering","created":"2020-04-10","cited_by_count":3824},{"id":"1306.0895","title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","created":"2013-06-04","cited_by_count":2316},{"id":"2004.12832","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","created":"2020-04-27","cited_by_count":1178},{"id":"1909.02622","title":"MoverScore: Text Generation Evaluating with Contextualized Embeddings and Earth Mover Distance","created":"2019-09-05","cited_by_count":418},{"id":"2010.08191","title":"RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering","created":"2020-10-16","cited_by_count":413},{"id":"1706.00292","title":"Learning Generative Models with Sinkhorn Divergences","created":"2017-06-01","cited_by_count":314},{"id":"1912.09893","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","created":"2019-12-20","cited_by_count":244},{"id":"1902.00434","title":"Generalized Sliced Wasserstein Distances","created":"2019-02-01","cited_by_count":208},{"id":"1605.08527","title":"Stochastic Optimization for Large-scale Optimal Transport","created":"2016-05-27","cited_by_count":189},{"id":"2101.08231","title":"Word Alignment by Fine-tuning Embeddings on Parallel Corpora","created":"2021-01-20","cited_by_count":186},{"id":"1907.06902","title":"Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches","created":"2019-07-16","cited_by_count":185},{"id":"1803.05573","title":"Improving GANs Using Optimal Transport","created":"2018-03-15","cited_by_count":123},{"id":"1805.11222","title":"Unsupervised Alignment of Embeddings with Wasserstein Procrustes","created":"2018-05-29","cited_by_count":97},{"id":"1901.08949","title":"Subspace Robust Wasserstein Distances","created":"2019-01-25","cited_by_count":90},{"id":"2005.03724","title":"SUPERT: Towards New Frontiers in Unsupervised Evaluation Metrics for Multi-Document Summarization","created":"2020-05-07","cited_by_count":69},{"id":"1511.03198","title":"Sliced Wasserstein Kernels for Probability Distributions","created":"2015-11-10","cited_by_count":65},{"id":"1908.04942","title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","created":"2019-08-14","cited_by_count":57},{"id":"1902.00342","title":"Tree-Sliced Variants of Wasserstein Distances","created":"2019-02-01","cited_by_count":54},{"id":"1805.09843","title":"Baseline Needs More Love: On Simple Word-Embedding-Based Models and Associated Pooling Mechanisms","created":"2018-05-24","cited_by_count":53},{"id":"1906.10827","title":"Hierarchical Optimal Transport for Document Representation","created":"2019-06-26","cited_by_count":53},{"id":"1612.07600","title":"Re-evaluating Automatic Metrics for Image Captioning","created":"2016-12-22","cited_by_count":45},{"id":"2006.07458","title":"Projection Robust Wasserstein Distance and Riemannian Optimization","created":"2020-06-12","cited_by_count":45},{"id":"2005.01196","title":"On the Limitations of Cross-lingual Encoders as Exposed by Reference-Free Machine Translation Evaluation","created":"2020-05-03","cited_by_count":36},{"id":"1812.00151","title":"Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification","created":"2018-12-01","cited_by_count":35},{"id":"1901.06283","title":"Improving Sequence-to-Sequence Learning via Optimal Transport","created":"2019-01-18","cited_by_count":33},{"id":"2004.15003","title":"Word Rotator's Distance","created":"2020-04-30","cited_by_count":32},{"id":"1712.06199","title":"Structured Optimal Transport","created":"2017-12-17","cited_by_count":31},{"id":"2012.05199","title":"A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance","created":"2020-12-09","cited_by_count":27},{"id":"1811.01713","title":"Word Mover's Embedding: From Word2Vec to Document Embedding","created":"2018-10-30","cited_by_count":26},{"id":"1910.04126","title":"Scalable Nearest Neighbor Search for Optimal Transport","created":"2019-10-09","cited_by_count":25},{"id":"1908.06267","title":"Message Passing Attention Networks for Document Understanding","created":"2019-08-17","cited_by_count":23},{"id":"1904.01962","title":"Rep the Set: Neural Networks for Learning Set Representations","created":"2019-04-03","cited_by_count":22},{"id":"1805.07594","title":"Generalizing Point Embeddings using the Wasserstein Space of Elliptical Distributions","created":"2018-05-19","cited_by_count":20},{"id":"1809.04705","title":"Distilled Wasserstein Learning for Word Embedding and Topic Modeling","created":"2018-09-12","cited_by_count":18},{"id":"2002.01615","title":"Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces","created":"2020-02-05","cited_by_count":17},{"id":"2006.02703","title":"Fast Unbalanced Optimal Transport on a Tree","created":"2020-06-04","cited_by_count":16},{"id":"1905.03329","title":"Learning Embeddings into Entropic Wasserstein Spaces","created":"2019-05-08","cited_by_count":15},{"id":"1808.09663","title":"Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representations","created":"2018-08-29","cited_by_count":11},{"id":"2101.11520","title":"Supervised Tree-Wasserstein Distance","created":"2021-01-27","cited_by_count":10},{"id":"2010.05994","title":"Improving Text Generation with Student-Forcing Optimal Transport","created":"2020-10-12","cited_by_count":8},{"id":"1705.10900","title":"Does the Geometry of Word Embeddings Help Document Classification? A Case Study on Persistent Homology Based Representations","created":"2017-05-31","cited_by_count":6},{"id":"1912.00509","title":"Speeding up Word Mover's Distance and its variants via properties of distances between embeddings","created":"2019-12-01","cited_by_count":5},{"id":"2005.01182","title":"A Study of Performance of Optimal Transport","created":"2020-05-03","cited_by_count":5},{"id":"1808.07016","title":"Gaussian Word Embedding with a Wasserstein Distance Loss","created":"2018-08-21","cited_by_count":4},{"id":"2005.09069","title":"P-SIF: Document Embeddings Using Partition Averaging","created":"2020-05-18","cited_by_count":4},{"id":"2005.12123","title":"Feature Robust Optimal Transport for High-dimensional Data","created":"2020-05-25","cited_by_count":4},{"id":"1703.02570","title":"Regularising Non-linear Models Using Feature Side-information","created":"2017-03-07","cited_by_count":3},{"id":"1804.03782","title":"CoT: Cooperative Training for Generative Modeling of Discrete Data","created":"2018-04-11","cited_by_count":3},{"id":"2001.06944","title":"Nested-Wasserstein Self-Imitation Learning for Sequence Generation","created":"2020-01-20","cited_by_count":3}],"next_cursor":null}