Fetching the paper…
Reading the bibliography…
We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions.
An analysis of approximations for maximizing submodular set functions–i
Nemhauser, George L, Wolsey, Laurence A, and Fisher, Marshall L · 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
Conforti, Michele and Cornuéjols, Gérard · 1984
Earlier work this paper cites.
Bayesian experimental design: A review
Chaloner, Kathryn and Verdinelli, Isabella · 1995
Earlier work this paper cites.
Introduction to Linear Optimization
Bertsimas, Dimitris and Tsitsiklis, John · 1997
Earlier work this paper cites.
An introduction to variable and feature selection
Guyon, Isabelle and Elisseeff, André · 2003
Earlier work this paper cites.
Fast sparse gaussian process methods: The informative vector machine
Lawrence, Neil, Seeger, Matthias, and Herbrich, Ralf · 2003
Earlier work this paper cites.
Convex optimization
Boyd, Stephen and Vandenberghe, Lieven · 2004
Earlier work this paper cites.
A submodular-supermodular procedure with applications to discriminative structure learning
Narasimhan, Mukund and Bilmes, Jeff · 2005
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
Candes, Emmanuel J, Romberg, Justin K, and Tao, Terence · 2006
Earlier work this paper cites.
Algorithms for subset selection in linear regression
Das, Abhimanyu and Kempe, David · 2008
Earlier work this paper cites.
Analysis of greedy approximations with nonsubmodular potential functions
Du, Ding-Zhu, Graham, Ronald L, Pardalos, Panos M, Wan, Peng-Jun, Wu, Weili, and Zhao, Wenbo · 2008
Earlier work this paper cites.
Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies
Krause, Andreas, Singh, Ajit, and Guestrin, Carlos · 2008
Earlier work this paper cites.
Optimal approximation for the submodular welfare problem in the value oracle model
Vondrák, Jan · 2008
Cited alongside, same era.
Submodular dictionary selection for sparse representation
Krause, Andreas and Cevher, Volkan · 2010
Cited alongside, same era.
Submodularity and curvature: the optimal algorithm
Vondrák, Jan · 2010
Cited alongside, same era.
Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection
Das, Abhimanyu and Kempe, David · 2011
Cited alongside, same era.
Submodularity beyond submodular energies: coupling edges in graph cuts
Jegelka, Stefanie and Bilmes, Jeff · 2011
Cited alongside, same era.
Algorithms for approximate minimization of the difference between submodular functions, with applications
Iyer, Rishabh and Bilmes, Jeff · 2012
On iterative hard thresholding methods for high-dimensional m-estimation
Jain, Prateek, Tewari, Ambuj, and Kar, Purushottam · 2014
Later among the works it cites.
Submodular function maximization
Krause, Andreas and Golovin, Daniel · 2014
Later among the works it cites.
Optimal budget allocation: Theoretical guarantee and efficient algorithm
Soma, Tasuku, Kakimura, Naonori, Inaba, Kazuhiro, and Kawarabayashi, Ken-ichi · 2014
Later among the works it cites.
On approximate non-submodular minimization via tree-structured supermodularity
Kawahara, Yoshinobu, Iyer, Rishabh K, and Bilmes, Jeff A · 2015
Later among the works it cites.
Optimal approximation for submodular and supermodular optimization with bounded curvature
Sviridenko, Maxim, Vondrák, Jan, and Ward, Justin · 2015
Later among the works it cites.
Greedy column subset selection: New bounds and distributed algorithms
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Determinantal point processes for machine learning
Kulesza, Alex and Taskar, Ben · 2012
Cited alongside, same era.
Learning with submodular functions: A convex optimization perspective
Bach, Francis · 2013
Cited alongside, same era.
Welfare maximization and the supermodular degree
Feige, Uriel and Izsak, Rani · 2013
Cited alongside, same era.
Curvature and optimal algorithms for learning and minimizing submodular functions
Iyer, Rishabh K, Jegelka, Stefanie, and Bilmes, Jeff A · 2013
Cited alongside, same era.
Borodin, Allan, Le, Dai Tri Man, and Ye, Yuli · 2014
Cited alongside, same era.
Submodular maximization with cardinality constraints
Buchbinder, Niv, Feldman, Moran, Naor, Joseph, and Schwartz, Roy · 2014
Cited alongside, same era.
Altschuler, Jason, Bhaskara, Aditya, Fu, Gang, Mirrokni, Vahab, Rostamizadeh, Afshin, and Zadimoghaddam, Morteza · 2016
Later among the works it cites.
Algorithms for optimizing the ratio of submodular functions
Bai, Wenruo, Iyer, Rishabh, Wei, Kai, and Bilmes, Jeff · 2016
Later among the works it cites.
Restricted strong convexity implies weak submodularity
Elenberg, Ethan R, Khanna, Rajiv, Dimakis, Alexandros G, and Negahban, Sahand · 2016
Later among the works it cites.
Maximization of approximately submodular functions
Horel, Thibaut and Singer, Yaron · 2016
Later among the works it cites.
Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
Yoshida, Yuichi · 2016
Later among the works it cites.
Causal meets submodular: Subset selection with directed information
Zhou, Yuxun and Spanos, Costas J · 2016
Later among the works it cites.
Guaranteed non-convex optimization: Submodular maximization over continuous domains
Bian, Andrew An, Mirzasoleiman, Baharan, Buhmann, Joachim M., and Krause, Andreas · 2017
Closest in time.