Fetching the paper…
Reading the bibliography…
Adaptive sequential decision making is one of the central challenges in machine learning and artificial intelligence.
The complexity of markov decision processes
C. H. Papadimitriou and J. N. Tsitsiklis · 1987
Earlier work this paper cites.
Bayesian experimental design and shannon information
P. Sebastiani and H. P. Wynn · 1997
Earlier work this paper cites.
Stochastic covering and adaptivity
M. Goemans and J. Vondrák · 2006
Earlier work this paper cites.
Hierarchical sampling for active learning
S. Dasgupta and D. Hsu · 2008
Earlier work this paper cites.
Efficient sensor placement optimization for securing large water distribution networks
A. Krause, J. Leskovec, C. Guestrin, J. VanBriesen, and C. Faloutsos · 2008
Earlier work this paper cites.
Near-optimal bayesian active learning with noisy observations
D. Golovin, A. Krause, and D. Ray · 2010
Earlier work this paper cites.
Interactive Submodular Set Cover
A. Guillory and J. Bilmes · 2010
Earlier work this paper cites.
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
D. Golovin and A. Krause · 2011
Earlier work this paper cites.
Active Semi-Supervised Learning using Submodular Functions
A. Guillory and J. A. Bilmes · 2011
Earlier work this paper cites.
A class of submodular functions for document summarization
H. Lin and J. Bilmes · 2011
Earlier work this paper cites.
Comparison-based learning with rank nets
A. Karbasi, S. Ioannidis, and laurent Massoulie · 2012
Earlier work this paper cites.
Comparison-based learning with rank nets
A. Karbasi, S. Ioannidis, and L. Massoulié · 2012
Earlier work this paper cites.
Near-optimal batch mode active learning and adaptive submodular optimization
Y. Chen and A. Krause · 2013
Earlier work this paper cites.
Active detection via adaptive submodularity
Y. Chen, H. Shio, C. A. F. Montesinos, L. P. Koh, S. Wich, and A. Krause · 2014
Earlier work this paper cites.
Near optimal bayesian active learning for decision making
S. Javdani, Y. Chen, A. Karbasi, A. Krause, D. Bagnell, and S. S. Srinivasa · 2014
Earlier work this paper cites.
Near-optimally teaching the crowd to classify
A. Singla, I. Bogunovic, G. Bartók, A. Karbasi, and A. Krause · 2014
Cited alongside, same era.
Sequential information maximization: When is greedy near-optimal?
Y. Chen, S. H. Hassani, A. Karbasi, and A. Krause · 2015
Cited alongside, same era.
Submodular surrogates for value of information
Y. Chen, S. Javdani, A. Karbasi, J. A. Bagnell, S. S. Srinivasa, and A. Krause · 2015
Cited alongside, same era.
Non-monotone adaptive submodular maximization
A. Gotovos, A. Karbasi, and A. Krause · 2015
Cited alongside, same era.
Submodularity in Data Subset Selection and Active Learning
K. Wei, R. Iyer, and J. Bilmes · 2015
Cited alongside, same era.
Maximizing stochastic monotone submodular functions
A. Asadpour and H. Nazerzadeh · 2016
Cited alongside, same era.
E. Balkanski, A. Rubinstein, and Y. Singer · 2018
Later among the works it cites.
E. Balkanski and Y. Singer · 2018
Later among the works it cites.
The adaptive complexity of maximizing a submodular function
E. Balkanski and Y. Singer · 2018
Later among the works it cites.
Unconstrained submodular maximization with constant adaptive complexity
L. Chen, M. Feldman, and A. Karbasi · 2018
Later among the works it cites.
Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. E. Celis, A. Deshpande, T. Kathuria, and N. K. Vishnoi · 2016
Cited alongside, same era.
Influence maximization through adaptive seeding
Y. Singer · 2016
Cited alongside, same era.
Adaptive influence maximization in dynamic social networks
G. Tong, W. Wu, S. Tang, and D.-Z. Du · 2016
Cited alongside, same era.
Near-optimal Adaptive Information Acquisition: Theory and Applications
Y. Chen · 2017
Cited alongside, same era.
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
E. R. Elenberg, A. G. Dimakis, M. Feldman, and A. Karbasi · 2017
Cited alongside, same era.
Adaptivity gaps for stochastic probing: Submodular and xos functions
A. Gupta, V. Nagarajan, and S. Singla · 2017
Cited alongside, same era.
A. Ene and H. L. Nguyen · 2018
Later among the works it cites.
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity
M. Fahrbach, V. S. Mirrokni, and M. Zadimoghaddam · 2018
Later among the works it cites.
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity
M. Fahrbach, V. S. Mirrokni, and M. Zadimoghaddam · 2018
Later among the works it cites.
Discrete attacks and submodular optimization with applications to text classification
Q. Lei, L. Wu, P.-Y. Chen, A. G. Dimakis, I. S. Dhillon, and M. Witbrock · 2018
Later among the works it cites.
Stochastic submodular cover with limited adaptivity
A. Agarwal, S. Assadi, and S. Khanna · 2019
Closest in time.
Complexity of highly parallel non-smooth convex optimization
S. Bubeck, Q. Jiang, Y.-T. Lee, Y. Li, and A. Sidford · 2019
Closest in time.
Batched multi-armed bandits with optimal regret
H. Esfandiari, A. Karbasi, A. Mehrabian, and V. Mirrokni · 2019
Closest in time.
Batched multi-armed bandits problem
Z. Gao, Y. Han, Z. Ren, and Z. Zhou · 2019
Closest in time.
Adaptive sequence submodularity
M. Mitrovic, E. Kazemi, M. Feldman, A. Krause, and A. Karbasi · 2019
Closest in time.
Lower bounds for parallel and randomized convex optimization
J. Diakonikolas and C. Guzmán · 2020
Closest in time.
Submodularity in action: From machine learning to signal processing applications, 2020
E. Tohidi, R. Amiri, M. Coutino, D. Gesbert, G. Leus, and A. Karbasi · 2020
Closest in time.