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

110 claims · page 2 of 2

110 claims, sorted by newest said. Choose a claim to read it in full.
VerdictKindSaidClaimTopic
Unresolvable Factual 15 May 2014 Theoretical results suggest that learning good parameters for a small neural network can be as computationally hard as breaking RSA. Factual · 15 May 2014 Philosophy, ethics and society
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
Unresolvable Prediction 15 May 2014 Researchers will eventually figure out how to merge ConvNets and DeconvNets into a feed-forward plus feed-back system trainable supervised or unsupervised. Prediction · 15 May 2014 AI capabilities
Unresolvable Prediction 15 May 2014 Now or in the near future, most of the world's knowledge will be extracted by machines and reside in machines. Prediction · 15 May 2014 AI timelines and forecasting
Unresolvable Prediction 15 May 2014 As more data becomes available, machine learning methods will increasingly rely on learning. Prediction · 15 May 2014 AI capabilities
Unresolvable Prediction 15 May 2014 Natural language processing is the next frontier for deep learning. Prediction · 15 May 2014 AI timelines and forecasting
Unresolvable Prediction 2010 The authors expected to see many new embedded vision systems based on ConvNets in the next few years. Prediction · 2010 AI compute, hardware and data
Unresolvable Factual 2010 A big advantage of ConvNets for detection is their computational efficiency. Factual · 2010 AI capabilities
Unresolvable Factual 2006 The LVQ2 loss is a continuous approximation of the number of classification errors. 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 AI capabilities

“Thus we conclude that there exists at least one point in HP1 at which the loss is less than at all points in HP2.”

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

There exists at least one point in HP1 at which the loss is less than at all points in HP2.

Unresolvable The public record could not settle it.

What would count as true or false

Evaluate the claim as a mathematical conclusion in the 2006 source paper, where HP1 and HP2 are the regions or sets it defines. TRUE: under the paper's stated assumptions and its definition of the loss (negative log-likelihood, if that is the loss the paper uses), the existence of at least one point in HP1 with loss lower than at every point in HP2 follows validly. MOSTLY TRUE: the conclusion is valid, but the proposition misnames a minor detail (e.g., the loss is a closely related one rather than exactly the negative log-likelihood). MOSTLY FALSE: the conclusion holds only under further assumptions the paper does not state, or holds for a weaker statement (e.g., less than or equal, or less than some but not all points in HP2). FALSE: the reasoning is invalid or a counterexample within the paper's setting is shown.

Evidence

  1. Factor Graphs for Relational Regression New York University, Department of Computer Science (PhD dissertation by Sumit Prakash Chopra) · January 2009 Own record
    “Let the two half planes EC + m < EI and EC + m ≥ EI be denoted by HP1 and HP2 respectively.”
  2. Factor Graphs for Relational Regression New York University, Department of Computer Science (PhD dissertation by Sumit Prakash Chopra) · January 2009 Own record
    “Lnll(W, Y i, X i) = E(W, Y i, X i) + Fβ(W, Y, X i).”
  3. Wake-Sleep Energy Based Models for Continual Learning CVF Open Access (CVPR 2024 Workshops, CLVision) · 2024
    “Therefore it can be concluded that there exists at least one point in P1 at which the loss is less than at all points in P2.”

Reasoning

E2 defines HP1 (EC + m < EI) and HP2 (EC + m ≥ EI), and E3 gives the formula for the negative log-likelihood loss in a 2009 dissertation. Both come from a 2009 dissertation that is not independent of the subject, and neither shows the argument that leads to the conclusion. E4 is an independent paper that restates the same conclusion for its own regions P1 and P2. It does not show the derivation or the assumptions it depends on, or whether those assumptions hold for the negative log-likelihood loss. The evidence therefore does not establish whether the conclusion follows validly under the 2006 paper's assumptions, as the criteria require.

Cite this claim

Yann LeCun, “There exists at least one point in HP1 at which the loss is less than at all points in HP2.” (said 2006). Verdict: unresolvable. Reliability API, claim c_ea7fbc4d08d2, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_ea7fbc4d08d2

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.