ClaimsPeople

Yann LeCun

Yann LeCun is a computer scientist who shared the 2018 ACM Turing Award, is a Jacob T. Schwartz Professor at NYU's Courant Institute, was Meta's Chief AI Scientist and founding director of FAIR, and is Executive Chairman of AMI Labs.

1,175 claims collected, 197 researched, 84 resolved. Report of 4 November 2026, method 0.1.0+c876030c.

Scores by kind of claim

Each kind of claim is scored on its own, out of 100: the share that held up, with the range it likely falls in. Fewer resolved claims give a wider range.

  • Factual claims

    Statements about the present or the past, checked against the record: did they hold up?

    78 72 83

    High confidence, 79 factual claims resolved. From 16 documents, 2006 to 2026; 19 documents sampled from 33 candidates found.

    Not scored: 43 unresolvable.

  • Predictions

    Statements about events outside the person's control, checked once they fell due: did they come true?

    64 43 83

    Low confidence, 5 predictions resolved. From 4 documents, 2010 to 2024; 19 documents sampled from 33 candidates found.

    Not scored: 66 unresolvable. 3 more fall due later.

    Does not yet allow for how likely each prediction was when made.

  • Promises

    Commitments to the person's or organisation's own future action, with something to deliver: was it delivered?

    Insufficient record: 0 promises resolved, 5 needed for a score.

    Not scored: 1 unresolvable.

All types combined: 77 (likely 71 to 82, high confidence), from 84 claims: 79 factual claims, 5 predictions. It mixes kinds of claim in different proportions for different people, so compare people kind by kind.

Yann LeCun's claims

