Home›Papers
Papers
Papers
Papers that changed AI, with a plain-language explainer for each.
Total 79 · Clear filters
- 2001
Random Forests
Machine Learning
Leo Breiman's 2001 paper defines random forests as combinations of tree predictors whose random vectors are sampled independently from the same distribution, analyzes generalization error through tree strength and correlation, and reports error rates competitive with Adaboost and more robust to noise.
- 1999
The PageRank Citation Ranking: Bringing Order to the Web
Brin and Page's PageRank technical report treats hyperlinks as citations to rank web pages and was used to build Google's search engine; it is one of the heavily cited papers on their early work.
- 1998
Gradient-Based Learning Applied to Document Recognition
Proc. IEEE
LeCun, Bottou, Bengio and Haffner’s 1998 review argued that learning systems should replace hand-designed features. It showed that convolutional networks such as LeNet-5 outperformed other methods on handwritten digits, and it introduced the MNIST dataset.
- 1998
The Anatomy of a Large-Scale Hypertextual Web Search Engine
A 1998 conference paper by Sergey Brin and Lawrence Page describing PageRank, an algorithm that ranks web pages by the number and quality of links pointing to them, and the search engine built on that algorithm.
- 1995
Support-vector networks
Machine Learning
Corinna Cortes and Vladimir Vapnik's 1995 paper presents a learning machine for two-group classification that maps inputs nonlinearly into a high-dimensional feature space, constructs a linear decision surface, and extends earlier work from separable to non-separable data.
- 1993
Building a Large Annotated Corpus of English: The Penn Treebank
Computational Linguistics
A 1993 journal article by Mitchell P. Marcus, Beatrice Santorini and Mary Ann Marcinkiewicz describing the Penn Treebank: over one million words of Wall Street Journal text annotated with syntactic bracketing, built as a resource for work on English sentence structure.
- 1992
A Training Algorithm for Optimal Margin Classifiers
Published in 1992, this paper by Boser, Guyon and Vapnik presents a training algorithm that maximizes the margin between training patterns and the decision boundary, with experiments on optical character recognition.[^1]
- 1992
Practical issues in temporal difference learning (TD-Gammon)
Machine Learning
Gerald Tesauro's 1992 paper tested whether temporal difference learning could master a complex real-world task, using self-play backgammon as the case study.
- 1992
Q-learning
Machine Learning
A 1992 technical note by Watkins and Dayan that set out Q-learning, an incremental and computationally light way for an agent to learn optimal action values, and proved it converges to the optimum with probability 1.
- 1990
Elephants Don't Play Chess
Rodney Brooks's 1990 paper argued for building artificial intelligence from the ground up, with ongoing physical interaction with the environment as the main constraint on design, rather than through the abstract manipulation of symbols that had dominated the field for roughly thirty years.
- 1988
Learning to predict by the methods of temporal differences
Machine Learning
Richard Sutton's 1988 paper introduced temporal-difference learning, a family of incremental prediction methods that assign credit from changes between successive predictions and are shown to be more economical and accurate than conventional supervised approaches on most prediction problems.
- 1986
Learning representations by back-propagating errors
Nature
In a 1986 Nature paper, Rumelhart, Hinton and Williams showed that backpropagation lets hidden units in a multilayer network learn useful internal features of a task. The method is standard in most neural networks today.
- 1985
A Learning Algorithm for Boltzmann Machines
Cognitive Science 9
A 1985 Cognitive Science paper by Ackley, Hinton and Sejnowski that presents a general learning rule for connectionist networks and reports simple examples of efficient internal representations.
- 1982
Neural networks and physical systems with emergent collective computational abilities
PNAS
A 1982 paper by John J. Hopfield showing that large networks of simple neuron-like units can collectively store and recall memories. It became known as the Hopfield network, and the work was recognised by the 2024 Nobel Prize in Physics.
- 1982
Neural networks and physical systems with emergent collective computational abilities
PNAS
A 1982 paper by John J. Hopfield arguing that useful computation can emerge as a collective property of many simple, equivalent units, and describing a model whose collective behaviour gives content-addressable memory, generalisation and error correction.
- 1969
Perceptrons: An Introduction to Computational Geometry
A 1969 book by Marvin Minsky and Seymour Papert that proved mathematical limits on what single-layer perceptrons can compute — notably that they cannot compute parity or connectedness — and has long been credited with steering research away from neural networks.
- 1966
ELIZA - A Computer Program for the Study of Natural Language Communication Between Man and Machine
Communications of the ACM 9(1)
A January 1966 paper by Joseph Weizenbaum presenting ELIZA, a program on MIT's MAC time-sharing system that used keyword-triggered decomposition and reassembly rules to enable certain natural-language conversations between people and computers.
- 1959
Some Studies in Machine Learning Using the Game of Checkers
IJRD
A. L. Samuel's 1959 paper reporting experiments in which a checkers program, given only the rules of the game and an imperfect set of parameters, learned in 8 to 10 hours of playing time to beat the person who wrote it.
- 1948
A Mathematical Theory of Communication
Bell System Technical Journal 27
C. E. Shannon's 1948 paper set out a mathematical framework for communication, defining information in bits, channel capacity, and entropy, and treating messages statistically while setting aside semantic meaning.