Curriculum Learning

by Yoshua Bengio , Jérôme Louradour , Ronan Collobert , Jason Weston
Citations:48 - 6 self

Documents Related by Co-Citation

368 Learning and development in neural networks: The importance of starting small – Jeffrey L. Elman - 1993
25 From Baby Steps to Leapfrog: How “Less is More” in unsupervised dependency parsing – Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jurafsky
955 Head-Driven Statistical Models for Natural Language Parsing – Michael Collins, Michael Collins - 1999
170 Corpus-based induction of syntactic structure: Models of dependency and constituency – Dan Klein - 2004
236 R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning – Ronen I. Brafman, Moshe Tennenholtz, Pack Kaelbling - 2001
237 Near-optimal reinforcement learning in polynomial time – Michael Kearns - 1998
94 An analytic solution to discrete bayesian reinforcement learning – Pascal Poupart, Nikos Vlassis, Jesse Hoey, Kevin Regan - 2006
13 Flexible shaping: How learning in small steps helps – K A Krueger, P Dayan - 2009
21 Head Automata for Speech Translation – Hiyan Alshawi
2102 Building a Large Annotated Corpus of English: The Penn Treebank – Mitchell P. Marcus, Beatrice Santorini, Mary Ann Marcinkiewicz - 1993
1176 The Mathematics of Statistical Machine Translation: Parameter Estimation – Peter F. Brown, Vincent J.Della Pietra, Stephen A. Della Pietra, Robert. L. Mercer - 1993
21 Logistic Normal Priors for Unsupervised Probabilistic Grammar Induction – Shay B. Cohen, Kevin Gimpel, Noah A. Smith
68 Language Acquisition in the Absence of Explicit Negative Evidence: How Important is Starting Small? – Douglas L. T. Rohde , David C. Plaut - 1999
132 Intrinsic motivation systems for autonomous mental development – Pierre-Yves Oudeyer, Frédéric Kaplan, Verena V. Hafner - 2007
16 Active learning of inverse models with intrinsically motivated goal exploration in robots – Adrien Baranes, Pierre-Yves Oudeyer - 2013
107 Curious Model-Building Control Systems – Jürgen Schmidhuber - 1991
90 On the Sample Complexity of Reinforcement Learning – Sham M Kakade - 2003
37 Near-Bayesian exploration in polynomial time (full version). Available at http://ai.stanford.edu/˜kolter – J. Zico Kolter, Andrew Y. Ng - 2009
28 Reinforcement Learning in Finite MDPs: PAC Analysis Reinforcement Learning in Finite MDPs: PAC Analysis – Alexander L. Strehl, Lihong Li, Michael L. Littman