Fetching the paper…
Reading the bibliography…
We connect high-dimensional subset selection and submodular maximization.
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, “An Analysis of Approximations for Maximizing Submodular Set Functions - I,” Mathematical Programming , vol. 14, no. 1, pp. 265–294, 1978
1978
Earlier work this paper cites.
L. Lovász , Submodular Functions and Convexity . Springer Berlin Heidelberg, 1983, pp. 235–257
1983
Earlier work this paper cites.
M. Conforti and G. Cornuéjols, “Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem,” Discrete Applied Mathematics , vol. 7, no. 3, pp. 251–274, March 1984
1984
Earlier work this paper cites.
L. D. Brown, “Fundamentals of Statistical Exponential Families with Applications in Statistical Decision Theory,” Lecture Notes–Monograph Series , vol. 9, 1986
1986
Earlier work this paper cites.
B. K. Natarajan, “Sparse Approximate Solutions to Linear Systems,” SIAM Journal on Computing , vol. 24, no. 2, pp. 227–234, 1995
1995
Earlier work this paper cites.
D. K. Dey, S. K. Ghosh, and B. K. Mallick, Eds., Generalized Linear Models: A Bayesian Perspective , 1st ed. CRC Press, 2000
2000
Earlier work this paper cites.
D. D. Lewis, Y. Yang, T. G. Rose, and F. Li, “RCV1: A New Benchmark Collection for Text Categorization Research,” Journal of Machine Learning Research , vol. 5, pp. 361–397, 2004
2004
Earlier work this paper cites.
S. Fujishige, Submodular Functions and Optimization , ser. Annals of Discrete Mathematics. Elsevier Science, 2005
2005
Earlier work this paper cites.
S. C. H. Hoi, R. Jin, J. Zhu, and M. R. Lyu, “Batch Mode Active Learning and its Application to Medical Image Classification,” in ICML , 2006, pp. 417–424
2006
Earlier work this paper cites.
T. Blumensath and M. E. Davies, “On the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares,” https://eprints.soton.ac.uk/142469/ , 2007
2007
Earlier work this paper cites.
A. R. Barron, A. Cohen, W. Dahmen, and R. A. DeVore, “Approximation and Learning by Greedy Algorithms,” Annals of Statistics , vol. 36, no. 1, pp. 64–94, 2008
2008
Earlier work this paper cites.
S. A. van de Geer, “High-dimensional Generalized Linear Models and the Lasso,” The Annals of Statistics , vol. 36, pp. 614–645, 2008
2008
Earlier work this paper cites.
T. Zhang, “Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models,” NIPS , 2008
2008
Earlier work this paper cites.
D. Needell and J. A. Tropp, “CoSaMP : Iterative Signal Recovery from Incomplete and Inaccurate Samples,” Applied and Computational Harmonic Analysis , vol. 3, no. 26, pp. 301–321, 2009
2009
Earlier work this paper cites.
A. Krause and V. Cevher, “Submodular Dictionary Selection for Sparse Representation,” in ICML , 2010
2010
Earlier work this paper cites.
S. M. Kakade, O. Shamir, K. Sridharan, and A. Tewari, “Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity,” in AISTATS , 2010
2010
Earlier work this paper cites.
G. Raskutti, M. J. Wainwright, and B. Yu, “Restricted Eigenvalue Properties for Correlated Gaussian Designs,” Journal of Machine Learning Research , vol. 11, pp. 2241–2259, 2010
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
A. Das and D. Kempe, “Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection,” in ICML , 2011
2011
Cited alongside, same era.
A. Jalali, C. Johnson, and P. Ravikumar, “On Learning Discrete Graphical Models Using Greedy Methods,” in NIPS , 2011
2011
Cited alongside, same era.
P. Rigollet and A. Tsybakov, “Exponential Screening and Optimal Rates of Sparse Estimation,” Annals of Statistics , vol. 39, no. 2, pp. 731–771, 2011
2011
Cited alongside, same era.
T. Zhang, “Sparse Recovery With Orthogonal Matching Pursuit Under RIP,” IEEE Transactions on Information Theory , vol. 57, no. 9, pp. 6215–6221, September 2011
2011
Cited alongside, same era.
A. C. Lozano, G. Świrszcz, and N. Abe, “Group Orthogonal Matching Pursuit for Logistic Regression,” Journal of Machine Learning Research , vol. 15, pp. 452–460, 2011
2015
Later among the works it cites.
C. Qian, Y. Yu, and Z.-H. Zhou, “Subset Selection by Pareto Optimization,” in NIPS , 2015, pp. 1774–1782
2015
Later among the works it cites.
B. Mirzasoleiman, A. Badanidiyuru, A. Karbasi, J. Vondrák, and A. Krause, “Lazier Than Lazy Greedy.” in AAAI , 2015
2015
Later among the works it cites.
R. Barbosa, A. Ene, H. L. Nguyen, and J. Ward, “The Power of Randomization: Distributed Submodular Maximization on Massive Datasets,” in ICML , 2015, pp. 1236–1244
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
A. Tewari, P. Ravikumar, and I. S. Dhillon, “Greedy Algorithms for Structurally Constrained High Dimensional Problems,” in NIPS , vol. 24, 2011, pp. 1–10
2011
Cited alongside, same era.
S. Negahban, P. Ravikumar, B. Yu, and M. J. Wainwright, “A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers,” Statistical Science , vol. 27, no. 4, 2012
2012
Cited alongside, same era.
E. Hazan and S. Kale, “Online Submodular Minimization,” Journal of Machine Learning Research , vol. 13, pp. 2903–2922, 2012
2012
Cited alongside, same era.
K. Wei, Y. Liu, K. Kirchhoff, and J. Bilmes, “Using Document Summarization Techniques for Speech Data Subset Selection,” in NAACL-HLT , 2013, pp. 721–726
2013
Cited alongside, same era.
F. R. Bach, “Learning with Submodular Functions: A Convex Optimization Perspective,” Foundations and Trends in Machine Learning , vol. 6, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
J. Liu, J. Ye, and R. Fujimaki, “Forward-Backward Greedy Algorithms for General Convex Smooth Functions Over a Cardinality Constraint,” in ICML , 2014, pp. 503–511
2014
Cited alongside, same era.
2015
Later among the works it cites.
P.-L. Loh and M. J. Wainwright, “Regularized M-estimators with Nonconvexity: Statistical and Algorithmic Theory for Local Optima,” Journal of Machine Learning Research , vol. 16, no. 1, pp. 559–616, Jan. 2015
2015
Later among the works it cites.
Z. Yang, Z. Wang, H. Liu, Y. C. Eldar, and T. Zhang, “Sparse Nonlinear Regression: Parameter Estimation and Asymptotic Inference,” ICML , pp. 1–32, 2016
2016
Closest in time.
J. Altschuler, A. Bhaskara, G. T. Fu, V. Mirrokni, A. Rostamizadeh, and M. Zadimoghaddam, “Greedy Column Subset Selection: New Bounds and Distributed Algorithms,” in ICML , 2016
2016
Closest in time.
T. Horel and Y. Singer, “Maximization of Approximately Submodular Functions,” in NIPS , 2016
2016
Closest in time.
2016
Closest in time.
R. Eghbali and M. Fazel, “Designing Smoothing Functions for Improved Worst-Case Competitive Ratio in Online Optimization,” in NIPS , 2016, pp. 3279–3287
2016
Closest in time.
R. Khanna, E. R. Elenberg, A. G. Dimakis, S. Negahban, and J. Ghosh, “Scalable Greedy Support Selection via Weak Submodularity,” in AISTATS , vol. 54, 2017, pp. 1560–1568
2017
Closest in time.
R. Khanna, E. R. Elenberg, A. G. Dimakis, J. Ghosh, and S. Negahban, “On Approximation Guarantees for Greedy Low Rank Optimization,” in ICML , vol. 70, 2017, pp. 1837–1846
2017
Closest in time.
E. R. Elenberg, A. G. Dimakis, M. Feldman, and A. Karbasi, “Streaming Weak Submodularity: Interpreting Neural Networks on the Fly,” in NIPS , 2017 (to appear)
2017
Closest in time.
2017
Closest in time.
A. A. Bian, B. Mirzasoleiman, J. M. Buhmann, and A. Krause, “Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains,” in AISTATS , 2017, pp. 111–120
2017
Closest in time.
H. Hassani, M. Soltanolkotabi, and A. Karbasi, “Gradient Methods for Submodular Maximization,” in NIPS , 2017 (to appear)
2017
Closest in time.