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 Philosophy, ethics and society

“There are theoretical results that suggest that learning good parameter settings for a (smallish) neural network can be as hard computationally as breaking the RSA crypto system.”

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

Theoretical results suggest that learning good parameters for a small neural network can be as computationally hard as breaking RSA.

Unresolvable The public record could not settle it.

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 2014-05-15. The claim is hedged ('suggest'). True: peer-reviewed theoretical results exist by 2014 showing that learning or training small neural networks (or intersection-of-halfspaces or threshold-circuit classes that such networks represent) is computationally hard under cryptographic assumptions tied to RSA or factoring (for example, Kearns–Valiant 1994, or Klivans–Sherstov), or NP-hardness of training small networks together with crypto-based hardness. Mostly true: such results exist, but they rest on related cryptographic assumptions (for example, lattice problems or general one-way functions) rather than RSA specifically, or they apply to network classes somewhat different from 'smallish' networks. Mixed: the hardness results that exist are mainly NP-hardness of exact training, with only a loose link to cryptography. Mostly false: the cited results concern quite different settings and do not reasonably support the comparison. False: no theoretical results of this kind existed.

Evidence

  1. Cryptography and machine learning - People | MIT CSAIL MIT CSAIL (Ronald L. Rivest)
    “Valiant 22, 21 turned to cryptographic assumptions (namely, the difficulty of inverting RSA, the difficulty of recognizing quadratic residues modulo a Blum integer, and the difficulty of factoring Blum integers).”
  2. Cryptography and machine learning - People | MIT CSAIL MIT CSAIL (Ronald L. Rivest)
    “Angluin and Kharitonov 5 have done so, showing that (modulo the usual cryptographic assumptions regarding RSA, quadratic residues, or factoring Blum integers), that there is no polynomial-time prediction algorithm, even if membership queries are allowed, for the following classes of functions:”

Reasoning

The evidence shows RSA-related cryptographic hardness results for learning or predicting certain function classes [E1][E2]. It does not show that those classes are neural networks or close to them, which the criteria require for a true or mostly true verdict.

Cite this claim

Yann LeCun, “Theoretical results suggest that learning good parameters for a small neural network can be as computationally hard as breaking RSA.” (said 15 May 2014). Verdict: unresolvable. Reliability API, claim c_0bc2fdda0fa9, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_0bc2fdda0fa9

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.