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.

10
paths
80
readings
11
tracks
10
paths
80
papers
80
catalog
01Executable transformer walkthrough2018 · Tutorial

The Annotated Transformer

Alexander M. Rush

Details
Why it is here

A code-first explanation of the transformer that makes the architecture concrete before heavier papers.

Read for

Use it to connect equations, modules, and implementation details.

Source
02Complexity intuition2011 · Essay

The First Law of Complexodynamics

Scott Aaronson

Details
Why it is here

Builds intuition for why complexity can rise and fall rather than only accumulate.

Read for

Read as a conceptual lens for later compression and representation readings.

Source
03Sequence modeling intuition2015 · Essay

The Unreasonable Effectiveness of Recurrent Neural Networks

Andrej Karpathy

Details
Why it is here

Shows how simple character-level recurrent models learn surprising structure.

Read for

Pay attention to the qualitative behavior of learned sequence models.

Source
04Gated memory2015 · Tutorial

Understanding LSTM Networks

Christopher Olah

Details
Why it is here

Explains the gating mechanism that made recurrent memory easier to reason about.

Read for

Understand the cell state and gates before reading recurrent regularization work.

Source
05Training recurrent nets2014 · arXiv

Recurrent Neural Network Regularization

Wojciech Zaremba, Ilya Sutskever, Oriol Vinyals

Details
Why it is here

Studies dropout placement for recurrent networks without destroying temporal memory.

Read for

Notice how a small regularization detail changes sequence-model training behavior.

Source
06Simplicity prior1993 · COLT

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

Geoffrey E. Hinton, Drew van Camp

Details
Why it is here

Connects neural-network regularization to a compression-style preference for simpler explanations.

Read for

Use it as the bridge from practical regularization to MDL-style thinking.

Source
07Attention as addressing2015 · NeurIPS

Pointer Networks

Oriol Vinyals, Meire Fortunato, Navdeep Jaitly

Details
Why it is here

Uses attention to choose positions in the input sequence as outputs.

Read for

Read for attention as selection rather than only summarization.

Source
08Deep vision breakthrough2012 · NeurIPS

ImageNet Classification with Deep Convolutional Neural Networks

Alex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton

Details
Why it is here

Marks the practical arrival of large convolutional networks on ImageNet-scale vision.

Read for

Separate the architecture from the compute, data, and training choices that made it work.

Source
09Permutation-sensitive sequence learning2015 · arXiv

Order Matters: Sequence to Sequence for Sets

Oriol Vinyals, Samy Bengio, Manjunath Kudlur

Details
Why it is here

Explores how sequence models behave when the target object is naturally unordered.

Read for

Read for the mismatch between model order and problem structure.

Source
10Training scale2018 · arXiv

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

Details
Why it is here

Shows a practical route for splitting large model training across accelerator partitions.

Read for

Read for the systems bottleneck: scale needs scheduling as much as architecture.

Source
11Residual depth2015 · CVPR

Deep Residual Learning for Image Recognition

Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun

Details
Why it is here

Makes very deep convolutional networks easier to optimize through residual connections.

Read for

Understand why identity-style paths help gradients and representation reuse.

Source
12Large context without pooling2015 · ICLR

Multi-Scale Context Aggregation by Dilated Convolutions

Fisher Yu, Vladlen Koltun

Details
Why it is here

Uses dilation to expand receptive fields while preserving resolution.

Read for

Read for the tradeoff between local detail and broad context in vision models.

Source
13Graph neural networks2017 · ICML

Neural Message Passing for Quantum Chemistry

Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, George E. Dahl

Details
Why it is here

Frames molecule modeling as message passing over graph structure.

Read for

Use it to understand graph computation as repeated local communication.

Source
14Transformer architecture2017 · NeurIPS

Attention Is All You Need

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, Illia Polosukhin

Details
Why it is here

Replaces recurrence with stacked attention and feed-forward blocks.

Read for

Spend time on multi-head attention, positional information, and parallelism.

