Fetching the paper…
Reading the bibliography…
In many machine learning applications, it is important to explain the predictions of a black-box classifier.
An analysis of approximations for maximizing submodular set functions–II
Marshall L. Fisher, George L. Nemhauser, and Laurence A. Wolsey · 1978
Earlier work this paper cites.
Best Algorithms for Approximating the Maximum of a Submodular Set Function
George L. Nemhauser and Laurence A. Wolsey · 1978
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions–I
George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher · 1978
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
Michele Conforti and Gérard Cornuéjols · 1984
Earlier work this paper cites.
A Threshold of ln n for Approximating Set Cover
Uriel Feige · 1998
Earlier work this paper cites.
Batch Mode Active Learning and its Application to Medical Image Classification
Steven C. H. Hoi, Rong Jin, Jianke Zhu, and Michael R. Lyu · 2006
Earlier work this paper cites.
Submodular Dictionary Selection for Sparse Representation
Andreas Krause and Volkan Cevher · 2010
Earlier work this paper cites.
Submodularity and curvature: the optimal algorithm
Jan Vondrák · 2010
Earlier work this paper cites.
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Gruia Călinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011
Earlier work this paper cites.
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Abhimanyu Das and David Kempe · 2011
Earlier work this paper cites.
SLIC Superpixels Compared to State-of-the-art Superpixel Methods
Radhakrishna Achanta, Appu Shaji, Kevin Smith, Aurelien Lucchi, Pascal Fua, and Sabine Süsstrunk · 2012
Earlier work this paper cites.
Learning with Submodular Functions: A Convex Optimization Perspective
Francis R. Bach · 2013
Earlier work this paper cites.
Greedy Sparsity-Constrained Optimization
Sohail Bahmani, Bhiksha Raj, and Petros T. Boufounos · 2013
Cited alongside, same era.
UCI machine learning repository, 2013
Moshe Lichman · 2013
Cited alongside, same era.
Distributed Submodular Maximization: Identifying Representative Elements in Massive Data
Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar, and Andreas Krause · 2013
Cited alongside, same era.
Streaming Submodular Maximization: Massive Data Summarization on the Fly
Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Amin Karbasi, and Andreas Krause · 2014
Cited alongside, same era.
Submodular Function Maximization
Andreas Krause and Daniel Golovin · 2014
Cited alongside, same era.
Parallel Double Greedy Submodular Maximization
Xinghao Pan, Stefanie Jegelka, Joseph E. Gonzalez, Joseph K. Bradley, and Michael I. Jordan · 2014
Cited alongside, same era.
Submodularity in Data Subset Selection and Active Learning
Kai Wei, Iyer Rishabh, and Jeff Bilmes · 2015
Later among the works it cites.
Greedy Column Subset Selection: New Bounds and Distributed Algorithms
Jason Altschuler, Aditya Bhaskara, Gang (Thomas) Fu, Vahab Mirrokni, Afshin Rostamizadeh, and Morteza Zadimoghaddam · 2016
Later among the works it cites.
A New Framework for Distributed Submodular Maximization
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, and Justin Ward · 2016
Later among the works it cites.
Maximization of Approximately Submodular Functions
Thibaut Horel and Yaron Singer · 2016
Later among the works it cites.
“Why Should I Trust You?” Explaining the Predictions of Any Classifier
Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin · 2016
Later among the works it cites.
Rethinking the Inception Architecture for Computer Vision
Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jon Shlens, and Zbigniew Wojna · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, and Justin Ward · 2015
Cited alongside, same era.
Online Submodular Maximization with Preemption
Niv Buchbinder, Moran Feldman, and Roy Schwartz · 2015
Cited alongside, same era.
Streaming Algorithms for Submodular Function Maximization
Chandra Chekuri, Shalmoli Gupta, and Kent Quanrud · 2015
Cited alongside, same era.
Lazier Than Lazy Greedy
Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause · 2015
Cited alongside, same era.
Optimal approximation for submodular and supermodular optimization with bounded curvature
Maxim Sviridenko, Jan Vondrák, and Justin Ward · 2015
Cited alongside, same era.
Deterministic Algorithms for Submodular Maximization Problems
Niv Buchbinder and Moran Feldman
Cited in the paper.
Later among the works it cites.
Sparse Nonlinear Regression: Parameter Estimation and Asymptotic Inference
Zhuoran Yang, Zhaoran Wang, Han Liu, Yonina C. Eldar, and Tong Zhang · 2016
Later among the works it cites.
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains
Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann, and Andreas Krause · 2017
Closest in time.
Online Submodular Maximization with Free Disposal: Randomization Beats 1 / 4 \nicefrac{{1}}{{4}} for Partition Matroids
T-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, and Zhihao Gavin Tang · 2017
Closest in time.
Submodular Optimization Under Noise
Avinatan Hassidim and Yaron Singer · 2017
Closest in time.
Axiomatic Attribution for Deep Networks
Mukund Sundararajan, Ankur Taly, and Qiqi Yan · 2017
Closest in time.