Curated reading paths
Turn a paper pile into a reading system.
Ordered research paths with short briefs, source links, provenance notes, and citation-manager exports. researchPapers is the discovery layer for deciding what to read and why.
Copyright-safe by design: the catalog contains bibliographic metadata, source links, and original notes only. It does not host PDFs, copy abstracts, or reproduce long excerpts.
01Executable transformer walkthrough2018 · TutorialThe Annotated Transformer
Alexander M. Rush
Details
The Annotated Transformer
Alexander M. Rush
A code-first explanation of the transformer that makes the architecture concrete before heavier papers.
Use it to connect equations, modules, and implementation details.
02Complexity intuition2011 · EssayThe First Law of Complexodynamics
Scott Aaronson
Details
The First Law of Complexodynamics
Scott Aaronson
Builds intuition for why complexity can rise and fall rather than only accumulate.
Read as a conceptual lens for later compression and representation readings.
03Sequence modeling intuition2015 · EssayThe Unreasonable Effectiveness of Recurrent Neural Networks
Andrej Karpathy
Details
The Unreasonable Effectiveness of Recurrent Neural Networks
Andrej Karpathy
Shows how simple character-level recurrent models learn surprising structure.
Pay attention to the qualitative behavior of learned sequence models.
04Gated memory2015 · TutorialUnderstanding LSTM Networks
Christopher Olah
Details
Understanding LSTM Networks
Christopher Olah
Explains the gating mechanism that made recurrent memory easier to reason about.
Understand the cell state and gates before reading recurrent regularization work.
05Training recurrent nets2014 · arXivRecurrent Neural Network Regularization
Wojciech Zaremba, Ilya Sutskever, Oriol Vinyals
Details
Recurrent Neural Network Regularization
Wojciech Zaremba, Ilya Sutskever, Oriol Vinyals
Studies dropout placement for recurrent networks without destroying temporal memory.
Notice how a small regularization detail changes sequence-model training behavior.
06Simplicity prior1993 · COLTKeeping Neural Networks Simple by Minimizing the Description Length of the Weights
Geoffrey E. Hinton, Drew van Camp
Details
Keeping Neural Networks Simple by Minimizing the Description Length of the Weights
Geoffrey E. Hinton, Drew van Camp
Connects neural-network regularization to a compression-style preference for simpler explanations.
Use it as the bridge from practical regularization to MDL-style thinking.
07Attention as addressing2015 · NeurIPSPointer Networks
Oriol Vinyals, Meire Fortunato, Navdeep Jaitly
Details
Pointer Networks
Oriol Vinyals, Meire Fortunato, Navdeep Jaitly
Uses attention to choose positions in the input sequence as outputs.
Read for attention as selection rather than only summarization.
08Deep vision breakthrough2012 · NeurIPSImageNet Classification with Deep Convolutional Neural Networks
Alex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton
Details
ImageNet Classification with Deep Convolutional Neural Networks
Alex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton
Marks the practical arrival of large convolutional networks on ImageNet-scale vision.
Separate the architecture from the compute, data, and training choices that made it work.
09Permutation-sensitive sequence learning2015 · arXivOrder Matters: Sequence to Sequence for Sets
Oriol Vinyals, Samy Bengio, Manjunath Kudlur
Details
Order Matters: Sequence to Sequence for Sets
Oriol Vinyals, Samy Bengio, Manjunath Kudlur
Explores how sequence models behave when the target object is naturally unordered.
Read for the mismatch between model order and problem structure.
10Training scale2018 · arXivGPipe: Easy Scaling with Micro-Batch Pipeline Parallelism
Yanping Huang, Youlong Cheng, Ankur Bapna, Orhan Firat, Mia Xu Chen, Dehao Chen, HyoukJoong Lee, Jiquan Ngiam, Quoc V. Le, Yonghui Wu, Zhifeng Chen
Details
GPipe: Easy Scaling with Micro-Batch Pipeline Parallelism
Yanping Huang, Youlong Cheng, Ankur Bapna, Orhan Firat, Mia Xu Chen, Dehao Chen, HyoukJoong Lee, Jiquan Ngiam, Quoc V. Le, Yonghui Wu, Zhifeng Chen
Shows a practical route for splitting large model training across accelerator partitions.
Read for the systems bottleneck: scale needs scheduling as much as architecture.
11Residual depth2015 · CVPRDeep Residual Learning for Image Recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun
Details
Deep Residual Learning for Image Recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun
Makes very deep convolutional networks easier to optimize through residual connections.
Understand why identity-style paths help gradients and representation reuse.
12Large context without pooling2015 · ICLRMulti-Scale Context Aggregation by Dilated Convolutions
Fisher Yu, Vladlen Koltun
Details
Multi-Scale Context Aggregation by Dilated Convolutions
Fisher Yu, Vladlen Koltun
Uses dilation to expand receptive fields while preserving resolution.
Read for the tradeoff between local detail and broad context in vision models.
13Graph neural networks2017 · ICMLNeural Message Passing for Quantum Chemistry
Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, George E. Dahl
Details
Neural Message Passing for Quantum Chemistry
Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, George E. Dahl
Frames molecule modeling as message passing over graph structure.
Use it to understand graph computation as repeated local communication.
14Transformer architecture2017 · NeurIPSAttention Is All You Need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, Illia Polosukhin
Details
Attention Is All You Need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, Illia Polosukhin
Replaces recurrence with stacked attention and feed-forward blocks.
Spend time on multi-head attention, positional information, and parallelism.
15Attention precursor2014 · ICLRNeural Machine Translation by Jointly Learning to Align and Translate
Dzmitry Bahdanau, Kyunghyun Cho, Yoshua Bengio
Details
Neural Machine Translation by Jointly Learning to Align and Translate
Dzmitry Bahdanau, Kyunghyun Cho, Yoshua Bengio
Introduces alignment-style attention for translation models.
Read before or after transformers to see what changed and what carried forward.
16Residual refinement2016 · ECCVIdentity Mappings in Deep Residual Networks
Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun
Details
Identity Mappings in Deep Residual Networks
Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun
Clarifies the role of identity paths in residual network optimization.
Read after ResNet to understand why the skip path details matter.
17Relational module2017 · NeurIPSA Simple Neural Network Module for Relational Reasoning
Adam Santoro, David Raposo, David G. T. Barrett, Mateusz Malinowski, Razvan Pascanu, Peter Battaglia, Timothy Lillicrap
Details
A Simple Neural Network Module for Relational Reasoning
Adam Santoro, David Raposo, David G. T. Barrett, Mateusz Malinowski, Razvan Pascanu, Peter Battaglia, Timothy Lillicrap
Introduces a simple module for pairwise relational reasoning over objects.
Track how object representations become inputs to explicit relation computation.
18Lossy representation2016 · arXivVariational Lossy Autoencoder
Xi Chen, Diederik P. Kingma, Tim Salimans, Yan Duan, Prafulla Dhariwal, John Schulman, Ilya Sutskever, Pieter Abbeel
Details
Variational Lossy Autoencoder
Xi Chen, Diederik P. Kingma, Tim Salimans, Yan Duan, Prafulla Dhariwal, John Schulman, Ilya Sutskever, Pieter Abbeel
Separates useful latent structure from nuisance detail in a variational setting.
Read for what a representation should keep and discard.
19Relational memory2018 · NeurIPSRelational Recurrent Neural Networks
Adam Santoro, Ryan Faulkner, David Raposo, Jack Rae, Mike Chrzanowski, Theophane Weber, Daan Wierstra, Oriol Vinyals, Razvan Pascanu, Timothy Lillicrap
Details
Relational Recurrent Neural Networks
Adam Santoro, Ryan Faulkner, David Raposo, Jack Rae, Mike Chrzanowski, Theophane Weber, Daan Wierstra, Oriol Vinyals, Razvan Pascanu, Timothy Lillicrap
Combines recurrent state with relational computation over memory slots.
Compare this with plain LSTMs and later attention-based memory.
20Complexity toy model2014 · arXivQuantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton
Scott Aaronson, Sean M. Carroll, Lauren Ouellette
Details
Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton
Scott Aaronson, Sean M. Carroll, Lauren Ouellette
Turns the complexodynamics intuition into a small formal model.
Use it as a theory-side complement to representation-learning papers.
21External memory2014 · arXivNeural Turing Machines
Alex Graves, Greg Wayne, Ivo Danihelka
Details
Neural Turing Machines
Alex Graves, Greg Wayne, Ivo Danihelka
Augments neural networks with differentiable memory access.
Read for the memory interface and addressing mechanism.
22End-to-end scale2015 · ICMLDeep Speech 2: End-to-End Speech Recognition in English and Mandarin
Dario Amodei, Rishita Anubhai, Eric Battenberg, Carl Case, Jared Casper, Bryan Catanzaro, Jingdong Chen, Mike Chrzanowski
Details
Deep Speech 2: End-to-End Speech Recognition in English and Mandarin
Dario Amodei, Rishita Anubhai, Eric Battenberg, Carl Case, Jared Casper, Bryan Catanzaro, Jingdong Chen, Mike Chrzanowski
Demonstrates end-to-end speech recognition at large data and compute scale.
Read for the scaling and systems recipe, not only the acoustic model.
23Scaling economics2020 · arXivScaling Laws for Neural Language Models
Jared Kaplan, Sam McCandlish, Tom Henighan, Tom B. Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, Dario Amodei
Details
Scaling Laws for Neural Language Models
Jared Kaplan, Sam McCandlish, Tom Henighan, Tom B. Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, Dario Amodei
Quantifies how loss varies with model size, data, and compute.
Focus on the compute allocation mindset and its assumptions.
24MDL foundation2004 · arXivA Tutorial Introduction to the Minimum Description Length Principle
Peter D. Grünwald
Details
A Tutorial Introduction to the Minimum Description Length Principle
Peter D. Grünwald
Introduces model selection as compression in a clear tutorial form.
Read before making broad claims about compression and intelligence.
25Intelligence framing2008 · DissertationMachine Super Intelligence
Shane Legg
Details
Machine Super Intelligence
Shane Legg
A dissertation-length treatment of machine intelligence and capability framing.
Skim for definitions and assumptions rather than implementation technique.
26Algorithmic information theory2017 · BookKolmogorov Complexity and Algorithmic Randomness
Alexander Shen, Vladimir A. Uspensky, Nikolay Vereshchagin
Details
Kolmogorov Complexity and Algorithmic Randomness
Alexander Shen, Vladimir A. Uspensky, Nikolay Vereshchagin
Provides the mathematical background for complexity and randomness claims.
Use selectively; the list points readers to later sections, not necessarily cover-to-cover reading.
27Vision course backbone2016 · CourseCS231n: Convolutional Neural Networks for Visual Recognition
Stanford CS231n Staff
Details
CS231n: Convolutional Neural Networks for Visual Recognition
Stanford CS231n Staff
A practical course bridge for convolutional networks, optimization, and visual recognition.
Use it to ground the vision papers in implementation and training practice.