Ilya Sutskever's Essential ML Reading List for Beginners
Overview of the "Ilya Sutskever Reading List"
30papers.com is a curated repository of machine learning papers and pedagogical resources based on a rumored list provided by OpenAI co-founder Ilya Sutskever to legendary programmer John Carmack. While the website currently hosts 27 entries rather than the full 30, it serves as a structured roadmap for beginners to transition from basic linear classifiers to the theoretical foundations of superintelligence.
Core Architectural Milestones
The list prioritizes landmark papers that defined the modern deep learning era, focusing on the transition from convolutional networks to the Transformer architecture.
Computer Vision and CNNs
- CS231n: Convolutional Neural Networks for Visual Recognition: Course notes that teach CNNs from first principles.
- ImageNet Classification with Deep Convolutional Neural Networks (AlexNet): The pivotal paper that won ImageNet and catalyzed the modern deep learning movement.
- Deep Residual Learning for Image Recognition (ResNet): Introduced residual connections, allowing networks to scale to hundreds of layers by learning changes to the input.
- Identity Mappings in Deep Residual Networks: A follow-up to ResNet proposing a cleaner pre-activation residual block.
- Multi-Scale Context Aggregation by Dilated Convolutions: Demonstrated how dilated convolutions expand the receptive field without losing resolution, improving segmentation tasks.
Sequence Modeling and Attention
- The Unreasonable Effectiveness of Recurrent Neural Networks: A practical demonstration of character-level RNNs generating text.
- Understanding LSTM Networks: A visual guide to how Long Short-Term Memory (LSTM) gates manage information across sequences.
- Recurrent Neural Network Regularization: A study on applying dropout to non-recurrent connections in LSTMs to prevent overfitting.
- Neural Machine Translation by Jointly Learning to Align and Translate: The introduction of the attention mechanism, allowing models to focus on specific source words during translation.
- Attention Is All You Need: The seminal Transformer paper that replaced recurrence entirely with self-attention, forming the basis for nearly all modern LLMs.
- The Annotated Transformer: A runnable, line-by-line code implementation of the Transformer architecture.
Advanced Reasoning and Scaling
Beyond basic architectures, the list explores how models reason, scale, and interact with memory.
Memory and Relational Reasoning
- Neural Turing Machines: Combines neural networks with an external read/write memory using differentiable attention.
- A Simple Neural Network Module for Relational Reasoning: Introduces the relation network for reasoning about pairs of objects.
- Relational Recurrent Neural Networks: Integrates self-attention memory into recurrent networks to improve relational reasoning over time.
- Neural Message Passing for Quantum Chemistry: A framework unifying graph neural networks for predicting molecular properties.
Scaling and Efficiency
- Scaling Laws for Neural Language Models: Establishes the empirical power law relationship between model loss and size, data, and compute.
- GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism: A library for splitting massive models across devices to make training practical.
Theoretical Foundations and Intelligence
A significant portion of the list moves beyond engineering into information theory and the nature of intelligence.
Compression and Complexity
- Kolmogorov Complexity: The formal study of the shortest program required to produce a string, serving as the backbone for algorithmic randomness.
- Keeping Neural Networks Simple by Minimizing the Description Length of the Weights: An argument linking generalization to compression, suggesting that the best networks have weights that can be described with few bits.
- A Tutorial Introduction to the Minimum Description Length (MDL) Principle: A guide to model selection based on how well a model compresses data.
- The First Law of Complexodynamics and Quantifying the Rise and Fall of Complexity in Closed Systems (The Coffee Automaton): Essays by Scott Aaronson exploring why complexity in closed systems peaks and falls as they move toward equilibrium.
Intelligence and Superintelligence
- Machine Super Intelligence: A doctoral thesis by Shane Legg proposing a universal measure of machine intelligence and exploring the implications of highly capable agents.
Community Insights and Critiques
Discussion among the technical community highlights both the pedagogical value of the list and the ambiguity of its origin.
On the "Intelligence = Compression" Thesis
Community members noted that the inclusion of Kolmogorov complexity is central to Ilya Sutskever's worldview. As one contributor observed:
"Ilya argues that the reason why neural networks generalize -- why they work at all -- is because they are effectively finding a simple description of their training data, converging down onto the limit of the Kolmorogov complexity."
Pedagogical Suggestions
While the list is highly regarded, some users suggested a more logical reading order. Specifically, it was noted that the paper introducing the attention mechanism should be read before "Attention Is All You Need" to properly understand the evolution of the Transformer.
Provenance and Authenticity
There is ongoing debate regarding the canonical nature of the list. Some users questioned whether the full list was ever officially disclosed or if the current version is a reconstruction based on social media rumors. However, others argue that regardless of the source, the papers selected are widely recognized as the most important pedagogical resources in the field.
Sources
Related
- Dispatch
- Dispatch
- Project
- Dispatch
- Dispatch