activity
20112025
most citedPrioritized Experience Replay

2k citations · 7.2k across the 38 of their papers we have counts for

collaborators
Showing cs.NEShow all

5 papers · 1 filter

cs.NE2023

Discovering Attention-Based Genetic Algorithms via Meta-Black-Box Optimization

Robert Tjarko Lange, Tom Schaul, Yutian Chen +4

Genetic algorithms constitute a family of black-box optimization algorithms, which take inspiration from the principles of biological evolution. While they provide a general-purpos…

cs.NE2022★ 1 cited

Discovering Evolution Strategies via Meta-Black-Box Optimization

Robert Tjarko Lange, Tom Schaul, Yutian Chen +5

Optimizing functions without access to gradients is the remit of black-box methods such as evolution strategies. While highly general, their learning dynamics are often times heuri…

cs.NE2019★ 6 cited

Non-Differentiable Supervised Learning with Evolution Strategies and Hybrid Methods

Karel Lenc, Erich Elsen, Tom Schaul +1

In this work we show that Evolution Strategies (ES) are a viable method for learning non-differentiable parameters of large supervised models. ES are black-box optimization algorit…

cs.NE2018★ 25 cited

Meta-Learning by the Baldwin Effect

Chrisantha Thomas Fernando, Jakub Sygnowski, Simon Osindero +6

The scope of the Baldwin effect was recently called into question by two papers that closely examined the seminal work of Hinton and Nowlan. To this date there has been no demonstr…

cs.NE2016★ 342 cited

Learning to learn by gradient descent by gradient descent

Marcin Andrychowicz, Misha Denil, Sergio Gomez +5

The move from hand-designed features to learned features in machine learning has been wildly successful. In spite of this, optimization algorithms are still designed by hand. In th…