Source
15Attention precursor2014 · ICLR

Neural Machine Translation by Jointly Learning to Align and Translate

Dzmitry Bahdanau, Kyunghyun Cho, Yoshua Bengio

Details
Why it is here

Introduces alignment-style attention for translation models.

Read for

Read before or after transformers to see what changed and what carried forward.

Source
16Residual refinement2016 · ECCV

Identity Mappings in Deep Residual Networks

Kaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun

Details
Why it is here

Clarifies the role of identity paths in residual network optimization.

Read for

Read after ResNet to understand why the skip path details matter.

Source
17Relational module2017 · NeurIPS

A Simple Neural Network Module for Relational Reasoning

Adam Santoro, David Raposo, David G. T. Barrett, Mateusz Malinowski, Razvan Pascanu, Peter Battaglia, Timothy Lillicrap

Details
Why it is here

Introduces a simple module for pairwise relational reasoning over objects.

Read for

Track how object representations become inputs to explicit relation computation.

Source
18Lossy representation2016 · arXiv

Variational Lossy Autoencoder

Xi Chen, Diederik P. Kingma, Tim Salimans, Yan Duan, Prafulla Dhariwal, John Schulman, Ilya Sutskever, Pieter Abbeel

Details
Why it is here

Separates useful latent structure from nuisance detail in a variational setting.

Read for

Read for what a representation should keep and discard.

Source
19Relational memory2018 · NeurIPS

Relational Recurrent Neural Networks

Adam Santoro, Ryan Faulkner, David Raposo, Jack Rae, Mike Chrzanowski, Theophane Weber, Daan Wierstra, Oriol Vinyals, Razvan Pascanu, Timothy Lillicrap

Details
Why it is here

Combines recurrent state with relational computation over memory slots.

Read for

Compare this with plain LSTMs and later attention-based memory.

Source
20Complexity toy model2014 · arXiv

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

Scott Aaronson, Sean M. Carroll, Lauren Ouellette

Details
Why it is here

Turns the complexodynamics intuition into a small formal model.

Read for

Use it as a theory-side complement to representation-learning papers.

Source
21External memory2014 · arXiv

Neural Turing Machines

Alex Graves, Greg Wayne, Ivo Danihelka

Details
Why it is here

Augments neural networks with differentiable memory access.

Read for

Read for the memory interface and addressing mechanism.

Source
22End-to-end scale2015 · ICML

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

Details
Why it is here

Demonstrates end-to-end speech recognition at large data and compute scale.

Read for

Read for the scaling and systems recipe, not only the acoustic model.

Source
23Scaling economics2020 · arXiv

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

Details
Why it is here

Quantifies how loss varies with model size, data, and compute.

Read for

Focus on the compute allocation mindset and its assumptions.

Source
24MDL foundation2004 · arXiv

A Tutorial Introduction to the Minimum Description Length Principle

Peter D. Grünwald

Details
Why it is here

Introduces model selection as compression in a clear tutorial form.

Read for

Read before making broad claims about compression and intelligence.

Source
25Intelligence framing2008 · Dissertation

Machine Super Intelligence

Shane Legg

Details
Why it is here

A dissertation-length treatment of machine intelligence and capability framing.

Read for

Skim for definitions and assumptions rather than implementation technique.

Source
26Algorithmic information theory2017 · Book

Kolmogorov Complexity and Algorithmic Randomness

Alexander Shen, Vladimir A. Uspensky, Nikolay Vereshchagin

Details
Why it is here

Provides the mathematical background for complexity and randomness claims.

Read for

Use selectively; the list points readers to later sections, not necessarily cover-to-cover reading.

Source
27Vision course backbone2016 · Course

CS231n: Convolutional Neural Networks for Visual Recognition

Stanford CS231n Staff

Details
Why it is here

A practical course bridge for convolutional networks, optimization, and visual recognition.

Read for

Use it to ground the vision papers in implementation and training practice.

Source