30 papersImage 1

This website is based on a rumoured list of papers that Ilya Sutskever gave to John Carmack. We currently only have a list of 27. If you or anyone you know has the full, canonical list please feel free to reach out.

Contributors

  • Image 2: Andrej KarpathyAndrej Karpathy
  • Image 3: Fei-Fei LiFei-Fei Li
  • +many other researchers

CS231n: Convolutional Neural Networks for Visual Recognition

The course notes that teach convolutional networks from first principles, from linear classifiers up to deep architectures for images.

Image 4: CS231n: Convolutional Neural Networks for Visual Recognition

CS231n: Convolutional Neural Networks for Visual Recognition

The course notes that teach convolutional networks from first principles, from linear classifiers up to deep architectures for images.

Image 5: Andrej KarpathyAndrej KarpathyImage 6: Fei-Fei LiFei-Fei Li Plus many more

Contributors

  • Image 7: Andrej KarpathyAndrej Karpathy

The Unreasonable Effectiveness of Recurrent Neural Networks

A hands on blog post that trains character level RNNs to generate text and shows, with vivid examples, how much structure they capture.

Image 8: The Unreasonable Effectiveness of Recurrent Neural Networks

The Unreasonable Effectiveness of Recurrent Neural Networks

A hands on blog post that trains character level RNNs to generate text and shows, with vivid examples, how much structure they capture.

Image 9: Andrej KarpathyAndrej Karpathy

Contributors

  • Image 10: Christopher OlahChristopher Olah

Understanding LSTM Networks

The clearest visual explanation of how LSTM gates carry information across long sequences, widely used as a first introduction.

Image 11: Understanding LSTM Networks

Understanding LSTM Networks

The clearest visual explanation of how LSTM gates carry information across long sequences, widely used as a first introduction.

Image 12: Christopher OlahChristopher Olah

Contributors

  • Image 13: Alex KrizhevskyAlex Krizhevsky
  • Image 14: Ilya SutskeverIlya Sutskever
  • Image 15: Geoffrey HintonGeoffrey Hinton

ImageNet Classification with Deep Convolutional Neural Networks

AlexNet. The convolutional network that won ImageNet by a wide margin and set off the modern deep learning era.

Image 16: ImageNet Classification with Deep Convolutional Neural Networks

ImageNet Classification with Deep Convolutional Neural Networks

AlexNet. The convolutional network that won ImageNet by a wide margin and set off the modern deep learning era.

Image 17: Alex KrizhevskyAlex KrizhevskyImage 18: Ilya SutskeverIlya Sutskever

Contributors

  • Image 19: Kaiming HeKaiming He
  • Image 20: Xiangyu ZhangXiangyu Zhang
  • Image 21: Shaoqing RenShaoqing Ren
  • JS Jian Sun

Deep Residual Learning for Image Recognition

ResNet. Introduces residual connections that let networks grow to hundreds of layers by learning changes to the input rather than full transformations.

Image 22: Deep Residual Learning for Image Recognition

Deep Residual Learning for Image Recognition

ResNet. Introduces residual connections that let networks grow to hundreds of layers by learning changes to the input rather than full transformations.

Image 23: Kaiming HeKaiming HeImage 24: Xiangyu ZhangXiangyu Zhang

Contributors

  • FY Fisher Yu
  • Image 25: Vladlen KoltunVladlen Koltun

Multi-Scale Context Aggregation by Dilated Convolutions

Shows how dilated convolutions expand the receptive field without losing resolution, which sharpened dense prediction tasks like segmentation.

Image 26: Multi-Scale Context Aggregation by Dilated Convolutions

Multi-Scale Context Aggregation by Dilated Convolutions

Shows how dilated convolutions expand the receptive field without losing resolution, which sharpened dense prediction tasks like segmentation.

FY Fisher YuImage 27: Vladlen KoltunVladlen Koltun

