Probabilistic Submodular Maximization in Sub-Linear Time
暂无分享,去创建一个
[1] Andreas Krause,et al. Distributed Submodular Maximization , 2014, J. Mach. Learn. Res..
[2] Morteza Zadimoghaddam,et al. Submodular secretary problem and extensions , 2013, TALG.
[3] Matthew J. Streeter,et al. An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.
[4] Abhimanyu Das,et al. Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection , 2011, ICML.
[5] Andreas Krause,et al. Distributed Submodular Maximization: Identifying Representative Elements in Massive Data , 2013, NIPS.
[6] Sergei Vassilvitskii,et al. Fast greedy algorithms in mapreduce and streaming , 2013, SPAA.
[7] Jeff A. Bilmes,et al. Submodular subset selection for large-scale speech training data , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[8] Yaron Singer,et al. Budget Feasible Mechanisms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[9] Amin Karbasi,et al. Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization , 2017, COLT.
[10] Baharan Mirzasoleiman,et al. Fast Constrained Submodular Maximization: Personalized Data Summarization , 2016, ICML.
[11] Hui Lin,et al. A Class of Submodular Functions for Document Summarization , 2011, ACL.
[12] Hui Lin,et al. Learning Mixtures of Submodular Shells with Application to Document Summarization , 2012, UAI.
[13] Yisong Yue,et al. Linear Submodular Bandits and their Application to Diversified Retrieval , 2011, NIPS.
[14] Jeff A. Bilmes,et al. Online Submodular Minimization for Combinatorial Structures , 2011, ICML.
[15] Joseph Naor,et al. Submodular Maximization with Cardinality Constraints , 2014, SODA.
[16] Andreas Krause,et al. Submodular Function Maximization , 2014, Tractability.
[17] Rishabh K. Iyer,et al. Fast Multi-stage Submodular Maximization , 2014, ICML.
[18] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[19] Andreas Krause,et al. Budgeted Nonparametric Learning from Data Streams , 2010, ICML.
[20] Morteza Zadimoghaddam,et al. Fast Distributed Submodular Cover: Public-Private Data Summarization , 2016, NIPS.
[21] Andreas Krause,et al. Streaming submodular maximization: massive data summarization on the fly , 2014, KDD.
[22] Shahar Dobzinski,et al. Optimization with Demand Oracles , 2018, Algorithmica.
[23] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..
[24] Rishabh K. Iyer,et al. Learning Mixtures of Submodular Functions for Image Collection Summarization , 2014, NIPS.
[25] Andreas Krause,et al. Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization , 2016, ICML.
[26] Elad Hazan,et al. Online submodular minimization , 2009, J. Mach. Learn. Res..
[27] Jan Vondrák,et al. Fast algorithms for maximizing submodular functions , 2014, SODA.
[28] Uriel Feige,et al. On maximizing welfare when utility functions are subadditive , 2006, STOC '06.
[29] Dafna Shahaf,et al. Turning down the noise in the blogosphere , 2009, KDD.
[30] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[31] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[32] Noam Nisan,et al. Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders , 2009 .
[33] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[34] Andreas Krause,et al. Lazier Than Lazy Greedy , 2014, AAAI.
[35] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[36] Jeff A. Bilmes,et al. Using Document Summarization Techniques for Speech Data Subset Selection , 2013, NAACL.