{"list":"other","total":67,"rows":[{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"1906.08935","title":"Deep Leakage from Gradients","created":"2019-06-21","cited_by_count":1021},{"id":"1905.02175","title":"Adversarial Examples Are Not Bugs, They Are Features","created":"2019-05-06","cited_by_count":953},{"id":"2005.00661","title":"On Faithfulness and Factuality in Abstractive Summarization","created":"2020-05-02","cited_by_count":900},{"id":"1906.03671","title":"Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds","created":"2019-06-09","cited_by_count":610},{"id":"1910.12840","title":"Evaluating the Factual Consistency of Abstractive Text Summarization","created":"2019-10-28","cited_by_count":584},{"id":"2006.05929","title":"Dataset Condensation with Gradient Matching","created":"2020-06-10","cited_by_count":516},{"id":"1312.6184","title":"Do Deep Nets Really Need to be Deep?","created":"2013-12-21","cited_by_count":474},{"id":"1906.08158","title":"BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning","created":"2019-06-19","cited_by_count":432},{"id":"1912.08795","title":"Dreaming to Distill: Data-free Knowledge Transfer via DeepInversion","created":"2019-12-18","cited_by_count":423},{"id":"1801.10198","title":"Generating Wikipedia by Summarizing Long Sequences","created":"2018-01-30","cited_by_count":335},{"id":"2005.03754","title":"FEQA: A Question Answering Evaluation Framework for Faithfulness Assessment in Abstractive Summarization","created":"2020-05-07","cited_by_count":293},{"id":"2102.08259","title":"Dataset Condensation with Differentiable Siamese Augmentation","created":"2021-02-16","cited_by_count":291},{"id":"1411.4357","title":"Sketching as a Tool for Numerical Linear Algebra","created":"2014-11-17","cited_by_count":288},{"id":"2011.00050","title":"Dataset Meta-Learning from Kernel Ridge-Regression","created":"2020-10-30","cited_by_count":230},{"id":"2012.10630","title":"GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learning","created":"2020-12-19","cited_by_count":226},{"id":"2107.13034","title":"Dataset Distillation with Infinitely Wide Convolutional Networks","created":"2021-07-27","cited_by_count":218},{"id":"2112.00059","title":"Evaluating Gradient Inversion Attacks and Defenses in Federated Learning","created":"2021-11-30","cited_by_count":196},{"id":"2006.03875","title":"Coresets via Bilevel Optimization for Continual Learning and Streaming","created":"2020-06-06","cited_by_count":192},{"id":"1808.10792","title":"Bottom-Up Abstractive Summarization","created":"2018-08-31","cited_by_count":177},{"id":"1910.02551","title":"Soft-Label Dataset Distillation and Text Dataset Distillation","created":"2019-10-06","cited_by_count":107},{"id":"1912.07768","title":"Generative Teaching Networks: Accelerating Neural Architecture Search by Learning to Generate Synthetic Training Data","created":"2019-12-17","cited_by_count":104},{"id":"2006.08572","title":"Flexible Dataset Distillation: Learn Labels Instead of Images","created":"2020-06-15","cited_by_count":91},{"id":"2006.15412","title":"Submodular Combinatorial Information Measures with Applications in Machine Learning","created":"2020-06-27","cited_by_count":88},{"id":"1909.03186","title":"On Extractive and Abstractive Neural Document Summarization with Transformer Language Models","created":"2019-09-07","cited_by_count":83},{"id":"2010.04529","title":"What Have We Achieved on Text Summarization?","created":"2020-10-09","cited_by_count":65},{"id":"1901.01151","title":"Learning From Less Data: A Unified Data Subset Selection and Active Learning Framework for Computer Vision","created":"2019-01-03","cited_by_count":64},{"id":"2103.00128","title":"PRISM: A Rich Class of Parameterized Submodular Information Measures for Guided Subset Selection","created":"2021-02-27","cited_by_count":51},{"id":"1508.04874","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","created":"2015-08-20","cited_by_count":50},{"id":"1804.09554","title":"Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization","created":"2018-04-24","cited_by_count":47},{"id":"1805.06266","title":"A Unified Model for Extractive and Abstractive Summarization using Inconsistency Loss","created":"2018-05-16","cited_by_count":47},{"id":"2011.09384","title":"Introduction to Core-sets: an Updated Survey","created":"2020-11-18","cited_by_count":45},{"id":"1707.04960","title":"Query-Focused Video Summarization: Dataset, Evaluation, and A Memory Network Based Approach","created":"2017-07-16","cited_by_count":42},{"id":"1311.2106","title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints","created":"2013-11-08","cited_by_count":41},{"id":"1607.05177","title":"Query-Focused Extractive Video Summarization","created":"2016-07-18","cited_by_count":26},{"id":"1511.00394","title":"Submodular Functions: from Discrete to Continous Domains","created":"2015-11-02","cited_by_count":25},{"id":"1711.02515","title":"Continuous DR-submodular Maximization: Structure and Algorithms","created":"2017-11-04","cited_by_count":24},{"id":"1705.00581","title":"Query-adaptive Video Summarization via Quality-aware Relevance Estimation","created":"2017-05-01","cited_by_count":22},{"id":"1411.0541","title":"Distributed Submodular Maximization","created":"2014-11-03","cited_by_count":20},{"id":"1803.08700","title":"Determinantal Point Processes for Coresets","created":"2018-03-23","cited_by_count":18},{"id":"1408.2051","title":"Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications","created":"2014-08-09","cited_by_count":17},{"id":"1910.08707","title":"Introduction to Coresets: Accurate Coresets","created":"2019-10-19","cited_by_count":17},{"id":"1512.06238","title":"The Limitations of Optimization from Samples","created":"2015-12-19","cited_by_count":13},{"id":"1907.06173","title":"The FAST Algorithm for Submodular Maximization","created":"2019-07-14","cited_by_count":13},{"id":"1311.2110","title":"Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions","created":"2013-11-08","cited_by_count":12},{"id":"1701.08939","title":"Deep Submodular Functions","created":"2017-01-31","cited_by_count":12},{"id":"1909.00171","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","created":"2019-08-31","cited_by_count":11},{"id":"1303.0726","title":"Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover","created":"2013-03-04","cited_by_count":10},{"id":"1507.06616","title":"Robust Monotone Submodular Function Maximization","created":"2015-07-23","cited_by_count":10},{"id":"1508.02157","title":"Deterministic Algorithms for Submodular Maximization Problems","created":"2015-08-10","cited_by_count":10},{"id":"1907.00316","title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints","created":"2019-06-30","cited_by_count":9},{"id":"1506.07329","title":"Polyhedral aspects of Submodularity, Convexity and Concavity","created":"2015-06-24","cited_by_count":8},{"id":"1304.0730","title":"Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees","created":"2013-04-02","cited_by_count":7},{"id":"2010.00439","title":"Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases","created":"2020-10-01","cited_by_count":7},{"id":"1307.3301","title":"Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas","created":"2013-07-12","cited_by_count":6},{"id":"1304.2079","title":"Learning Coverage Functions and Private Release of Marginals","created":"2013-04-08","cited_by_count":5},{"id":"1610.09800","title":"Subquadratic Submodular Function Minimization","created":"2016-10-31","cited_by_count":5},{"id":"2002.09130","title":"A polynomial lower bound on adaptive complexity of submodular maximization","created":"2020-02-21","cited_by_count":4},{"id":"1703.07280","title":"Resilient Monotone Submodular Function Maximization","created":"2017-03-21","cited_by_count":3},{"id":"1304.4948","title":"On the Approximation of Submodular Functions","created":"2013-04-17","cited_by_count":2},{"id":"1407.7269","title":"Faster and Simpler Sketches of Valuation Functions","created":"2014-07-27","cited_by_count":2},{"id":"1504.03391","title":"Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions","created":"2015-04-13","cited_by_count":2},{"id":"1402.0240","title":"Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms","created":"2014-02-02","cited_by_count":1},{"id":"1404.4702","title":"Tight Bounds on $\\ell_1$ Approximation and Learning of Self-Bounding Functions","created":"2014-04-18","cited_by_count":1},{"id":"1502.06531","title":"Scalable Variational Inference in Log-supermodular Models","created":"2015-02-23","cited_by_count":1},{"id":"2102.13343","title":"Are Gross Substitutes a Substitute for Submodular Valuations?","created":"2021-02-26","cited_by_count":1}],"next_cursor":null}