Contributors

  • Image 28: Kaiming HeKaiming He
  • Image 29: Xiangyu ZhangXiangyu Zhang
  • Image 30: Shaoqing RenShaoqing Ren
  • JS Jian Sun

Identity Mappings in Deep Residual Networks

A follow up to ResNet that studies why identity shortcuts work so well and proposes a cleaner pre-activation residual block.

Image 31: Identity Mappings in Deep Residual Networks

Identity Mappings in Deep Residual Networks

A follow up to ResNet that studies why identity shortcuts work so well and proposes a cleaner pre-activation residual block.

Image 32: Kaiming HeKaiming HeImage 33: Xiangyu ZhangXiangyu Zhang

Contributors

  • Image 34: Wojciech ZarembaWojciech Zaremba
  • Image 35: Ilya SutskeverIlya Sutskever
  • Image 36: Oriol VinyalsOriol Vinyals

Recurrent Neural Network Regularization

Shows how to apply dropout to LSTMs correctly, on the non-recurrent connections, so large recurrent models stop overfitting.

Image 37: Recurrent Neural Network Regularization

Recurrent Neural Network Regularization

Shows how to apply dropout to LSTMs correctly, on the non-recurrent connections, so large recurrent models stop overfitting.

Image 38: Wojciech ZarembaWojciech ZarembaImage 39: Ilya SutskeverIlya Sutskever

Contributors

  • Image 40: Dario AmodeiDario Amodei
  • RA Rishita Anubhai
  • +many other researchers

Deep Speech 2: End-to-End Speech Recognition in English and Mandarin

An end to end speech recognition system trained with connectionist temporal classification that worked across two very different languages.

Image 41: Deep Speech 2: End-to-End Speech Recognition in English and Mandarin

Deep Speech 2: End-to-End Speech Recognition in English and Mandarin

An end to end speech recognition system trained with connectionist temporal classification that worked across two very different languages.

Image 42: Dario AmodeiDario Amodei RA Rishita Anubhai Plus many more

Contributors

  • Image 43: Oriol VinyalsOriol Vinyals
  • Image 44: Samy BengioSamy Bengio
  • MK Manjunath Kudlur

Order Matters: Sequence to Sequence for Sets

Examines how the order of inputs and outputs affects sequence to sequence models, and how to handle data that is really a set.

Image 45: Order Matters: Sequence to Sequence for Sets

Order Matters: Sequence to Sequence for Sets

Examines how the order of inputs and outputs affects sequence to sequence models, and how to handle data that is really a set.

Image 46: Oriol VinyalsOriol VinyalsImage 47: Samy BengioSamy Bengio

Contributors

  • Image 48: Dzmitry BahdanauDzmitry Bahdanau
  • Image 49: Kyunghyun ChoKyunghyun Cho
  • Image 50: Yoshua BengioYoshua Bengio

Neural Machine Translation by Jointly Learning to Align and Translate

Introduces the attention mechanism, letting a translation model look back at the relevant source words instead of a single fixed summary.

Image 51: Neural Machine Translation by Jointly Learning to Align and Translate

Neural Machine Translation by Jointly Learning to Align and Translate

Introduces the attention mechanism, letting a translation model look back at the relevant source words instead of a single fixed summary.

Image 52: Dzmitry BahdanauDzmitry BahdanauImage 53: Kyunghyun ChoKyunghyun Cho

Contributors

  • Image 54: Oriol VinyalsOriol Vinyals
  • Image 55: Meire FortunatoMeire Fortunato
  • Image 56: Navdeep JaitlyNavdeep Jaitly

Pointer Networks

A sequence model whose outputs point back at positions in the input, which suits problems whose answer is a selection or ordering of the inputs.

Image 57: Pointer Networks

Pointer Networks

A sequence model whose outputs point back at positions in the input, which suits problems whose answer is a selection or ordering of the inputs.

Image 58: Oriol VinyalsOriol VinyalsImage 59: Meire FortunatoMeire Fortunato

