TellWorldAI World Archive

Home›Papers

Papers

Papers

Papers that changed AI, with a plain-language explainer for each.

Total 63 · Clear filters

  1. 2016

    SQuAD: 100,000+ Questions for Machine Comprehension of Text

    arXiv

    SQuAD is a reading-comprehension dataset of more than 100,000 crowdworker questions on Wikipedia articles, each answered by a span of its passage. Released in 2016, it gave machine comprehension a large, freely available benchmark with a measured human ceiling.

    Large language modelsResearch historyData & datasets

  2. 2014

    GloVe: Global Vectors for Word Representation

    EMNLP 2014

    GloVe is a 2014 method that learns word vectors by factorising global word co-occurrence counts. Released together with pre-trained vectors, it became, alongside word2vec, one of the two standard ways of producing static word embeddings.

    Research historyDeep learningData & datasets

  3. 2014

    Neural Machine Translation by Jointly Learning to Align and Translate

    ICLR

    Submitted to arXiv in September 2014 by Dzmitry Bahdanau, Kyunghyun Cho and Yoshua Bengio, this paper let a translation model look back at the whole source sentence while producing each word. This mechanism, called attention, later became a basis for Transformer models.

    Large language modelsResearch historyDeep learning

  4. 2014

    Generative Adversarial Nets

    arXiv

    Goodfellow, Bengio, and co-authors proposed a generative-model framework with adversarially trained generator and discriminator.

    Research historyDeep learningGenerative models

  5. 2014

    Microsoft COCO: Common Objects in Context

    arXiv

    A 2014 paper introducing Microsoft COCO, a large dataset of everyday scenes in which common objects are labeled with per-instance segmentations, built to study object recognition as part of scene understanding.

    Research historyData & datasetsComputer vision

  6. 2013

    Auto-Encoding Variational Bayes

    arXiv

    A 2013 paper by Diederik P. Kingma and Max Welling that introduced a stochastic variational inference and learning algorithm for directed latent-variable models with intractable posteriors, making approximate inference practical on large datasets.

    Research historyDeep learningGenerative models

  7. 2011

    Deep Sparse Rectifier Neural Networks

    A 2011 paper by Glorot, Bordes and Bengio reporting that deep networks built from rectifying neurons match or beat tanh networks and reach their best performance without unsupervised pre-training on large labelled supervised tasks.

    Research historyDeep learningData & datasets

  8. 2010

    Phone recognition with the mean-covariance restricted Boltzmann Machine

    NIPS

    A 2010 NIPS paper by Dahl, Ranzato, Mohamed and Hinton applies Deep Belief Nets and a mean-covariance RBM to acoustic modeling, reaching 20.5% phone error on speaker-independent TIMIT phone recognition.

    Research historyDeep learningGenerative models

  9. 2009

    ImageNet: A Large-Scale Hierarchical Image Database

    CVPR

    The 2009 paper introduced ImageNet, a large, cleanly labelled image database organised by the WordNet hierarchy. It later became the basis of an annual benchmark, the ImageNet Large Scale Visual Recognition Challenge.

    Research historyDeep learningData & datasets

  10. 2009

    Learning Multiple Layers of Features from Tiny Images

    UT

    A 2009 technical report by Alex Krizhevsky that introduces CIFAR-10 and CIFAR-100 and studies multi-layer generative models for learning features from tiny colour images.

    Research historyDeep learningData & datasets

  11. 2006

    A fast learning algorithm for deep belief nets

    Neural Computation

    A 2006 paper by Hinton, Osindero and Teh that uses complementary priors and a greedy layer-by-layer algorithm to train deep belief nets, then fine-tunes them; the resulting three-hidden-layer model both modelled and classified handwritten digits well.

    Research historyDeep learningGenerative models

  12. 2004

    MapReduce: Simplified Data Processing on Large Clusters

    OSDI

    Jeffrey Dean and Sanjay Ghemawat's 2004 OSDI paper presents MapReduce, a programming model in which users write a map function and a reduce function while the run-time system parallelizes the work across large clusters of commodity machines.

    Research historyData & datasetsDeveloper tools

  13. 2003

    Latent Dirichlet Allocation

    JMLR

    A generative probabilistic model that represents each document as a finite mixture over topics, fitted with variational approximate inference and EM, and evaluated on document modelling, text classification and collaborative filtering.

    Research historyGenerative modelsData & datasets

  14. 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.

    Research historyDeep learningData & datasets

  15. 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.

    Research historyEnterpriseData & datasets

  16. 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.

    Research historyDeep learningData & datasets

  17. 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.

    Research historyEnterpriseData & datasets

  18. 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.

    Research historyDeep learningData & datasets

  19. 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.

    Large language modelsResearch historyData & datasets

  20. 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]

    Research historyDeep learningData & datasets