Fetching the paper…
Reading the bibliography…
Model-based curiosity combines active learning approaches to optimal sampling with the information gain based incentives for exploration presented in the curiosity literature.
——, “A possibility for implementing curiosity and boredom in model-building neural controllers,” in Proc. of the First Int. Conf. on Simul. of Adaptive Behavior , 1990
1990
Earlier work this paper cites.
J. Schmidhuber, “Making the world differentiable: On using self-supervised fully recurrent neural networks for dynamic reinforcement learning and planning in non-stationary environments,” Tech. Rep., 1990
1990
Earlier work this paper cites.
R. Bajcsy and M. Campos, “Active and exploratory perception,” CVGIP: Image Understanding , vol. 56, no. 1, pp. 31–40, 1992
1992
Earlier work this paper cites.
H. S. Seung, M. Opper, and H. Sompolinsky, “Query by committee,” COLT , 1992
1992
Earlier work this paper cites.
D. D. Lewis and W. A. Gale, “A sequential algorithm for training text classifiers,” SIGIR , 1994
1994
Earlier work this paper cites.
D. Cohn, L. Atlas, and R. Ladner, “Improving Generalization with Active Learning,” Machine Learning , vol. 15, no. 2, pp. 201–221, 1994
1994
Earlier work this paper cites.
D. A. Cohn, Z. Ghahramani, and M. I. Jordan, “Active learning with statistical models,” NIPS , 1996
1996
Earlier work this paper cites.
R. Rubinstein, “The Cross-Entropy Method for Combinatorial and Continuous Optimization,” Methodology And Computing In Applied Probability , vol. 1, no. 2, pp. 127–190, 1999
1999
Earlier work this paper cites.
N. Roy and A. McCallum, “Toward optimal active learning through sampling estimation of error reduction,” ICML , 2001
2001
Earlier work this paper cites.
M. Kearns and S. Singh, “Near-optimal reinforcement learning in polynomial time,” Machine Learning , vol. 49, no. 2-3, pp. 209–232, 2002
2002
Earlier work this paper cites.
P. Melville and R. J. Mooney, “Diverse ensembles for active learning,” ICML , 2004
2004
Earlier work this paper cites.
R. Moskovitch, N. Nissim, D. Stopel, C. Feher, R. Englert, and Y. Elovici, “Improving the detection of unknown computer worms activity using active learning,” AAAI , 2007
2007
Earlier work this paper cites.
B. Settles, M. Craven, and S. Ray, “Multiple-instance active learning,” NIPS , 2008
2008
Earlier work this paper cites.
B. Settles, “Active learning literature survey,” University of Wisconsin–Madison, Computer Sciences Technical Report 1648, 2009
2009
Earlier work this paper cites.
A. J. Joshi, F. Porikli, and N. Papanikolopoulos, “Multi-class active learning for image classification,” CVPR , 2009
2009
Cited alongside, same era.
J. Schmidhuber, “Formal theory of creativity, fun, and intrinsic motivation (1990;2013;2010),” IEEE Trans. on Auton. Ment. Dev. , vol. 2, no. 3, pp. 230–247, 2010
2010
Cited alongside, same era.
R. Sznitman and B. Jedynak, “Active testing for face detection and localization,” IEEE Trans. on Pattern Analysis and Machine Intelligence , vol. 32, no. 10, pp. 1914–1920, 2010
2010
Cited alongside, same era.
2011
Cited alongside, same era.
M. Lopes, T. Lang, M. Toussaint, and P.-Y. Oudeyer, “Exploration in model-based reinforcement learning by empirically estimating learning progress,” NIPS , 2012
C. Finn and S. Levine, “Deep Visual Foresight for Planning Robot Motion,” ICRA , 2017
2017
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
A. X. Lee, R. Zhang, F. Ebert, P. Abbeel, C. Finn, and S. Levine, “Stochastic Adversarial Video Prediction,” arXiv preprint , apr 2018
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
A. Vezhnevets, V. Ferrari, and J. M. Buhmann, “Weakly supervised structured output learning for semantic segmentation,” CVPR , 2012
2012
Cited alongside, same era.
Y. Yang, Z. Ma, F. Nie, X. Chang, and A. G. Hauptmann, “Multi-class active learning by uncertainty sampling with diversity maximization,” IJCV , vol. 113, no. 2, pp. 113–127, 2015
2015
Cited alongside, same era.
M. Bellemare, S. Srinivasan, G. Ostrovski, T. Schaul, D. Saxton, and R. Munos, “Unifying count-based exploration and intrinsic motivation,” NIPS , 2016
2016
Cited alongside, same era.
I. Osband, C. Blundell, A. Pritzel, and B. Van Roy, “Deep exploration via bootstrapped dqn,” NIPS , 2016
2016
Cited alongside, same era.
R. Houthooft, X. Chen, Y. Duan, J. Schulman, F. De Turck, and P. Abbeel, “Vime: Variational information maximizing exploration,” NIPS , 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
G. Ostrovski, M. G. Bellemare, A. van den Oord, and R. Munos, “Count-based exploration with neural density models,” ICML , 2017
2017
Cited alongside, same era.
2019
Later among the works it cites.
P. Shyam, W. Jaśkowski, and F. Gomez, “Model-based active exploration,” ICML , 2019
2019
Later among the works it cites.
B. Bucher, A. Arapin, R. Sekar, F. Duan, M. Badger, K. Daniilidis, and O. Rybkin, “Perception-driven curiosity with bayesian surprise,” RSS Workshop on Combining Learning and Reasoning for Human-Level Robot Intelligence , 2019
2019
Later among the works it cites.
D. Pathak, D. Gandhi, and A. Gupta, “Self-Supervised Exploration via Disagreement,” ICML , 2019
2019
Later among the works it cites.
S. Bechtle, A. Rai, Y. Lin, L. Righetti, and F. Meier, “Curious ilqr: Resolving uncertainty in model-based rl,” ICML Workshop on RL4RealLife , 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
A. Xie, F. Ebert, S. Levine, and C. Finn, “Improvisation through Physical Understanding: Using Novel Objects as Tools with Visual Foresight,” RSS , 2019
2019
Later among the works it cites.
S. Dasari, F. Ebert, S. Tian, S. Nair, B. Bucher, S. Singh, K. Schmeckpeper, S. Levine, and C. Finn, “Robonet: Large-scale multi-robot learning,” CoRL , 2019
2019
Later among the works it cites.
R. Sekar, O. Rybkin, K. Daniilidis, P. Abbeel, D. Hafner, and D. Pathak, “Planning to explore via self-supervised world models,” ICML , 2020
2020
Closest in time.