Contributors

  • Image 60: Ashish VaswaniAshish Vaswani
  • Image 61: Noam ShazeerNoam Shazeer
  • +many other researchers

Attention Is All You Need

The Transformer. Replaces recurrence entirely with self attention, the architecture that underpins almost every modern large language model.

Image 62: Attention Is All You Need

Attention Is All You Need

The Transformer. Replaces recurrence entirely with self attention, the architecture that underpins almost every modern large language model.

Image 63: Ashish VaswaniAshish VaswaniImage 64: Noam ShazeerNoam Shazeer Plus many more

Contributors

  • Image 65: Sasha RushSasha Rush
  • +many other researchers

The Annotated Transformer

A line by line, runnable reimplementation of the Transformer that turns the original paper into working, readable code.

Image 66: The Annotated Transformer

The Annotated Transformer

A line by line, runnable reimplementation of the Transformer that turns the original paper into working, readable code.

Image 67: Sasha RushSasha Rush Plus many more

Contributors

  • Image 68: Alex GravesAlex Graves
  • GW Greg Wayne
  • ID Ivo Danihelka

Neural Turing Machines

Couples a neural network to an external memory it can read and write with differentiable attention, learning simple algorithms from examples.

Image 69: Neural Turing Machines

Neural Turing Machines

Couples a neural network to an external memory it can read and write with differentiable attention, learning simple algorithms from examples.

Image 70: Alex GravesAlex Graves GW Greg Wayne

Contributors

  • Image 71: Adam SantoroAdam Santoro
  • DR David Raposo
  • +many other researchers

A Simple Neural Network Module for Relational Reasoning

Introduces the relation network, a small plug in module that lets a network reason about how pairs of objects relate to each other.

Image 72: A Simple Neural Network Module for Relational Reasoning

A Simple Neural Network Module for Relational Reasoning

Introduces the relation network, a small plug in module that lets a network reason about how pairs of objects relate to each other.

Image 73: Adam SantoroAdam Santoro DR David Raposo Plus many more

Contributors

  • Image 74: Adam SantoroAdam Santoro
  • RF Ryan Faulkner
  • +many other researchers

Relational Recurrent Neural Networks

Adds a self attention based memory to recurrent networks so that stored memories can interact, improving tasks that need relational reasoning over time.

Image 75: Relational Recurrent Neural Networks

Relational Recurrent Neural Networks

Adds a self attention based memory to recurrent networks so that stored memories can interact, improving tasks that need relational reasoning over time.

Image 76: Adam SantoroAdam Santoro RF Ryan Faulkner Plus many more

Contributors

  • Image 77: Justin GilmerJustin Gilmer
  • SS Samuel S. Schoenholz
  • PF Patrick F. Riley
  • Image 78: Oriol VinyalsOriol Vinyals
  • D Dahl

Neural Message Passing for Quantum Chemistry

Unifies many graph neural networks under a message passing framework and applies it to predicting molecular properties.

Image 79: Neural Message Passing for Quantum Chemistry

Neural Message Passing for Quantum Chemistry

Unifies many graph neural networks under a message passing framework and applies it to predicting molecular properties.

Image 80: Justin GilmerJustin Gilmer SS Samuel S. Schoenholz

Contributors

  • Image 81: Jared KaplanJared Kaplan
  • SM Sam McCandlish
  • +many other researchers

Scaling Laws for Neural Language Models

Measures how language model loss falls as a smooth power law in model size, data, and compute, the empirical basis for building ever larger models.

Image 82: Scaling Laws for Neural Language Models

Scaling Laws for Neural Language Models

Measures how language model loss falls as a smooth power law in model size, data, and compute, the empirical basis for building ever larger models.

Image 83: Jared KaplanJared Kaplan SM Sam McCandlish Plus many more

Contributors

  • YH Yanping Huang
  • YC Youlong Cheng
  • +many other researchers

GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism

A pipeline parallelism library that splits a giant model across devices and keeps them busy, making it practical to train very large networks.

