暂无分享,去创建一个
Andreas Krause | Sebastian Tschiatschek | Adish Singla | Andreas Krause | A. Singla | Sebastian Tschiatschek
[1] Xi Chen,et al. Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing , 2014, ICML.
[2] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[3] Andreas Krause,et al. Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[4] R. Duncan Luce,et al. Individual Choice Behavior: A Theoretical Analysis , 1979 .
[5] Eyke Hüllermeier,et al. A Survey of Preference-Based Online Learning with Bandit Algorithms , 2014, ALT.
[6] Matthew J. Streeter,et al. An Online Algorithm for Maximizing Submodular Functions , 2008, NIPS.
[7] Robert D. Nowak,et al. Sparse Dueling Bandits , 2015, AISTATS.
[8] Jon Kleinberg,et al. Maximizing the spread of influence through a social network , 2003, KDD '03.
[9] Rémi Munos,et al. Pure Exploration in Multi-armed Bandits Problems , 2009, ALT.
[10] Andreas Krause,et al. Nonmyopic Adaptive Informative Path Planning for Multiple Robots , 2009, IJCAI.
[11] Dafna Shahaf,et al. Turning down the noise in the blogosphere , 2009, KDD.
[12] Andreas Krause,et al. Distributed Submodular Maximization: Identifying Representative Elements in Massive Data , 2013, NIPS.
[13] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[14] Avinatan Hassidim,et al. Submodular Optimization under Noise , 2016, COLT.
[15] C. Guestrin,et al. Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[16] Wei Chen,et al. Combinatorial Pure Exploration of Multi-Armed Bandits , 2014, NIPS.
[17] Rishabh K. Iyer,et al. Learning Mixtures of Submodular Functions for Image Collection Summarization , 2014, NIPS.
[18] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[19] R. A. Bradley,et al. RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS THE METHOD OF PAIRED COMPARISONS , 1952 .
[20] R. A. Bradley,et al. RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS , 1952 .
[21] Andreas Krause,et al. Submodularity and its applications in optimized information gathering , 2011, TIST.
[22] Maria-Florina Balcan,et al. Learning submodular functions , 2010, STOC '11.
[23] Shie Mannor,et al. Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems , 2006, J. Mach. Learn. Res..
[24] R. Luce,et al. Individual Choice Behavior: A Theoretical Analysis. , 1960 .
[25] Joseph Naor,et al. Submodular Maximization with Cardinality Constraints , 2014, SODA.
[26] Andreas Krause,et al. Submodular Function Maximization , 2014, Tractability.
[27] Yisong Yue,et al. Linear Submodular Bandits and their Application to Diversified Retrieval , 2011, NIPS.