Fetching the paper…
Reading the bibliography…
In this manuscript, we offer a gentle review of submodularity and supermodularity and their properties.
“Adversarial Examples Are Not Bugs, They Are Features”, 2019
Andrew Ilyas, Shibani Santurkar, Dimitris Tsipras, Logan Engstrom, Brandon Tran and Aleksander Madry · 1905
Earlier work this paper cites.
“BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning”
Andreas Kirsch, Joost van Amersfoort and Yarin Gal · 1906
Earlier work this paper cites.
“Introduction to Coresets: Accurate Coresets”
Ibrahim Jubran, Alaa Maalouf and Dan Feldman · 1910
Earlier work this paper cites.
“On Faithfulness and Factuality in Abstractive Summarization”
Joshua Maynez, Shashi Narayan, Bernd Bohnet and Ryan McDonald · 1919
Earlier work this paper cites.
“Beitrag zur Theorie des Ferromagnetismus”
Ernst Ising · 1925
Earlier work this paper cites.
“Mathematische Grundlagen der Quantenmechanik” English translation by Robert T. Beyer Mathematical Foundations of Quantum Mechanics, Princeton: Princeton University Press, 1955
Johann von Neumann · 1932
Earlier work this paper cites.
“Statistische Quantenmechanik und Thermodynamik”, Deutsche Akademie der Wissenschaften zu Berlin. Physikalisch-Mathematische Klasse. Abhandlungen ; Nr. 1
M. Delbr\:urk and G. Moli\‘ere · 1936
Earlier work this paper cites.
“On Ising’s Model of Ferromagnetism”
RE Peierls · 1936
Earlier work this paper cites.
“Theory of Games and Economic Behavior”
John Von and Oskar Morgenstern · 1944
Earlier work this paper cites.
“Foundations of Economic Analysis”
Paul Samuelson · 1947
Earlier work this paper cites.
“Lattice theory, rev. ed”
G. Birkhoff · 1948
Earlier work this paper cites.
“A mathematical theory of communication”
C.E. Shannon · 1948
Earlier work this paper cites.
“Some generalized order-disorder transformations”
Renfrey Potts · 1952
Earlier work this paper cites.
“Theory of capacities”
Gustave Choquet · 1953
Earlier work this paper cites.
“A Value for n-Person Games”
L.S. Shapley · 1953
Earlier work this paper cites.
“Multivariate information transmission”
William McGill · 1954
Earlier work this paper cites.
“The automatic creation of literature abstracts”
Hans Luhn · 1958
Earlier work this paper cites.
“Mean entropy of states in classical statistical mechanics”
Derek Robinson and David Ruelle · 1967
Earlier work this paper cites.
“An inequality for subadditive functions on a distributive lattice, with application to determinantal inequalities”
Ky Fan · 1968
Earlier work this paper cites.
“New methods in automatic extracting”
Harold Edmundson · 1969
Earlier work this paper cites.
“Matroids, submodular functions, and certain polyhedra”
J. Edmonds · 1970
Earlier work this paper cites.
“Cores of convex games”
L.S. Shapley · 1971
Earlier work this paper cites.
“A greedy algorithm for solving a certain class of linear programmes”
FDJ Dunstan and DJA Welsh · 1973
Earlier work this paper cites.
“Proof of the strong subadditivity of quantum-mechanical entropy”
Elliott Lieb and Mary Ruskai · 1973
Earlier work this paper cites.
“Complementarity: An essay on the 40th anniversary of the Hicks-Allen revolution in demand theory”
Paul Samuelson · 1974
Earlier work this paper cites.
“Finding the nearest point in a polytope”
P. Wolfe · 1976
Earlier work this paper cites.
“An analysis of approximations for maximizing submodular set functions—II”
M.L. Fisher, G.L. Nemhauser and L.A. Wolsey · 1978
Earlier work this paper cites.
“Accelerated greedy algorithms for maximizing submodular set functions” 10.1007/BFb0006528
Michel Minoux · 1978
Earlier work this paper cites.
“An analysis of approximations for maximizing submodular set functions—I”
G.L. Nemhauser, L.A. Wolsey and M.L. Fisher · 1978
Earlier work this paper cites.
“The ellipsoid method and its consequences in combinatorial optimization”
M. Gr\"otschel, L. Lov\’asz and A. Schrijver · 1981
Earlier work this paper cites.
“An analysis of the greedy algorithm for the submodular set covering problem”
Laurence. Wolsey · 1982
Earlier work this paper cites.
“Decomposition of submodular functions”
William Cunningham · 1983
Earlier work this paper cites.
“Submodular functions and convexity”
L\’aszl\’o Lov\’asz · 1983
Earlier work this paper cites.
“Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem”
M. Conforti and G. Cornuejols · 1984
Earlier work this paper cites.
“Probabilistic counting algorithms for data base applications”
Philippe Flajolet and G Martin · 1985
Earlier work this paper cites.
“A non-Shannon-type conditional inequality of information quantities”
Zhen Zhang and Raymond Yeung · 1986
Earlier work this paper cites.
“Pseudomatroids”
R. Chandrasekaran and S.N. Kabadi · 1988
Earlier work this paper cites.
“A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach”
Dorit Hochbaum and David Shmoys · 1988
Earlier work this paper cites.
“Bisubmodular functions”
L. Qi · 1989
Earlier work this paper cites.
“Training connectionist networks with queries and selective sampling”
Les Atlas, David Cohn and Richard Ladner · 1990
Earlier work this paper cites.
“The uncapacited facility location problem”
G.\’ejols G, G.L. G.L. and Wolsey L.A · 1990
Earlier work this paper cites.
“Approximation algorithms for scheduling unrelated parallel machines”
Jan Lenstra, David Shmoys and \’Eva Tardos · 1990
Earlier work this paper cites.
“A new outlook on Shannon’s information measures”
R.. Yeung · 1991
Earlier work this paper cites.
“Computing edge-connectivity of multigraphs and capacitated graphs”
H. Nagamochi and T. Ibaraki · 1992
Earlier work this paper cites.
“APPLICATIONS or SUBMODULAR FUNCTIONS”
Andras Frank · 1993
Earlier work this paper cites.
“Improving generalization with active learning”
David Cohn, Les Atlas and Richard Ladner · 1994
Earlier work this paper cites.
“A Monge property for the d-dimensional transportation problem”
Wolfgang Bein, Peter Brucker, James Park and Pramod Pathak · 1995
Earlier work this paper cites.
“Delta-matroids, jump systems, and bisubmodular polyhedra”
A. Bouchet, W.H. Cunningham, University of. Dept. Combinatorics, Optimization and University of. Faculty Mathematics · 1995
Earlier work this paper cites.
“A characterization of bisubmodular functions”
K. Ando, S. Fujishige and T. Naitoh · 1996
Earlier work this paper cites.
“Perspectives of Monge properties in optimization”
Rainer Burkard, Bettina Klinz and R\"udiger Rudolf · 1996
Earlier work this paper cites.
“Active Learning with Statistical Models”
D. Cohn, Z. Ghahramani and M. Jordan · 1996
Earlier work this paper cites.
“Submodular functions and electrical networks, volume 54 of Annals of Discrete Mathematics”
H. Narayanan · 1997
Earlier work this paper cites.
“A threshold of ln n for approximating set cover”
U. Feige · 1998
Earlier work this paper cites.
“Applications of Relaxed Submodularity” Extra Volume ICM 1998
Andr\’as Frank · 1998
Earlier work this paper cites.
“Image content retrieval from image databases using feature integration by Choquet integral”
Mihail Popescu and Paul. Gader · 1998
Earlier work this paper cites.
“Minimizing symmetric submodular functions”
M. Queyranne · 1998
Earlier work this paper cites.
“Supermodularity and complementarity”
D.M. Topkis · 1998
Earlier work this paper cites.
“On characterization of entropy function via information inequalities”
Zhen Zhang and Raymond Yeung · 1998
Earlier work this paper cites.
“Fast Approximate Energy Minimization via Graph Cuts”
Yuri Boykov, Olga Veksler and Ramin Zabih · 1999
Earlier work this paper cites.
“The decomposition of human-written summary sentences”
Hongyan Jing and Kathleen McKeown · 1999
Earlier work this paper cites.
“Fuzzy measures and integrals: theory and applications”
Michel Grabisch, Michio Sugeno and Toshiaki Murofushi · 2000
Earlier work this paper cites.
“A combinatorial strongly polynomial algorithm for minimizing submodular functions”
S. Iwata, L. Fleischer and S. Fujishige · 2000
Earlier work this paper cites.
“A combinatorial algorithm minimizing submodular functions in strongly polynomial time”
A. Schrijver · 2000
Earlier work this paper cites.
“Discriminatively structured graphical models for speech recognition”
Jeff Bilmes et al · 2001
Earlier work this paper cites.
“An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision”
Yuri Boykov and Vladimir Kolmogorov · 2001
Earlier work this paper cites.
“Fast approximate energy minimization via graph cuts”
Y. Boykov, O. Veksler and R. Zabih · 2001
Earlier work this paper cites.
“Fast Approximate Energy Minimization via Graph Cuts”
Yuri Boykov, Olga Veksler and Ramin Zabih · 2001
Earlier work this paper cites.
“Foundations of mathematical economics”
M. Carter · 2001
Earlier work this paper cites.
“Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond (Adaptive Computation and Machine Learning)”
Bernhard Schlkopf and Alexander Smola · 2001
Earlier work this paper cites.
“Oligopoly pricing: Old ideas and new tools”
X. Vives · 2001
Earlier work this paper cites.
“Approximate clustering via core-sets”
Mihai B\=adoiu, Sariel Har-Peled and Piotr Indyk · 2002
Earlier work this paper cites.
“What energy functions can be minimized via graph cuts?”
V. Kolmogorov and R. Zabih · 2002
Earlier work this paper cites.
“Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond”
B. Schoelkopf and A. Smola · 2002
Earlier work this paper cites.
“Maximizing the spread of influence through a social network”
David Kempe, Jon Kleinberg and \’Eva Tardos · 2003
Earlier work this paper cites.
“Discrete Applied Mathematics: Submodularity” Special Issue, ISSN: 0166-218X, 131(2), ACM, Elsevier Science Publishers B. V., 2003
2003
Earlier work this paper cites.
“An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision”
Y. Boykov and V. Kolmogorov · 2004
Earlier work this paper cites.
“What energy functions can be minimized via graph cuts?”
V. Kolmogorov and R. Zabih · 2004
Earlier work this paper cites.
“ROUGE: A Package for Automatic Evaluation of Summaries”
C.-Y. Lin · 2004
Earlier work this paper cites.
“PAC-learning bounded tree-width Graphical Models”
Mukund Narasimhan and Jeff Bilmes · 2004
Earlier work this paper cites.
“Combinatorial Optimization”
A. Schrijver · 2004
Earlier work this paper cites.
“A note on maximizing a submodular set function subject to a knapsack constraint”
M. Sviridenko · 2004
Earlier work this paper cites.
“On generalized greedy splitting algorithms for multiway partition problems”
Liang Zhao, Hiroshi Nagamochi and Toshihide Ibaraki · 2004
Earlier work this paper cites.
“Geometric approximation via coresets”
Pankaj Agarwal and Sariel Har-Peled · 2005
Earlier work this paper cites.
“Analysis of a greedy active learning strategy”
Sanjoy Dasgupta · 2005
Earlier work this paper cites.
“Submodular functions and optimization”
S. Fujishige · 2005
Earlier work this paper cites.
“Near-optimal sensor placements in Gaussian processes”
Carlos Guestrin, Andreas Krause and Ajit Singh · 2005
Earlier work this paper cites.
“Near-optimal sensor placements in gaussian processes”
Carlos Guestrin, Andreas Krause and Ajit Singh · 2005
Earlier work this paper cites.
“Max-min fair allocation of indivisible goods”
Daniel Golovin · 2005
Earlier work this paper cites.
“Near-optimal Nonmyopic Value of Information in Graphical Models”
Andreas Krause and Carlos Guestrin · 2005
Earlier work this paper cites.
“A Submodular-Supermodular Procedure with Applications to Discriminative Structure Learning”
Mukund Narasimhan and Jeff Bilmes · 2005
Earlier work this paper cites.
“Q-Clustering”
Mukund Narasimhan, Nebojsa Jojic and Jeff Bilmes · 2005
Earlier work this paper cites.
“Q-clustering”
Mukund Narasimhan, Nebojsa Jojic and Jeff Bilmes · 2005
Earlier work this paper cites.
“Sparse Gaussian Processes using Pseudo-inputs”
Edward Snelson and Zoubin Ghahramani · 2005
Earlier work this paper cites.
“Core vector machines: Fast SVM training on very large data sets.”
Ivor Tsang, James Kwok, Pak-Ming Cheung and Nello Cristianini · 2005
Earlier work this paper cites.
“Nonlinear dimensionality reduction by semidefinite programming and kernel matrix factorization”
Kilian. Weinberger, Benjamin. Packer and Lawrence. Saul · 2005
Cited alongside, same era.
“Model compression”
Cristian Buciluǎ, Rich Caruana and Alexandru Niculescu-Mizil · 2006
Cited alongside, same era.
“Batch mode active learning and its application to medical image classification”
S.C.H. Hoi, R. Jin, J. Zhu and M.R. Lyu · 2006
Cited alongside, same era.
“Combinatorial auctions with decreasing marginal utilities”
Benny Lehmann, Daniel Lehmann and Noam Nisan · 2006
Cited alongside, same era.
“Learning Graphical Models over partial k k -trees” https://vannevar.ece.uw.edu/techsite/papers/refer/UWEETR-2006-0001.html , 2006
Mukund Narasimhan and Jeff Bilmes · 2006
Cited alongside, same era.
“Non-additive measures and integrals”
Endre Pap · 2006
“Gaze-enabled egocentric video summarization via constrained submodular maximization”
Jia Xu, Lopamudra Mukherjee, Yin Li, Jamieson Warner, James Rehg and Vikas Singh · 2015
Later among the works it cites.
“Higher-order inference for multi-class log-supermodular models”
Jian Zhang, Josip Djolonga and Andreas Krause · 2015
Later among the works it cites.
“Algorithms for Optimizing the Ratio of Submodular Functions”
Wenruo Bai, Rishabh Iyer, Kai Wei and Jeff Bilmes · 2016
Later among the works it cites.
“Variational inference in mixed probabilistic submodular models”
Josip Djolonga, Sebastian Tschiatschek and Andreas Krause · 2016
Later among the works it cites.
“Optimal bounds on approximation of submodular and XOS functions by juntas”
Vitaly Feldman and Jan Vondr\’ak · 2016
Later among the works it cites.
“Graph cuts with interacting edge weights: examples, approximations, and algorithms”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Maximizing a submodular set function subject to a matroid constraint”
G. Calinescu, C. Chekuri, M. P\’al and J. Vondr\’ak · 2007
Cited alongside, same era.
“Approximation algorithms for the max-min allocation problem”
Subhash Khot and Ashok Ponnuswami · 2007
Cited alongside, same era.
“Convex Clustering with Exemplar-based Models”
Danial Lashkari and Polina Golland · 2007
Cited alongside, same era.
“Local Search for Balanced Submodular Clusterings”
Mukund Narasimhan and Jeff Bilmes · 2007
Cited alongside, same era.
“Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization”
S. Thomas and M.S. Fujishige · 2007
Cited alongside, same era.
“Optimal core-sets for balls”
Mihai Badoiu and Kenneth Clarkson · 2008
Cited alongside, same era.
Stefanie Jegelka and Jeff Bilmes · 2016
Later among the works it cites.
“SVitchboard-II and FiSVer-I: Crafting high quality and low complexity conversational english speech corpora using submodular function optimization”
Yuzong Liu, Rishabh Iyer, Katrin Kirchhoff and Jeff Bilmes · 2016
Later among the works it cites.
“Constrained Robust Submodular Sensor Selection with Applications to Multistatic Sonar Arrays”
Thomas Powers, Jeff Bilmes, David. Krout and Les Atlas · 2016
Later among the works it cites.
“Query-focused extractive video summarization”
Aidean Sharghi, Boqing Gong and Mubarak Shah · 2016
Later among the works it cites.
“Two Visual Pathways in Primates Based on Sampling of Space: Exploitation and Exploration of Visual Information”
Bhavin. Sheth and Ryan Young · 2016
Later among the works it cites.
“Choosing panels of genomics assays using submodular optimization”
Kai Wei, Maxwell. Libbrecht, Jeffrey. Bilmes and William Noble · 2016
Later among the works it cites.
“Submodular goal value of Boolean functions”
Eric Bach, Jérémie Dusart, Lisa Hellerstein and Devorah Kletenik · 2017
Later among the works it cites.
Jeffrey Bilmes and Wenruo Bai · 2017
Later among the works it cites.
“Continuous dr-submodular maximization: Structure and algorithms”
An Bian, Kfir Levy, Andreas Krause and Joachim Buhmann · 2017
Later among the works it cites.
“The Limitations of Optimization from Samples”
Eric Balkanski, Aviad Rubinstein and Yaron Singer · 2017
Later among the works it cites.
“Minimizing a Submodular Function from Samples.”
Eric Balkanski and Yaron Singer · 2017
Later among the works it cites.
“Faster and Simpler Sketches of Valuation Functions”
Keren Cohavi and Shahar Dobzinski · 2017
Later among the works it cites.
“Subquadratic submodular function minimization”
Deeparnab Chakrabarty, Yin Lee, Aaron Sidford and Sam Chiu-wai Wong · 2017
Later among the works it cites.
“Interactive Submodular Bandit.”
Lin Chen, Andreas Krause and Amin Karbasi · 2017
Later among the works it cites.
“Data sketching”
Graham Cormode · 2017
Later among the works it cites.
“Towards abstractive multi-document summarization using submodular function-based framework, sentence compression and merging”
Yllias Chali, Moin Tanvee and Mir Nayeem · 2017
Later among the works it cites.
“Tight Bounds on ℓ 1 \ell_{1} Approximation and Learning of Self-Bounding Functions”
Vitaly Feldman, Pravesh Kothari and Jan Vondr\’ak · 2017
Later among the works it cites.
“A unified approach to interpreting model predictions”
Scott Lundberg and Su-In Lee · 2017
Later among the works it cites.
“A Submodular Approach to Create Individualized Parcellations of the Human Brain”
Mehraveh Salehi, Amin Karbasi, Dustin Scheinost and R. Constable · 2017
Later among the works it cites.
“Query-focused video summarization: Dataset, evaluation, and a memory network based approach”
Aidean Sharghi, Jacob Laurel and Boqing Gong · 2017
Later among the works it cites.
“Resilient monotone submodular function maximization”
Vasileios Tzoumas, Konstantinos Gatsis, Ali Jadbabaie and George Pappas · 2017
Later among the works it cites.
“Query-adaptive video summarization via quality-aware relevance estimation”
Arun Vasudevan, Michael Gygli, Anna Volokitin and Luc Van · 2017
Later among the works it cites.
“Recent advances in document summarization”
Jin-ge Yao, Xiaojun Wan and Jianguo Xiao · 2017
Later among the works it cites.
“Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions” http://proceedings.mlr.press/v80/bai18a.html
Wenruo Bai and Jeff Bilmes · 2018
Later among the works it cites.
“Deterministic algorithms for submodular maximization problems”
Niv Buchbinder and Moran Feldman · 2018
Later among the works it cites.
“Scalable k-means clustering via lightweight coresets”
Olivier Bachem, Mario Lucic and Andreas Krause · 2018
Later among the works it cites.
“The adaptive complexity of maximizing a submodular function”
Eric Balkanski and Yaron Singer · 2018
Later among the works it cites.
“Constrained interacting submodular groupings”
Andrew Cotter, Mahdi Fard, Seungil You, Maya Gupta and Jeff Bilmes · 2018
Later among the works it cites.
“Provable Variational Inference for Constrained Log-Submodular Models”
Josip Djolonga, Stefanie Jegelka and Andreas Krause · 2018
Later among the works it cites.
“Approximate submodularity and its applications: Subset selection, sparse approximation and dictionary selection”
Abhimanyu Das and David Kempe · 2018
Later among the works it cites.
“Bottom-Up Abstractive Summarization”
Sebastian Gehrmann, Yuntian Deng and Alexander Rush · 2018
Later among the works it cites.
“A Unified Model for Extractive and Abstractive Summarization using Inconsistency Loss”
Wan-Ting Hsu, Chieh-Kai Lin, Ming-Ying Lee, Kerui Min, Jing Tang and Min Sun · 2018
Later among the works it cites.
“Choosing non-redundant representative subsets of protein sequence data sets using submodular optimization”
Maxwell. Libbrecht, Jeffrey. Bilmes and William Noble · 2018
Later among the works it cites.
“Generating wikipedia by summarizing long sequences”
Peter Liu et al · 2018
Later among the works it cites.
“Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms”
Alexander Munteanu and Chris Schwiegelshohn · 2018
Later among the works it cites.
“Robust monotone submodular function maximization”
James Orlin, Andreas Schulz and Rajan Udwani · 2018
Later among the works it cites.
“Active Learning for Convolutional Neural Networks: A Core-Set Approach”
Ozan Sener and Silvio Savarese · 2018
Later among the works it cites.
“Active Learning for Convolutional Neural Networks: A Core-Set Approach”
Ozan Sener and Silvio Savarese · 2018
Later among the works it cites.
“Minimax curriculum learning: Machine teaching with desirable difficulties and scheduled diversity”
Tianyi Zhou and Jeff Bilmes · 2018
Later among the works it cites.
“Submodular functions: from discrete to continuous domains”
Francis Bach · 2019
Later among the works it cites.
“Optimal Continuous DR-Submodular Maximization and Applications to Provable Mean Field Inference”
Yatao Bian, Joachim Buhmann and Andreas Krause · 2019
Later among the works it cites.
“A genome-wide framework for mapping gene regulation via cellular genetic screens”
M. Gasperini et al · 2019
Later among the works it cites.
“A Discussion of ’Adversarial Examples Are Not Bugs, They Are Features’: Adversarial Example Researchers Need to Expand What is Meant by ’Robustness”’ https://distill.pub/2019/advex-bugs-discussion/response-1
Justin Gilmer and Dan Hendrycks · 2019
Later among the works it cites.
“Learning from less data: A unified data subset selection and active learning framework for computer vision”
Vishal Kaushal, Rishabh Iyer, Suraj Kothawade, Rohan Mahadev, Khoshrav Doctor and Ganesh Ramakrishnan · 2019
Later among the works it cites.
“Abstractive summarization: A survey of the state of the art”
Hui Lin and Vincent Ng · 2019
Later among the works it cites.
“Multivariate submodular optimization”
Richard Santiago and F Shepherd · 2019
Later among the works it cites.
“Determinantal Point Processes for Coresets.”
Nicolas Tremblay, Simon Barthelm\’e and Pierre-Olivier Amblard · 2019
Later among the works it cites.
“Fixing Mini-batch Sequences with Hierarchical Robust Partitioning”
Shengjie Wang, Wenruo Bai, Chandrashekhar Lavania and Jeff Bilmes · 2019
Later among the works it cites.
“Approximate F 2 F_{2} -Sketching of Valuation Functions”
Grigory Yaroslavtsev and Samson Zhou · 2019
Later among the works it cites.
“Deep Leakage from Gradients”
Ligeng Zhu, Zhijian Liu and Song Han · 2019
Later among the works it cites.
“Near-optimal approximate discrete and continuous submodular function minimization”
Brian Axelrod, Yang Liu and Aaron Sidford · 2020
Later among the works it cites.
“Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds.”
Jordan Ash, Chicheng Zhang, Akshay Krishnamurthy, John Langford and Alekh Agarwal · 2020
Later among the works it cites.
“The FAST algorithm for submodular maximization”
Adam Breuer, Eric Balkanski and Yaron Singer · 2020
Later among the works it cites.
“Coresets via Bilevel Optimization for Continual Learning and Streaming”
Zal\’an Borsos, Mojmir Mutny and Andreas Krause · 2020
Later among the works it cites.
“A lower bound for parallel submodular minimization”
Eric Balkanski and Yaron Singer · 2020
Later among the works it cites.
“Flexible Dataset Distillation: Learn Labels Instead of Images”
Ondrej Bohdal, Yongxin Yang and Timothy Hospedales · 2020
Later among the works it cites.
“Small Summaries for Big Data”
Graham Cormode and Ke Yi · 2020
Later among the works it cites.
“FEQA: A Question Answering Evaluation Framework for Faithfulness Assessment in Abstractive Summarization”
Esin Durmus, He He and Mona Diab · 2020
Later among the works it cites.
“Tight bounds on ℓ 1 \ell_{1} approximation and learning of self-bounding functions”
Vitaly Feldman, Pravesh Kothari and Jan Vondr\’ak · 2020
Later among the works it cites.
“What Have We Achieved on Text Summarization?”
Dandan Huang et al · 2020
Later among the works it cites.
“GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learning”
Krishnateja Killamsetty, Durga Sivasubramanian, Ganesh Ramakrishnan and Rishabh Iyer · 2020
Later among the works it cites.
“Evaluating the Factual Consistency of Abstractive Text Summarization”
Wojciech Kryscinski, Bryan McCann, Caiming Xiong and Richard Socher · 2020
Later among the works it cites.
“A polynomial lower bound on adaptive complexity of submodular maximization”
Wenzheng Li, Paul Liu and Jan Vondr\’ak · 2020
Later among the works it cites.
“Coresets for data-efficient training of machine learning models”
Baharan Mirzasoleiman, Jeff Bilmes and Jure Leskovec · 2020
Later among the works it cites.
“Stochastic conditional gradient methods: From convex minimization to submodular maximization”
Aryan Mokhtari, Hamed Hassani and Amin Karbasi · 2020
Later among the works it cites.
“Dataset Meta-Learning from Kernel Ridge-Regression”
Timothy Nguyen, Zhourong Chen and Jaehoon Lee · 2020
Later among the works it cites.
“On extractive and abstractive neural document summarization with transformer language models”
Jonathan Pilault, Raymond Li, Sandeep Subramanian and Christopher Pal · 2020
Later among the works it cites.
“Online continuous DR-submodular maximization with long-term budget constraints”
Omid Sadeghi and Maryam Fazel · 2020
Later among the works it cites.
“Generative teaching networks: Accelerating neural architecture search by learning to generate synthetic training data”
Felipe Such, Aditya Rawal, Joel Lehman, Kenneth Stanley and Jeffrey Clune · 2020
Later among the works it cites.
Tongzhou Wang, Jun-Yan Zhu, Antonio Torralba and Alexei. Efros · 2020
Later among the works it cites.
“Learning set functions that are sparse in non-orthogonal Fourier bases”
Chris Wendler, Andisheh Amrollahi, Bastian Seifert, Andreas Krause and Markus P\"uschel · 2020
Later among the works it cites.
“Dreaming to Distill: Data-Free Knowledge Transfer via DeepInversion”
Hongxu Yin et al · 2020
Later among the works it cites.
“Are Gross Substitutes a Substitute for Submodular Valuations?”
Shahar Dozinski, Uriel Feige and Michal Feldman · 2021
Later among the works it cites.
“Evaluating Gradient Inversion Attacks and Defenses in Federated Learning”
Yangsibo Huang, Samyak Gupta, Zhao Song, Kai Li and Sanjeev Arora · 2021
Later among the works it cites.
“Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications”
Rishabh Iyer, Ninad Khargonkar, Jeff Bilmes and Himanshu Asnani · 2021
Later among the works it cites.
“Submodular Combinatorial Information Measures with Applications in Machine Learning”
Rishabh Iyer, Ninad Khargonkar, Jeffrey. Bilmes and Himanshu Asnani · 2021
Later among the works it cites.
“Minimizing convex functions with integral minimizers”
Haotian Jiang · 2021
Later among the works it cites.
“EASE: Extractive-Abstractive Summarization End-to-End using the Information Bottleneck Principle”
Haoran Li et al · 2021
Later among the works it cites.
“Dataset Distillation with Infinitely Wide Convolutional Networks”
Timothy Nguyen, Roman Novak, Lechao Xiao and Jaehoon Lee · 2021
Later among the works it cites.
“Soft-Label Dataset Distillation and Text Dataset Distillation”
Ilia Sucholutsky and Matthias Schonlau · 2021
Later among the works it cites.
“CliffsNotes — Wikipedia, The Free Encyclopedia” [Online; accessed 29-December-2021], 2021
Wikipedia contributors · 2021
Later among the works it cites.
“Dataset Condensation with Differentiable Siamese Augmentation”
Bo Zhao and Hakan Bilen · 2021
Later among the works it cites.
“Dataset Condensation with Gradient Matching”
Bo Zhao, Konda Mopuri and Hakan Bilen · 2021
Later among the works it cites.
“PRISM: A Rich Class of Parameterized Submodular Information Measures for Guided Subset Selection”
Suraj Kothawade, Vishal Kaushal, Ganesh Ramakrishnan, Jeff Bilmes and Rishabh Iyer · 2022
Closest in time.
“Distributed Submodular Maximization: Identifying Representative Elements in Massive Data.”
Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar and Andreas Krause · 2057
Closest in time.
“Diverse sequential subset selection for supervised video summarization”
Boqing Gong, Wei-Lun Chao, Kristen Grauman and Fei Sha · 2077
Closest in time.
“Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints”
J. Lee, V.S. Mirrokni, V. Nagarajan and M. Sviridenko · 2078
Closest in time.
Vitaly Feldman and Pravesh Kothari · 2079
Closest in time.