Image 84: GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism

GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism

A pipeline parallelism library that splits a giant model across devices and keeps them busy, making it practical to train very large networks.

YH Yanping Huang YC Youlong Cheng Plus many more

Contributors

  • Image 85: Geoffrey HintonGeoffrey Hinton
  • DV Drew van Camp

Keeping Neural Networks Simple by Minimizing the Description Length of the Weights

An early information-theoretic argument that good networks are ones whose weights can be described with few bits, linking generalization to compression.

Image 86: Keeping Neural Networks Simple by Minimizing the Description Length of the Weights

Keeping Neural Networks Simple by Minimizing the Description Length of the Weights

An early information-theoretic argument that good networks are ones whose weights can be described with few bits, linking generalization to compression.

Image 87: Geoffrey HintonGeoffrey Hinton DV Drew van Camp

Contributors

  • Image 88: Peter GrunwaldPeter Grunwald

A Tutorial Introduction to the Minimum Description Length Principle

A readable introduction to choosing models by how well they compress the data, treating learning as finding the shortest description.

Image 89: A Tutorial Introduction to the Minimum Description Length Principle

A Tutorial Introduction to the Minimum Description Length Principle

A readable introduction to choosing models by how well they compress the data, treating learning as finding the shortest description.

Image 90: Peter GrunwaldPeter Grunwald

Contributors

  • Image 91: Scott AaronsonScott Aaronson

The First Law of Complexodynamics

A blog essay asking for a formal law that explains why the complexity of a closed system rises, peaks, and falls, rather than simply tracking entropy.

Image 92: The First Law of Complexodynamics

The First Law of Complexodynamics

A blog essay asking for a formal law that explains why the complexity of a closed system rises, peaks, and falls, rather than simply tracking entropy.

Image 93: Scott AaronsonScott Aaronson

Contributors

  • Image 94: Scott AaronsonScott Aaronson
  • Image 95: Sean M. CarrollSean M. Carroll
  • LO Lauren Ouellette

Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton

Uses a simple cellular automaton model of coffee mixing with cream to ask why complexity rises and then falls as a system moves toward equilibrium.

Image 96: Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton

Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton

Uses a simple cellular automaton model of coffee mixing with cream to ask why complexity rises and then falls as a system moves toward equilibrium.

Image 97: Scott AaronsonScott AaronsonImage 98: Sean M. CarrollSean M. Carroll

Contributors

  • Image 99: Thomas M. CoverThomas M. Cover
  • JA Joy A. Thomas

Kolmogorov Complexity

The textbook treatment of the shortest program that produces a string, the formal backbone behind description length and algorithmic randomness.

Image 100: Kolmogorov Complexity

Kolmogorov Complexity

The textbook treatment of the shortest program that produces a string, the formal backbone behind description length and algorithmic randomness.

Image 101: Thomas M. CoverThomas M. Cover JA Joy A. Thomas

Contributors

  • XC Xi Chen
  • Image 102: Diederik P. KingmaDiederik P. Kingma
  • +6 6 more researchers

Variational Lossy Autoencoder

Combines variational autoencoders with autoregressive decoders, and shows how to control which information the latent code is forced to keep.

Image 103: Variational Lossy Autoencoder

Variational Lossy Autoencoder

Combines variational autoencoders with autoregressive decoders, and shows how to control which information the latent code is forced to keep.

XC Xi ChenImage 104: Diederik P. KingmaDiederik P. Kingma Plus 6 more

Contributors

  • Image 105: Shane LeggShane Legg

Machine Super Intelligence

A doctoral thesis that proposes a formal, universal measure of machine intelligence and explores its consequences for very capable agents.

Image 106: Machine Super Intelligence

Machine Super Intelligence

A doctoral thesis that proposes a formal, universal measure of machine intelligence and explores its consequences for very capable agents.

Image 107: Shane LeggShane Legg

GitHub