{"list":"other","total":53,"rows":[{"id":"1910.10683","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","created":"2019-10-23","cited_by_count":14599},{"id":"2005.11401","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","created":"2020-05-22","cited_by_count":9297},{"id":"2004.04906","title":"Dense Passage Retrieval for Open-Domain Question Answering","created":"2020-04-10","cited_by_count":3824},{"id":"1705.03551","title":"TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension","created":"2017-05-09","cited_by_count":2955},{"id":"2002.08909","title":"REALM: Retrieval-Augmented Language Model Pre-Training","created":"2020-02-10","cited_by_count":2141},{"id":"1806.09055","title":"DARTS: Differentiable Architecture Search","created":"2018-06-24","cited_by_count":1798},{"id":"1708.04552","title":"Improved Regularization of Convolutional Neural Networks with Cutout","created":"2017-08-15","cited_by_count":1628},{"id":"2007.01282","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","created":"2020-07-02","cited_by_count":1210},{"id":"1707.07012","title":"Learning Transferable Architectures for Scalable Image Recognition","created":"2017-07-21","cited_by_count":1101},{"id":"2007.00808","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","created":"2020-07-01","cited_by_count":849},{"id":"1704.00051","title":"Reading Wikipedia to Answer Open-Domain Questions","created":"2017-03-31","cited_by_count":777},{"id":"1906.00300","title":"Latent Retrieval for Weakly Supervised Open Domain Question Answering","created":"2019-06-01","cited_by_count":695},{"id":"2009.02252","title":"KILT: a Benchmark for Knowledge Intensive Language Tasks","created":"2020-09-04","cited_by_count":573},{"id":"1811.01241","title":"Wizard of Wikipedia: Knowledge-Powered Conversational agents","created":"2018-11-03","cited_by_count":530},{"id":"2004.10645","title":"AmbigQA: Answering Ambiguous Open-domain Questions","created":"2020-04-22","cited_by_count":390},{"id":"2003.06713","title":"Document Ranking with a Pretrained Sequence-to-Sequence Model","created":"2020-03-14","cited_by_count":376},{"id":"2109.05052","title":"Entity-Based Knowledge Conflicts in Question Answering","created":"2021-09-10","cited_by_count":356},{"id":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"id":"1703.00887","title":"How to Escape Saddle Points Efficiently","created":"2017-03-02","cited_by_count":285},{"id":"1810.12890","title":"DropBlock: A regularization method for convolutional networks","created":"2018-10-30","cited_by_count":262},{"id":"1902.07638","title":"Random Search and Reproducibility for Neural Architecture Search","created":"2019-02-20","cited_by_count":254},{"id":"1503.02101","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","created":"2015-03-06","cited_by_count":243},{"id":"1703.01785","title":"Forward and Reverse Gradient-Based Hyperparameter Optimization","created":"2017-03-06","cited_by_count":234},{"id":"1411.4280","title":"Efficient Object Localization Using Convolutional Networks","created":"2014-11-16","cited_by_count":227},{"id":"2012.04584","title":"Distilling Knowledge from Reader to Retriever for Question Answering","created":"2020-12-08","cited_by_count":226},{"id":"2010.07962","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","created":"2020-10-15","cited_by_count":222},{"id":"2005.00181","title":"Sparse, Dense, and Attentional Representations for Text Retrieval","created":"2020-05-01","cited_by_count":214},{"id":"1810.10667","title":"Truncated Back-propagation for Bilevel Optimization","created":"2018-10-25","cited_by_count":190},{"id":"2009.08553","title":"Generation-Augmented Retrieval for Open-domain Question Answering","created":"2020-09-17","cited_by_count":186},{"id":"2006.16218","title":"On the Iteration Complexity of Hypergradient Computation","created":"2020-06-29","cited_by_count":155},{"id":"1902.01718","title":"End-to-End Open-Domain Question Answering with BERTserini","created":"2019-02-05","cited_by_count":152},{"id":"2001.04086","title":"GridMask Data Augmentation","created":"2020-01-13","cited_by_count":123},{"id":"2102.07367","title":"A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum","created":"2021-02-15","cited_by_count":106},{"id":"2106.04692","title":"Provably Faster Algorithms for Bilevel Optimization","created":"2021-06-08","cited_by_count":106},{"id":"2005.11364","title":"Open-Retrieval Conversational Question Answering","created":"2020-05-22","cited_by_count":99},{"id":"2007.00814","title":"Relevance-guided Supervision for OpenQA with ColBERT","created":"2020-07-01","cited_by_count":71},{"id":"1803.05999","title":"Escaping Saddles with Stochastic Gradients","created":"2018-03-15","cited_by_count":66},{"id":"2010.10604","title":"Bayesian Attention Modules","created":"2020-10-20","cited_by_count":51},{"id":"2010.12757","title":"Adding Chit-Chat to Enhance Task-Oriented Dialogues","created":"2020-10-24","cited_by_count":48},{"id":"2106.01494","title":"Knowing More About Questions Can Help: Improving Calibration in Question Answering","created":"2021-06-02","cited_by_count":47},{"id":"2101.00117","title":"Multi-task Retrieval for Knowledge-Intensive Tasks","created":"2021-01-01","cited_by_count":44},{"id":"2112.08688","title":"Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks","created":"2021-12-16","cited_by_count":40},{"id":"2110.07752","title":"Hindsight: Posterior-guided training of retrievers for improved open-ended generation","created":"2021-10-14","cited_by_count":38},{"id":"2109.03502","title":"R2-D2: A Modular Baseline for Open-Domain Question Answering","created":"2021-09-08","cited_by_count":37},{"id":"2107.02153","title":"FaVIQ: FAct Verification from Information-seeking Questions","created":"2021-07-05","cited_by_count":36},{"id":"1905.05920","title":"Hybrid Stochastic Gradient Descent Algorithms for Stochastic Nonconvex Optimization","created":"2019-05-15","cited_by_count":32},{"id":"2103.04181","title":"Contextual Dropout: An Efficient Sample-Dependent Dropout Module","created":"2021-03-06","cited_by_count":26},{"id":"2106.05251","title":"Bayesian Attention Belief Networks","created":"2021-06-09","cited_by_count":25},{"id":"2205.04980","title":"ALLSH: Active Learning Guided by Local Sensitivity and Hardness","created":"2022-05-10","cited_by_count":23},{"id":"2011.07122","title":"Convergence Properties of Stochastic Hypergradients","created":"2020-11-13","cited_by_count":19},{"id":"2110.06393","title":"Attention-guided Generative Models for Extractive Question Answering","created":"2021-10-12","cited_by_count":14},{"id":"2107.03242","title":"Robustifying Multi-hop QA through Pseudo-Evidentiality Training","created":"2021-07-07","cited_by_count":13},{"id":"2201.11679","title":"DropNAS: Grouped Operation Dropout for Differentiable Architecture Search","created":"2022-01-27","cited_by_count":12}],"next_cursor":null}