activity
20162025
most citedEvaluating Large Language Models Trained on Code

1.5k citations · 1.6k across the 14 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2021★ 1.5k cited

Evaluating Large Language Models Trained on Code

Mark Chen, Jerry Tworek, Heewoo Jun +55

We introduce Codex, a GPT language model fine-tuned on publicly available code from GitHub, and study its Python code-writing capabilities. A distinct production version of Codex p…

cs.LG2021★ 4 cited

The MineRL BASALT Competition on Learning from Human Feedback

Rohin Shah, Cody Wild, Steven H. Wang +10

The last decade has seen a significant increase of interest in deep learning research, with many public successes that have demonstrated its potential. As such, these systems are n…

cs.LG2021★ 9 cited

Multi-task curriculum learning in a complex, visual, hard-exploration domain: Minecraft

Ingmar Kanitscheider, Joost Huizinga, David Farhi +9

An important challenge in reinforcement learning is training agents that can solve a wide variety of tasks. If tasks depend on each other (e.g. needing to learn to walk before lear…

cs.LG2021★ 1 cited

Towards robust and domain agnostic reinforcement learning competitions

William Hebgen Guss, Stephanie Milani, Nicholay Topin +26

Reinforcement learning competitions have formed the basis for standard research benchmarks, galvanized advances in the state-of-the-art, and shaped the direction of the field. Desp…

cs.LG2021★ 7 cited

Measuring Sample Efficiency and Generalization in Reinforcement Learning Benchmarks: NeurIPS 2020 Procgen Benchmark

Sharada Mohanty, Jyotish Poonganam, Adrien Gaidon +20

The NeurIPS 2020 Procgen Competition was designed as a centralized benchmark with clearly defined tasks for measuring Sample Efficiency and Generalization in Reinforcement Learning…

cs.LG2021★ 14 cited

The MineRL 2020 Competition on Sample Efficient Reinforcement Learning using Human Priors

William H. Guss, Mario Ynocente Castro, Sam Devlin +12

Although deep reinforcement learning has led to breakthroughs in many difficult domains, these successes have required an ever-increasing number of samples, affording only a shrink…

cs.LG2020★ 4 cited

Guaranteeing Reproducibility in Deep Learning Competitions

Brandon Houghton, Stephanie Milani, Nicholay Topin +5

To encourage the development of methods with reproducible and robust training behavior, we propose a challenge paradigm where competitors are evaluated directly on the performance…

cs.LG2020★ 8 cited

Retrospective Analysis of the 2019 MineRL Competition on Sample Efficient Reinforcement Learning

Stephanie Milani, Nicholay Topin, Brandon Houghton +5

To facilitate research in the direction of sample efficient reinforcement learning, we held the MineRL Competition on Sample Efficient Reinforcement Learning Using Human Priors at…

cs.LG2019★ 4 cited

On Universal Approximation by Neural Networks with Uniform Guarantees on Approximation of Infinite Dimensional Maps

William H. Guss, Ruslan Salakhutdinov

The study of universal approximation of arbitrary functions by neural networks has a rich and thorough history dating back to Kolmogorov (1957). In…

cs.LG2019★ 5 cited

MineRL: A Large-Scale Dataset of Minecraft Demonstrations

William H. Guss, Brandon Houghton, Nicholay Topin +4

The sample inefficiency of standard deep reinforcement learning methods precludes their application to many real-world problems. Methods which leverage human demonstrations require…

cs.LG2019★ 45 cited

The MineRL 2019 Competition on Sample Efficient Reinforcement Learning using Human Priors

William H. Guss, Cayden Codel, Katja Hofmann +9

Though deep reinforcement learning has led to breakthroughs in many difficult domains, these successes have required an ever-increasing number of samples. As state-of-the-art reinf…

cs.LG2018★ 59 cited

On Characterizing the Capacity of Neural Networks using Algebraic Topology

William H. Guss, Ruslan Salakhutdinov

The learnability of different neural architectures can be characterized directly by computable measures of data complexity. In this paper, we reframe the problem of architecture se…