84 claims, sorted by newest said. Choose a claim to read it in full.
VerdictKindSaidClaimTopic
Resolved true Factual 1 Oct 2026 AMI Labs' work is AI for the physical world and is not language-related. Factual · 1 Oct 2026 Their own work or organisation
Resolved true Factual 1 Oct 2026 The OpenAI agents were supposed to be in sandboxes, but the sandboxes were leaky and "horribly designed". Factual · 1 Oct 2026 AI safety and alignment
Resolved false Factual 1 Oct 2026 The OpenAI agents involved in the Hugging Face hacking incident were doing exactly what they had been asked to do. Factual · 1 Oct 2026 AI safety and alignment
Resolved true Factual 1 Oct 2026 AMI Labs builds systems that understand the real world, such as a manufacturing plant or turbojet engine. Factual · 1 Oct 2026 Their own work or organisation
Mostly true Factual 29 Mar 2024 Yann LeCun gave a lecture hosted by the Center of Mathematical Sciences and Applications at Harvard on 2024-03-28 to a full house. Factual · 29 Mar 2024 Their own work or organisation
Mostly true Factual 18 Mar 2024 People can still think even if their language abilities are destroyed by a stroke. Factual · 18 Mar 2024 Philosophy, ethics and society
Mostly true Factual 18 Mar 2024 Transformers are equivariant to permutations, as ConvNets are equivariant to translations. Factual · 18 Mar 2024 AI capabilities
Mostly true Factual 14 Mar 2024 There are currently no AI systems that can teach themselves to drive a car in about 20 hours of practice, as a 17-year-old can. Factual · 14 Mar 2024 AI capabilities
Mostly true Factual 10 Mar 2024 The white-noise-sounding flat-spectrum signal is the pseudo-random bit sequence used to pre-train an adaptive equalizer that cleans up an analog signal into clean bits. Factual · 10 Mar 2024 Technology
Mostly true Factual 8 Mar 2024 Training an encoder to reconstruct images does not lead it to produce good generic image features, though the encoder architecture is good. Factual · 8 Mar 2024 AI capabilities
Mostly true Prediction 8 Mar 2024 Search engines will increasingly be replaced by dialogue systems that answer questions and perhaps point to appropriate references. Prediction · 8 Mar 2024 AI capabilities
Mostly true Factual 8 Mar 2024 Rocket trajectories have been planned using model-based optimization of command sequences since computers existed, essentially since the early 1960s. Factual · 8 Mar 2024 Other
Mixed Factual 8 Mar 2024 For the last 12 to 15 years, people have claimed AGI is just around the corner and have been systematically wrong. Factual · 8 Mar 2024 AI timelines and forecasting
Mostly true Factual 8 Mar 2024 Current LLMs can do none of understanding the physical world, persistent memory, reasoning and planning, or only in a very primitive way. Factual · 8 Mar 2024 AI capabilities
Mostly true Factual 8 Mar 2024 LLMs, including BERT-style bidirectional ones, exploit self-supervised learning, and LeCun has been a very strong advocate of self-supervised learning for many years. Factual · 8 Mar 2024 AI capabilities
Mostly true Factual 8 Mar 2024 Training a base LLM is currently very expensive and difficult, so only a few companies can do it properly. Factual · 8 Mar 2024 Economics and markets
Mostly true Factual 28 Jun 2023 The US is a clear outlier among developed countries in healthcare cost and outcomes. Factual · 28 Jun 2023 Other
Mostly true Factual 28 Jun 2023 The audience YES/NO split at the Munk Debate was 67/33 before the debate and 63/37 after. Factual · 28 Jun 2023 AI safety and alignment
Mostly true Factual 28 Jun 2023 In the official result of the Munk Debate on AI existential threat, the NO side (Mitchell and LeCun) won by 4% over the YES side (Tegmark and Bengio). Factual · 28 Jun 2023 AI safety and alignment
Resolved true Factual 27 Jun 2023 Clément Delangue defended AI open science and open source in his congressional testimony. Factual · 27 Jun 2023 AI policy and governance
Resolved true Factual 23 Jun 2023 Max Tegmark is a professor at MIT. Factual · 23 Jun 2023 Their own work or organisation
Mostly true Factual Jun 2023 Masked autoencoders are less successful with images and other continuous domains than with discrete domains such as language. Factual · Jun 2023 AI capabilities
Mostly true Factual Jun 2023 Probabilistic models require normalization and may become intractable for high-dimensional data. Factual · Jun 2023 AI capabilities
Resolved true Factual Jun 2023 LeCun's proposed AI architecture consists of multiple interconnected modules. Factual · Jun 2023 AI capabilities
Mostly true Factual Jun 2023 With probabilistic models, training is confined to loss functions derived from the negative log-likelihood, such as cross entropy. Factual · Jun 2023 AI capabilities
Mostly true Factual Jun 2023 All modules of the proposed architecture are fully differentiable. Factual · Jun 2023 AI capabilities
Resolved true Factual 4 Mar 2021 Language models pretrained with self-supervised learning achieve considerably higher performance than models trained solely in a supervised manner. Factual · 4 Mar 2021 AI capabilities
Mostly true Factual 4 Mar 2021 Facebook has deployed XLM-R, a model based on its RoBERTa architecture, to improve hate speech classifiers in multiple languages across Facebook and Instagram. Factual · 4 Mar 2021 AI capabilities
Mostly true Factual 4 Mar 2021 LeCun said Facebook AI had created and open sourced SEER, a billion-parameter self-supervised computer vision model that he described as proven to work efficiently with complex, high-dimensional image data. Factual · 4 Mar 2021 AI capabilities
Mostly true Factual 4 Mar 2021 As of March 2021, self-supervised learning had not yet brought computer vision the same improvements it has brought to natural language processing. Factual · 4 Mar 2021 AI capabilities
Mostly true Factual 4 Mar 2021 The Barlow Twins method tries to minimize redundancy between the individual components of the embedding vectors. Factual · 4 Mar 2021 AI capabilities
Resolved true Factual 4 Mar 2021 After pretraining on a billion unlabeled Instagram images and fine-tuning on ImageNet, SEER outperformed state-of-the-art self-supervised systems, reaching 84.2 percent top-1 accuracy on ImageNet. Factual · 4 Mar 2021 AI capabilities
Mostly true Factual 2021 A cat has fewer than 1 billion neurons, while a dog has 2 billion. Factual · 2021 Other
Mostly true Factual 2021 Since the 1990s, algorithms exist that learn oriented edge detectors fully unsupervised with the equivalent of a few minutes of real time. Factual · 2021 AI capabilities
Mostly true Factual 2021 Self-supervised training of visual representations from video has not yet been successful. Factual · 2021 AI capabilities
Resolved true Factual 2021 The American financial payment system is much more lax about signature verification than Europe's. Factual · 2021 Economics and markets
Mostly true Factual 2021 In reinforcement learning the machine receives only a single scalar feedback, and only occasionally. Factual · 2021 AI capabilities
Mostly true Factual 2021 The amount of image training data available for self-supervised learning is essentially unlimited, with billions of new images per day. Factual · 2021 AI compute, hardware and data
Resolved true Factual 31 Aug 2020 Facebook AI released Opacus, a new PyTorch library for machine learning with differential privacy. Factual · 31 Aug 2020 Technology
Resolved true Factual 18 Aug 2020 The FastMRI project is a two-year-old collaboration between NYU Langone Health and Facebook. Factual · 18 Aug 2020 Biosecurity
Mostly true Factual 28 Jun 2019 Jumping spiders can count to three, with categories for one prey, two preys and many preys. Factual · 28 Jun 2019 Other
Mostly true Factual 25 Jun 2019 Nick Clegg, Facebook's VP of global affairs and communications, wrote an op-ed about the future of the Internet. Factual · 25 Jun 2019 AI policy and governance
Resolved true Factual 21 Jun 2019 A new XLM model outperforms BERT on all GLUE tasks when trained on the same data. Factual · 21 Jun 2019 AI capabilities
Resolved true Factual 10 Jun 2019 PyTorch Hub, a repository offering pretrained models such as ResNet, BERT and GPT, was announced on 2019-06-10. Factual · 10 Jun 2019 Technology
Mostly true Factual 3 Jun 2019 The Beijing Academy of Artificial Intelligence's published AI ethics guidelines mention the protection of individual privacy. Factual · 3 Jun 2019 AI policy and governance
Resolved true Factual 2019 In computer vision, the trend is to apply ConvNets to an entire image to detect, segment and recognize objects of any size at any location. Factual · 2019 AI capabilities
Mostly true Factual 2019 The ConvNet architecture was loosely inspired by the ventral pathway in the visual cortex. Factual · 2019 AI capabilities
Mostly true Factual 2019 ReLU nonlinearities and dropout regularization enabled purely supervised backprop training of very deep networks with a dozen layers. Factual · 2019 AI capabilities
Mostly false Factual 2019 Users upload 2 to 3 billion photos on Facebook every day. Factual · 2019 AI compute, hardware and data
Mostly true Prediction 2019 Usage of graph neural networks will increase for a wide variety of applications likely to violate the assumptions of current deep learning hardware. Prediction · 2019 AI compute, hardware and data
Mostly true Prediction 2019 As DL is used for high-level cognitive tasks, memory modules will become commonplace and very large, requiring hardware support. Prediction · 2019 AI compute, hardware and data
Resolved true Factual 28 Jul 2016 There have been a number of recent works putting graphical models on top of ConvNets and training end to end. Factual · 28 Jul 2016 AI capabilities
Mostly true Factual 28 Jul 2016 The check reading system LeCun and a colleague built at Bell Labs in the early 1990s used structured prediction on top of convolutional nets, called Graph Transformer Networks. Factual · 28 Jul 2016 AI capabilities
Resolved true Factual 28 Jul 2016 Yann LeCun gave a recent series of 8 lectures on deep learning at Collège de France in Paris. Factual · 28 Jul 2016 Their own work or organisation
Resolved true Factual 27 May 2015 Deep learning methods have dramatically improved the state of the art in speech recognition, visual object recognition and object detection. Factual · 27 May 2015 AI capabilities
Mixed Factual 27 May 2015 Deep learning methods have dramatically improved the state of the art in many other domains such as drug discovery and genomics. Factual · 27 May 2015 AI capabilities
Mostly true Factual 27 May 2015 Deep learning uses the backpropagation algorithm to indicate how a machine should change the internal parameters that compute each layer's representation from the previous layer's. Factual · 27 May 2015 AI capabilities
Mostly true Factual 27 May 2015 The acknowledgements, dated 2015, state that the authors Y.L. and Y.B. are fellows of the Canadian Institute For Advanced Research (CIFAR). Factual · 27 May 2015 Field building and careers
Mostly true Factual 18 Feb 2015 Deep Learning systems augmented with a memory module are starting to show impressive results in natural language processing. Factual · 18 Feb 2015 AI capabilities
Mostly true Factual 18 Feb 2015 The brain is much better than current artificial models at unsupervised learning. Factual · 18 Feb 2015 AI capabilities
Mostly true Factual 18 Feb 2015 Shallow learning systems have one or two layers, while deep learning systems typically have five to 20 layers. Factual · 18 Feb 2015 AI capabilities
Mostly true Factual 18 Feb 2015 The system would probably not be more accurate, but it can potentially recognize people among hundreds of millions. Factual · 18 Feb 2015 AI capabilities
Mostly true Factual 18 Feb 2015 A typical Deep Learning system is like a box with 500 million knobs, 1,000 light bulbs and 10 million training images. Factual · 18 Feb 2015 AI compute, hardware and data
Mostly true Prediction 18 Feb 2015 Natural language understanding will be the next frontier for Deep Learning. Prediction · 18 Feb 2015 AI timelines and forecasting
Mostly true Factual 18 Feb 2015 A trained classifier may also correctly classify cars and dogs it has never seen before. Factual · 18 Feb 2015 AI capabilities
Mostly true Factual 15 May 2014 The notions of partition functions, entropy, free energy and variational methods prevalent in the graphical models literature come from statistical physics. Factual · 15 May 2014 Science and research methods
Mostly true Factual 15 May 2014 The first commercially viable check reading system, deployed by AT&T/NCR in 1996, used a ConvNet rather than an SVM. Factual · 15 May 2014 AI capabilities
Mostly false Factual 15 May 2014 Convolutional nets were always the record holder on MNIST, and SVMs never really managed to beat them there. Factual · 15 May 2014 AI capabilities
Mostly true Factual 15 May 2014 No one uses generalization bounds to do model selection; practitioners use cross-validation. Factual · 15 May 2014 Science and research methods
Mostly true Factual 15 May 2014 Speech is a domain with access to ridiculously large amounts of data and a very large number of categories. Factual · 15 May 2014 AI capabilities
Mostly true Factual 15 May 2014 Facebook AI Research uses Torch7 for many projects, as do Deep Mind and several groups at Google. Factual · 15 May 2014 Technology
Mostly true Prediction 2010 In the next decade, a major challenge of computer vision, machine learning and AI will be devising methods that learn good feature hierarchies from unlabeled and labeled data in an integrated fashion. Prediction · 2010 AI capabilities
Resolved true Factual 2010 Each stage of a ConvNet is composed of a filter bank, some non-linearities, and feature pooling layers. Factual · 2010 AI capabilities
Resolved true Factual 2010 The idea behind multi-stage Hubel-Wiesel architectures is rooted in Hubel and Wiesel's 1962 work on the cat's primary visual cortex. Factual · 2010 Science and research methods
Mostly true Factual 2010 A face detection application on the CNP system was demonstrated achieving 10 fps on VGA images. Factual · 2010 AI compute, hardware and data
Mixed Factual 2010 ConvNets have been successfully deployed in many commercial applications from OCR to video surveillance, but require large amounts of labeled training samples. Factual · 2010 AI capabilities
Mostly true Factual 2010 Convolutional Networks are a biologically inspired trainable architecture that can learn invariant features. Factual · 2010 AI capabilities
Resolved true Factual 2010 In many problems labeled data is scarce whereas unlabeled data is abundant. Factual · 2010 AI capabilities
Mostly true Factual 2006 The hinge loss with G_W(X)=W^T X and a ||W||^2 regularizer gives the linear support vector machine. Factual · 2006 AI capabilities
Mostly true Factual 2006 The hinge loss systematically chooses the most offending incorrect answer as the one whose energy is pulled up. Factual · 2006 AI capabilities
Resolved true Factual 2006 The generalized perceptron loss is always positive because its second term is a lower bound on its first term. Factual · 2006 Science and research methods
Mostly true Factual 2006 Support vector Markov models, max-margin Markov networks and conditional random fields are all sequence modeling systems that use linearly parameterized energy factors. Factual · 2006 AI capabilities
Resolved true Factual 2006 Inference algorithms in energy-based learning often give only approximate answers or do not guarantee finding the global energy minimum. Factual · 2006 AI capabilities
Resolved true Factual 2006 Each NLL iteration involves considerably more work because pushing up every incorrect answer is expensive when the second term's derivative has no analytical form. Factual · 2006 AI capabilities
Back to the list

