Fetching the paper…
Reading the bibliography…
A key challenge in science and engineering is to design experiments to learn about some unknown quantity of interest.
An analysis of approximations for maximizing submodular set functions—i
Nemhauser, G. L., Wolsey, L. A., and Fisher, M. L. (1978) · 1978
Earlier work this paper cites.
Bayesian experimental design: A review
Chaloner, K. and Verdinelli, I. (1995) · 1995
Earlier work this paper cites.
Pharmacokinetic and pharmacodynamic data analysis
Gabrielsson, J. and Weiner, D. (1995) · 1995
Earlier work this paper cites.
Model-Oriented Design of Experiments | | Valerii V. Fedorov | | Springer
Fedorov, V. V. and Hackl, P. (1997) · 1997
Earlier work this paper cites.
A generalized representer theorem
Schölkopf, B., Herbrich, R., and Smola, A. (2001) · 2001
Earlier work this paper cites.
Techniques of Variational Analysis
Borwein, J. and Zhu, Q. (2005) · 2005
Earlier work this paper cites.
Optimal nonmyopic value of information in graphical models: efficient algorithms and theoretical limits
Krause, A. and Guestrin, C. (2005) · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · 2005
Earlier work this paper cites.
Optimal Design of Experiments
Pukelsheim, F. (2006) · 2006
Earlier work this paper cites.
Concentration of measure inequalities
Lugosi, G. (2009) · 2009
Earlier work this paper cites.
Active learning literature survey
Settles, B. (2009) · 2009
Earlier work this paper cites.
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
Golovin, D. and Krause, A. (2011) · 2011
Earlier work this paper cites.
Matrix Theory: Basic Results and Techniques
Zhang, F. (2011) · 2011
Earlier work this paper cites.
Smoothing and first order methods: A unified framework
Beck, A. and Teboulle, M. (2012) · 2012
Earlier work this paper cites.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
Jaggi, M. (2013) · 2013
Earlier work this paper cites.
Navigating the protein fitness landscape with gaussian processes
Romero, P. A., Krause, A., and Arnold, F. H. (2013) · 2013
Cited alongside, same era.
Stochastic online shortest path routing: The value of feedback
Talebi, M. S., Zou, Z., Combes, R., Proutiere, A., and Johansson, M. (2013) · 2013
Cited alongside, same era.
Submodular function maximization
Krause, A. and Golovin, D. (2014) · 2014
Cited alongside, same era.
Markov decision processes: discrete stochastic dynamic programming
Puterman, M. L. (2014) · 2014
Cited alongside, same era.
Online shortest path routing: The value of information
Zou, Z., Proutiere, A., and Johansson, M. (2014) · 2014
Cited alongside, same era.
Spatial Point Patterns: Methodology and Applications with R
Baddeley, A., E., R., and R., T. (2015) · 2015
Coresets via bilevel optimization for continual learning and streaming
Borsos, Z., Mutný, M., and Krause, A. (2020) · 2020
Later among the works it cites.
Provably efficient reinforcement learning with linear function approximation
Jin, C., Yang, Z., Wang, Z., and Jordan, M. I. (2020) · 2020
Later among the works it cites.
A unifying view of optimism in episodic reinforcement learning
Neu, G. and Pike-Burke, C. (2020) · 2020
Later among the works it cites.
Bandit Algorithms
Szepesvari, C. and Lattimore, T. (2020) · 2020
Later among the works it cites.
Inverse reinforcement learning in contextual mdps
Belogolovsky, S., Korsunsky, P., Mannor, S., Tessler, C., and Zahavy, T. (2021) · 2021
Later among the works it cites.
Simple steps are all you need: Frank-wolfe and generalized self-concordant functions
Carderera, A., Besançon, M., and Pokutta, S. (2021) · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On the global linear convergence of frank-wolfe optimization variants
Lacoste-Julien, S. and Jaggi, M. (2015) · 2015
Cited alongside, same era.
Minimum-Volume Ellipsoids: Theory and Algorithms
Todd, M. J. (2016) · 2016
Cited alongside, same era.
Bandit optimization with upper-confidence frank-wolfe
Berthet, Q. and Perchet, V. (2017) · 2017
Cited alongside, same era.
Information directed sampling and bandits with heteroscedastic noise
Kirschner, J. and Krause, A. (2018) · 2018
Cited alongside, same era.
Efficient high dimensional bayesian optimization with additivity and quadrature fourier features
Mutný, M. and Krause, A. (2018) · 2018
Cited alongside, same era.
Provably efficient maximum entropy exploration
Hazan, E., Kakade, S., Singh, K., and Van Soest, A. (2019) · 2019
Cited alongside, same era.
Later among the works it cites.
Deep adaptive design: Amortizing sequential bayesian experimental design
Foster, A., Ivanova, D. R., Malik, I., and Rainforth, T. (2021) · 2021
Later among the works it cites.
Efficient pure exploration for combinatorial bandits with semi-bandit feedback
Jourdan, M., Mutný, M., Kirschner, J., and Krause, A. (2021) · 2021
Later among the works it cites.
Information directed reward learning for reinforcement learning
Lindner, D., Turchetta, M., Tschiatschek, S., Ciosek, K., and Krause, A. (2021) · 2021
Later among the works it cites.
No-regret algorithms for capturing events in poisson point processes
Mutný, M. and Krause, A. (2021) · 2021
Later among the works it cites.
Reward is enough for convex mdps
Zahavy, T., O’Donoghue, B., Desjardins, G., and Singh, S. (2021) · 2021
Later among the works it cites.
Sensing cox processes via posterior sampling and positive bases
Mutný, M. and Krause, A. (2022b) · 2022
Closest in time.
Instance-dependent policy learning for linear mdps via online experiment design
Wagenmaker, A. and Jamieson, K. (2022) · 2022
Closest in time.
nalysis of the frank–wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
Zhao, R. and Freund, R. (2022) · 2022
Closest in time.