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

23 claims

23 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 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
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
Resolved true Factual Jun 2023 LeCun's proposed AI architecture consists of multiple interconnected modules. 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
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
Resolved true Factual 2021 The American financial payment system is much more lax about signature verification than Europe's. Factual · 2021 Economics and markets
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
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
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
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
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
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
Resolved true Factual 2010 In many problems labeled data is scarce whereas unlabeled data is abundant. Factual · 2010 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
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

“Very often, the inference algorithm can only give us an approximate answer, or is not guaranteed to give us the global minimum of the energy.”

Yann LeCun et al., tutorial authors 2006 A Tutorial on Energy-Based Learning (yann.lecun.com)

Inference algorithms in energy-based learning often give only approximate answers or do not guarantee finding the global energy minimum.

Resolved true The record shows it happened or was so.

The second judge would not resolve this claim; the verdict shown is the first judge's.

What would count as true or false

Judge as of 2006 against the energy-based learning and optimisation literature of that time. True: standard sources (textbooks, surveys, the energy-based learning tutorial literature) show that in many practical energy-based models the inference step (minimising energy over outputs or latent variables) is done with approximate methods or with methods that can get stuck in local minima, because exact global minimisation is intractable or non-convex in general. Mostly true: this holds in substance, but 'very often' overstates it slightly, for example if exact inference was in fact typical for the model classes in common use. Mixed: approximate or non-global inference was common for some major model classes but rare for others, so 'very often' holds for only about half of them. Mostly false: approximate or non-global inference happened only in a narrow set of cases and exact global inference was the norm. False: the evidence shows that inference in energy-based models of that period was generally exact and guaranteed to find the global minimum.

Evidence

  1. Markov Random Fields University of Toronto, CSC 2503 course handout (D.J. Fleet & A.D. Jepson) · 2011
    “Inference with MRFs is challenging as useful factorizations of the joint distribution, like those for chains and trees are not available. For all but a few special cases, MAP estimation is NP-hard.”
  2. Markov Random Field Modeling, Inference & Learning in Computer Vision & Image Understanding: A Survey Computer Vision and Image Understanding (Wang, Komodakis, Paragios), archived on HAL · 2013
    “The minimization of such non-submodular energy functions is NP-hard in general [23, 25] and an approximation algorithm would be required to approach the global optimum.”
  3. Energy-Based Models cs.nyu.edu/~yann (LeCun's NYU research page) · 19 July 2005 Own record
    “Again, no collapse occurs, but the computation is considerably more expensive than in the previous example, because we need to compute the integral over all values of Y”
  4. Energy-Based Models and Loss Functions, Linear Machines Yann LeCun, NYU Courant Institute (course lecture, Spring 2004) · 2004 Own record
    “Best output: (cid:20)Y = minY E(W; Y; X) = W 0X.”

Reasoning

E1 says that MAP estimation in Markov random fields is NP-hard "for all but a few special cases", and E2 says that, in the same MRF setting, minimising non-submodular energy functions is NP-hard in general. E2 adds that an approximation algorithm would be required to approach the global optimum. Both sources date from after 2006 (2011 and 2013), but they state general complexity results that do not depend on the date, so they support the claim as of 2006. E4 shows a linear model where exact minimisation is trivial, but that is the kind of special case E1 sets aside, and it does not undercut "very often".

Cite this claim

Yann LeCun, “Inference algorithms in energy-based learning often give only approximate answers or do not guarantee finding the global energy minimum.” (said 2006). Verdict: resolved true. Reliability API, claim c_8c8c26210cba, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_8c8c26210cba

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.