Yann LeCun

Open its page

Factual AI capabilities

“With probabilistic models, the training is confined to loss functions generated from the negative log-likelihood like the cross entropy.”

Anna Dawid and Yann LeCun, authors June 2023 Introduction to Latent Variable Energy-Based Models (Les Houches lecture notes) (arXiv)

With probabilistic models, training is confined to loss functions derived from the negative log-likelihood, such as cross entropy.

Mostly true True in substance, wrong in a detail.

What would count as true or false

This is a technical claim about machine learning, judged as of June 2023. True: the accepted understanding is that training a model as a probabilistic (normalized-likelihood) model means minimising negative log-likelihood or losses derived from it (cross-entropy, KL), with other losses falling outside the probabilistic framing. Mostly true: this is the standard view, with minor recognised exceptions (for example score matching or noise-contrastive estimation, which still serve as likelihood surrogates). Mixed: substantial and widely used probabilistic training methods do not derive from NLL, so the claim holds only for maximum-likelihood training. Mostly false: many standard probabilistic models are routinely trained with losses not derived from NLL (for example adversarial, score matching, proper scoring rules such as CRPS, Bayesian/variational objectives not reducible to NLL), so "confined" overstates a common practice. False: the evidence shows probabilistic models are not tied to NLL-type losses in general.

