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

“A big advantage of ConvNets for detection is their computational efficiency:”

Yann LeCun, co-author of paper 2010 Convolutional Networks and Applications in Vision (yann.lecun.com)

A big advantage of ConvNets for detection is their computational efficiency.

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 against knowledge as of 2010. TRUE: the technical literature up to 2010 shows that ConvNets used for detection are computationally efficient, notably because convolutions applied over a whole image share computation across overlapping windows, and this is widely recognised as a significant advantage over competing detectors. MOSTLY TRUE: efficiency is a real advantage, but it holds mainly relative to naive sliding-window classifiers rather than to all competing detection methods of the time. MIXED: ConvNets were efficient in some detection settings but clearly slower than competing methods in others. MOSTLY FALSE: the efficiency gain was marginal or applied only in narrow cases. FALSE: ConvNet detectors of the time were generally less efficient computationally than the alternatives.

Evidence

  1. Robust Real-Time Face Detection International Journal of Computer Vision (Viola and Jones; hosted at RWTH Aachen University) · 2004
    “The approach was used to construct a face detection system which is approximately 15 times faster than any previous approach.”
  2. Pedestrian Detection withUnsupervised Multi-Stage Feature Learning ar5iv (arXiv 1212.0142) Own record
    “While processing speed is not the focus of this paper, features and classifier approximations introduced by dollar-bmvc-10 and benenson2012pedestrian may be applicable to deep learning models for faster detection, in addition to GPU optimizations.”
  3. Object Detection with Sliding Windows | Shav Wiki Shav Wiki · 1 January 2014
    “The convolutional implementation of sliding windows allows these windows in the convnet to share a lot of computation.”

Reasoning

A later secondary source says convolutional sliding windows share computation [E3], and a 2004 face detector was reported as approximately 15 times faster than earlier approaches [E1]. However, no evidence compares ConvNet detectors' efficiency with that of other detectors as of 2010, so the evidence cannot separate the true, mostly true and mixed outcomes under the criteria.

Cite this claim

Yann LeCun, “A big advantage of ConvNets for detection is their computational efficiency.” (said 2010). Verdict: unresolvable. Reliability API, claim c_bd82e9124139, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_bd82e9124139

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.