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

122 claims, sorted by newest said. Choose a claim to read it in full.
VerdictKindSaidClaimTopic
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
Unresolvable Factual 15 May 2014 The limitations the questioner pointed out concern not just backprop but all learning algorithms that use gradient-based optimization. Factual · 15 May 2014 AI capabilities
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
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
Unresolvable Factual 2010 A big advantage of ConvNets for detection is their computational efficiency. 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
Unresolvable Factual 2006 The LVQ2 loss is a continuous approximation of the number of classification errors. 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
Unresolvable Factual 2006 There exists at least one point in HP1 at which the loss is less than at all points in HP2. Factual · 2006 AI capabilities
Back to the list

Yann LeCun

Open its page

Factual Science and research methods

“The notions of partition functions, entropy, free energy, variational methods etc, that are so prevalent in the graphical models literature all come from statistical physics.”

Yann LeCun, in Reddit AMA 15 May 2014 Yann LeCun's answers from the Reddit AMA (FastML)

The notions of partition functions, entropy, free energy and variational methods prevalent in the graphical models literature come from statistical physics.

Mostly true True in substance, wrong in a detail.

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

What would count as true or false

True if the history of science shows that partition functions, entropy, free energy and variational methods, as used in graphical models, came from statistical physics (Gibbs/Boltzmann distributions, mean-field and variational free energy, Bethe approximations). Mostly true if most of these came from statistical physics but one has a significant partly separate lineage, for example entropy through Shannon's information theory or variational methods through the calculus of variations, as long as the statistical-physics origin of the concepts as used in graphical models still holds. Mixed if only about half of the listed notions can be traced to statistical physics. Mostly false if most of them came mainly from other fields. False if none did.

Evidence

  1. Advances in Variational Inference arXiv (ar5iv rendering), authors from Microsoft Research, KTH, UC Irvine
    “The origins of VI date back to the 1980s. Mean field methods, for instance, have their origins in statistical physics, where they played a prominent role in the statistical mechanics of spin glasses [121, 147].”
  2. An Introduction to Variational Methods for Graphical Models Machine Learning journal (Kluwer), by Jordan, Ghahramani, Jaakkola, Saul · 1999
    “In keeping with statistical mechanical terminology we will refer to this sum as a “partition function.””
  3. An Introduction to Variational Methods for Graphical Models Machine Learning journal (Kluwer), by Jordan, Ghahramani, Jaakkola, Saul · 1999
    “The terminology comes from the roots of the techniques in the calculus of variations.”
  4. Entropy in thermodynamics and information theory - Wikipedia Wikipedia · 5 December 2005
    “Because the mathematical expressions for information theory developed by Claude Shannon and Ralph Hartley in the 1940s are similar to the mathematics of statistical thermodynamics worked out by Ludwig Boltzmann and J. Willard Gibbs in the 1870s, in which the concept of entropy is central, Shannon was persuaded to employ the same term 'entropy' for his measure of uncertainty.”

Reasoning

E2 says the "partition function" in graphical models is named in keeping with statistical-mechanics terminology. E1 says mean-field methods have their origins in statistical physics, where they played a prominent role in the statistical mechanics of spin glasses. Two notions also have partly separate lineages. E3 says the variational terminology comes from the calculus of variations, and E4 says information-theoretic entropy was developed by Shannon, who borrowed the name from Boltzmann–Gibbs thermodynamics. No item speaks directly to free energy, but the evidence still mostly supports a statistical-physics origin, which fits the criteria for mostly true.

Cite this claim

Yann LeCun, “The notions of partition functions, entropy, free energy and variational methods prevalent in the graphical models literature come from statistical physics.” (said 15 May 2014). Verdict: mostly true. Reliability API, claim c_0d5a68991312, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_0d5a68991312

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.