Evidence

  1. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, NYU (to appear in Predicting Structured Data, MIT Press, 2006) · 19 August 2006 Own record
    “Probabilistic learning is a special case of energy-based learning where the loss function is the negative log-likelihood, a.k.a. the maximum mutual information criterion.”
  2. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, NYU (to appear in Predicting Structured Data, MIT Press, 2006) · 19 August 2006 Own record
    “Estimating the parameters of a probabilistic model can be performed in a number of different ways, including maximum likelihood estimation with Bayes inversion, maximum conditional likelihood estimation, and (when possible) Bayesian averaging (possibly with variational approximations).”
  3. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, NYU (to appear in Predicting Structured Data, MIT Press, 2006) · 19 August 2006 Own record
    “Energy-based methods are equally well justified as probabilistic methods. They are merely designed for training models to answer a different kind of question than probabilistic models.”
  4. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, New York University (authors LeCun, Chopra, Hadsell, Ranzato, Huang; chapter for MIT Press volume 'Predicting Structured Data') · 19 August 2006 Own record
    “Estimating the parameters of a probabilistic model can be performed in a number of different ways, including maximum likelihood estimation with Bayes inversion, maximum conditional likelihood estimation, and (when possible) Bayesian averaging (possibly with variational approximations). Maximizing the conditional likelihood of the training samples is equivalent to minimizing what we called the negative log-likelihood loss.”
  5. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, New York University (authors LeCun, Chopra, Hadsell, Ranzato, Huang; chapter for MIT Press volume 'Predicting Structured Data') · 19 August 2006 Own record
    “Most probabilistic models can be viewed as special types of energy-based models in which the energy function satisfies certain normalizability conditions, and in which the loss function, optimized by learning, has a particular form.”
  6. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, New York University (authors LeCun, Chopra, Hadsell, Ranzato, Huang; chapter for MIT Press volume 'Predicting Structured Data') · 19 August 2006 Own record
    “Energy-based methods are equally well justified as probabilistic methods. They are merely designed for training models to answer a different kind of question than probabilistic models.”
  7. A Tutorial on Energy-Based Learning Courant Institute of Mathematical Sciences, New York University (authors LeCun, Chopra, Hadsell, Ranzato, Huang; chapter for MIT Press volume 'Predicting Structured Data') · 19 August 2006 Own record
    “In this context, using an energy-based loss function other than the negative log-likelihood can be seen as a sampling method with a particular policy for picking the answers whose energy will be pulled up.”
  8. Estimation of Non-Normalized Statistical Models by Score Matching Journal of Machine Learning Research (JMLR), via jmlr.csail.mit.edu · 2005
    “Here, we propose that such models can be estimated by minimizing the expected squared distance between the gradient of the log-density given by the model and the gradient of the log-density of the observed data.”
  9. Sliced Score Matching: A Scalable Approach to Density and Score Estimation Ermon Group (Stanford), ermongroup.github.io
    “The de facto standard for learning a probability model is maximum likelihood (MLE). However, it is not suitable for learning unnormalized probability models, because the likelihood function”
  10. Sliced Score Matching: A Scalable Approach to Density and Score Estimation Ermon Group (Stanford), ermongroup.github.io
    “Instead of using likelihood as the objective, score matching is based on the following objective”

Reasoning

An independent explainer describes maximum likelihood as the de facto standard for learning a probability model (E10), consistent with the claim that probabilistic training uses NLL-derived losses (E1, E5). However, score matching trains unnormalized probability models with a non-likelihood objective (E9, E11), and the subject's own tutorial lists Bayesian averaging, possibly with variational approximations, alongside maximum likelihood as ways to estimate probabilistic models (E3). These match the criteria's recognised minor exceptions, so "confined" slightly overstates the standard view.

Cite this claim

Yann LeCun, “With probabilistic models, training is confined to loss functions derived from the negative log-likelihood, such as cross entropy.” (said June 2023). Verdict: mostly true. Reliability API, claim c_bd7d985fd8d9, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_bd7d985fd8d9

Claims without a verdict

Is a verdict here wrong, or do you speak for Yann LeCun? Reply on the claim's own page, with the form at its foot (how replies work). Verdicts are made automatically; how verdicts and scores are made.