Fetching the paper…
Reading the bibliography…
A central capability of intelligent systems is the ability to continuously build upon previous experiences to speed up and enhance learning of new tasks.
Approximation to bayes risk in repeated play
Hannan, J · 1957
Earlier work this paper cites.
Evolutionary principles in self-referential learning
Schmidhuber, J · 1987
Earlier work this paper cites.
On the optimization of a synaptic learning rule
Bengio, S., Bengio, Y., Cloutier, J., and Gecsei, J · 1992
Earlier work this paper cites.
Meta-neural networks that learn by learning
Naik, D. K. and Mammone, R · 1992
Earlier work this paper cites.
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., and Singh, S. P · 1995
Earlier work this paper cites.
Tracking the best expert
Herbster, M. and Warmuth, M. K · 1995
Earlier work this paper cites.
Incremental self-improvement for life-time multi-agent reinforcement learning
Zhao, J. and Schmidhuber, J · 1996
Earlier work this paper cites.
Lifelong learning algorithms
Thrun, S · 1998
Earlier work this paper cites.
Learning to learn
Thrun, S. and Pratt, L · 1998
Earlier work this paper cites.
Learning to learn using gradient descent
Hochreiter, S., Younger, A. S., and Conwell, P. R · 2001
Earlier work this paper cites.
Optimal ordered problem solver
Schmidhuber, J · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, M · 2003
Earlier work this paper cites.
Convex Optimization
Boyd, S. and Vandenberghe, L · 2004
Earlier work this paper cites.
Efficient algorithms for online decision problems
Kalai, A. T. and Vempala, S · 2005
Earlier work this paper cites.
Prediction, learning, and games
Cesa-Bianchi, N. and Lugosi, G · 2006
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
Hazan, E., Kalai, A. T., Kale, S., and Agarwal, A · 2006
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Nesterov, Y. and Polyak, B. T · 2006
Earlier work this paper cites.
Mind the duality gap: Logarithmic regret algorithms for online optimization
Shalev-Shwartz, S. and Kakade, S. M · 2008
Earlier work this paper cites.
Efficient learning algorithms for changing environments
Hazan, E. and Comandur, S · 2009
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
Duchi, J., Hazan, E., and Singer, Y · 2011
Earlier work this paper cites.
Online learning and online convex optimization
Shalev-Shwartz, S · 2012
Earlier work this paper cites.
Mujoco: A physics engine for model-based control
Todorov, E., Erez, T., and Tassa, Y · 2012
Earlier work this paper cites.
An empirical investigation of catastrophic forgetting in gradient-based neural networks
Goodfellow, I. J., Mirza, M., Xiao, D., Courville, A., and Bengio, Y · 2013
Earlier work this paper cites.
Ella: An efficient lifelong learning algorithm
Ruvolo, P. and Eaton, E · 2013
Earlier work this paper cites.
Powerplay: Training an increasingly general problem solver by continually searching for the simplest still unsolvable problem
Schmidhuber, J · 2013
Earlier work this paper cites.
Beyond pascal: A benchmark for 3d object detection in the wild
Xiang, Y., Mottaghi, R., and Savarese, S · 2014
Cited alongside, same era.
Non-stationary stochastic optimization
Besbes, O., Gur, Y., and Zeevi, A. J · 2015
Cited alongside, same era.
Online convex optimization in dynamic environments
Hall, E. C. and Willett, R. M · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D. and Ba, J · 2015
Cited alongside, same era.
Regret bounds for lifelong learning
Alquier, P., Mai, T. T., and Pontil, M · 2016
Cited alongside, same era.
Learning to learn by gradient descent by gradient descent
Andrychowicz, M., Denil, M., Gomez, S., Hoffman, M. W., Pfau, D., Schaul, T., and de Freitas, N · 2016
Cited alongside, same era.
Lifelong learning with dynamically expandable networks
Lee, J., Yun, J., Hwang, S., and Yang, E · 2017
Later among the works it cites.
Learning to optimize
Li, K. and Malik, J · 2017
Later among the works it cites.
Gradient episodic memory for continual learning
Lopez-Paz, D. et al · 2017
Later among the works it cites.
Packnet: Adding multiple tasks to a single network by iterative pruning
Mallya, A. and Lazebnik, S · 2017
Later among the works it cites.
Online learning of a memory for learning rates
Meier, F., Kappler, D., and Schaal, S · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Duan, Y., Schulman, J., Chen, X., Bartlett, P. L., Sutskever, I., and Abbeel, P · 2016
Cited alongside, same era.
Introduction to online convex optimization
Hazan, E · 2016
Cited alongside, same era.
End-to-end training of deep visuomotor policies
Levine, S., Finn, C., Darrell, T., and Abbeel, P · 2016
Cited alongside, same era.
Actor-mimic: Deep multitask and transfer reinforcement learning
Parisotto, E., Ba, J. L., and Salakhutdinov, R · 2016
Cited alongside, same era.
Rusu, A. A., Rabinowitz, N. C., Desjardins, G., Soyer, H., Kirkpatrick, J., Kavukcuoglu, K., Pascanu, R., and Hadsell, R · 2016
Cited alongside, same era.
Meta-learning with memory-augmented neural networks
Santoro, A., Bartunov, S., Botvinick, M., Wierstra, D., and Lillicrap, T · 2016
Cited alongside, same era.
Mishra, N., Rohaninejad, M., Chen, X., and Abbeel, P · 2017
Later among the works it cites.
Meta networks
Munkhdalai, T. and Yu, H · 2017
Later among the works it cites.
Variational continual learning
Nguyen, C. V., Li, Y., Bui, T. D., and Turner, R. E · 2017
Later among the works it cites.
Optimization as a model for few-shot learning
Ravi, S. and Larochelle, H · 2017
Later among the works it cites.
icarl: Incremental classifier and representation learning
Rebuffi, S.-A., Kolesnikov, A., and Lampert, C. H · 2017
Later among the works it cites.
Continual learning with deep generative replay
Shin, H., Lee, J. K., Kim, J., and Kim, J · 2017
Later among the works it cites.
Incremental learning of object detectors without catastrophic forgetting
Shmelkov, K., Schmid, C., and Alahari, K · 2017
Later among the works it cites.
Gplac: Generalizing vision-based robotic skills using weakly labeled images
Singh, A., Yang, L., and Levine, S · 2017
Later among the works it cites.
Growing a brain: Fine-tuning by increasing model capacity
Wang, Y.-X., Ramanan, D., and Hebert, M · 2017
Later among the works it cites.
Continual learning through synaptic intelligence
Zenke, F., Poole, B., and Ganguli, S · 2017
Later among the works it cites.
Antoniou, A., Edwards, H., and Storkey, A · 2018
Later among the works it cites.
Recasting gradient-based meta-learning as hierarchical bayes
Grant, E., Finn, C., Levine, S., Darrell, T., and Griffiths, T · 2018
Later among the works it cites.
Selective experience replay for lifelong learning
Isele, D. and Cosgun, A · 2018
Later among the works it cites.
Deep online learning via meta-learning: Continual adaptation for model-based rl
Nagabandi, A., Finn, C., and Levine, S · 2018
Later among the works it cites.
Truncated back-propagation for bilevel optimization
Shaban, A., Cheng, C.-A., Hirschey, O., and Boots, B · 2018
Later among the works it cites.
Learning-to-learn stochastic gradient descent with biased regularization
Denevi, G., Ciliberto, C., Grazzi, R., and Pontil, M · 2019
Closest in time.
Modulating transfer between tasks in gradient-based meta-learning, 2019
Grant, E., Jerfel, G., Heller, K., and Griffiths, T. L · 2019
Closest in time.
Provable guarantees for gradient-based meta-learning
Khodak, M., Balcan, M.-F., and Talwalkar, A. S · 2019
Closest in time.
Plan Online, Learn Offline: Efficient Learning and Exploration via Model-Based Control
Lowrey, K., Rajeswaran, A., Kakade, S., Todorov, E., and Mordatch, I · 2019
Closest in time.