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

669 claims · page 7 of 7

669 claims, sorted by newest said. Choose a claim to read it in full.
VerdictKindSaidClaimTopic
Not checkable Not checkable 2006 Energy-Based Models (EBMs) capture dependencies between variables by associating a scalar energy to each configuration of the variables. Not checkable · 2006
Not checkable Not checkable 2006 Running MCMC for just a few steps limits computational expense. Not checkable · 2006
Not checkable Not checkable 2006 Since the contrastive sample is always near the desired answer, one can hope that the desired answer will become a local minimum of the… Not checkable · 2006
Not checkable Not checkable 2006 One interesting suggestion is to pull up on answers that are always near the correct answer, so as to make the correct answer a local… Not checkable · 2006
Not checkable Not checkable 2006 Knowing these values would make the recognition task much easier. Not checkable · 2006
Not checkable Not checkable 2006 it is important to keep in mind that much of the discussion applies equally well to more complex architectures, as we will see later. Not checkable · 2006
Not checkable Not checkable 2006 The only challenge is to compute the gradient of the loss with respect to the neural net outputs by backpropagating gradients through the… Not checkable · 2006
Not checkable Not checkable 2006 On average, each answer will be pulled up by the appropriate amount according to the partition function. Not checkable · 2006
Not checkable Not checkable 2006 the energy-based approach is bound to be more efficient. Not checkable · 2006
Not checkable Not checkable 2006 A distinction should be made between the energy function, which is minimized by the inference process, and the loss functional (introduced… Not checkable · 2006
Not checkable Not checkable 2006 Second, computing the contrastive term in the negative log-likelihood loss function (or its gradient with respect to W ) may be very… Not checkable · 2006
Not checkable Not checkable 2006 The simplest method is stochastic gradient descent. Not checkable · 2006
Not checkable Not checkable 2006 Contrastive divergence learning can be seen as an approximation of NLL learning with two shortcuts. Not checkable · 2006
Not checkable Not checkable 2006 It would seem natural to train GTNs with one of the generalized margin losses. Not checkable · 2006
Not checkable Not checkable 2006 the only consistent way involves turning the collection of energies for all possible outputs into a normalized probability distribution. Not checkable · 2006
Not checkable Not checkable 2006 Hence probabilistic modeling comes with a high price, and should be avoided when the application does not require it. Not checkable · 2006
Not checkable Not checkable 2006 Latent variables are very useful in situations where a hidden characteristic of the process being modeled can be inferred from… Not checkable · 2006
Not checkable Not checkable 2006 However there are numerous applications where it is convenient to use energy functions that depend on a set of hidden variables Z whose… Not checkable · 2006
Not checkable Not checkable 2006 Locating the best-scoring location in the image consists in minimizing the energy with respect to Y and Z. Not checkable · 2006
Not checkable Not checkable 2006 First, the normalization requirement limits the choice of energy functions we can use. Not checkable · 2006
Not checkable Not checkable 2006 Unfortunately, not all combinations of architectures and loss functions are allowed. Not checkable · 2006
Not checkable Not checkable 2006 Non-linear factors allow the modeling of highly complex dependencies between inputs and labels Not checkable · 2006
Not checkable Not checkable 2006 Probabilistic models have two major disadvantages. Not checkable · 2006
Not checkable Not checkable 2006 In the energybased framework, there is no need to make excuses for breaking the rules. Not checkable · 2006
Not checkable Not checkable 2006 This loss function can be optimized with a variety of techniques. Not checkable · 2006
Not checkable Not checkable 2006 Energy-based learning can be seen as an alternative to probabilistic estimation for prediction, classification, or decision-making tasks. Not checkable · 2006
Not checkable Not checkable 2006 In this way, the regression on X1 and X2 is implicitly learned through the constraint Y rather than explicitly learned through supervision. Not checkable · 2006
Not checkable Not checkable 2006 Many existing learning models can be be expressed simply in the framework of energy-based learning. Not checkable · 2006
Not checkable Not checkable 2006 What we propose here is to view the probabilistic approach as a special case of a much larger family of energy-based methods. Not checkable · 2006
Not checkable Not checkable 2006 Properly designing the architecture and the loss function is critical. Not checkable · 2006
Not checkable Not checkable 2006 Such hidden variables are called latent variables, by analogy with a similar concept in probabilistic modeling. Not checkable · 2006
Not checkable Not checkable 2006 Graph transformer networks are hierarchical sequence modeling systems in which the objects that are manipulated are trellises containing… Not checkable · 2006
Not checkable Not checkable 2006 For other models, one cannot guarantee anything. Not checkable · 2006
Not checkable Not checkable 2006 Energy-based methods are equally well justified as probabilistic methods. Not checkable · 2006
Not checkable Not checkable 2006 The architectures described in the previous section are simple functions of Y with a single minimum within the set Y. Not checkable · 2006
Not checkable Not checkable 2006 This could be construed as a thinly disguised way of removing the normalization constraint. Not checkable · 2006
Not checkable Not checkable 2006 These models can be easily described in an EBM setting. Not checkable · 2006
Not checkable Not checkable 2006 The EBM approach provides a common theoretical framework for many learning models, including traditional discriminative and generative… Not checkable · 2006
Not checkable Not checkable 2005 Face recognition: the gender of the person, the orientation of the face. Not checkable · 2005
Not checkable Not checkable 2005 MAP Inference: Given an input X, find the value of Y that minimizes the energy: Not checkable · 2005
Not checkable Not checkable 2005 Variables that would make the task easier if they were known: Not checkable · 2005
Not checkable Not checkable 2005 Do not answer a more complex question than necessary Not checkable · 2005
Not checkable Not checkable 2005 Minimize the Regularization term: Make W as short as possible. Not checkable · 2005
Not checkable Not checkable 2005 This is equivalent to keeping ||W|| constant, while maximizing m. Not checkable · 2005
Not checkable Not checkable 2005 Minimize the hinge loss: make the energy of all the “good” answers smaller that the energy of any “bad” answer by at least m (the margin). Not checkable · 2005
Not checkable Not checkable 2005 Probabilistic approaches compute the distribution P(Y|X), and choose the Y that maximizes it. Not checkable · 2005
Not checkable Not checkable 2005 Computing a distribution of steering angles is of little use. Not checkable · 2005
Not checkable Not checkable 2005 W is the parameter to be learned. Not checkable · 2005
Not checkable Not checkable 2005 For each question, a different learning strategy is required Not checkable · 2005
Not checkable Not checkable 2005 Pick an optimization method. Not checkable · 2005
Not checkable Not checkable 2005 Linear Model + Margin Loss + Regularization = SVM Not checkable · 2005
Not checkable Not checkable 2005 E(W,Y,X): is a scalar energy function (a.k.a. Contrast function) that measures the “compatibility” between Y and X. Not checkable · 2005
Not checkable Not checkable 2005 Object recognition: the pose parameters of the object (location, orientation, scale), the lighting conditions. Not checkable · 2005
Not checkable Not checkable 2005 Handwriting Recognition: the segmentation of the line into characters. Not checkable · 2005
Not checkable Not checkable 2005 Design an architecture: a particular form for E(W,Y,X). Not checkable · 2005
Not checkable Not checkable 2005 Probabilistic Inference: simply marginalize over Z. Not checkable · 2005
Not checkable Not checkable 2005 A factor graph is a general way to represent a graphical model. Not checkable · 2005
Not checkable Not checkable 2005 For decision making, we need no normalization. Not checkable · 2005
Not checkable Not checkable 2005 Sometimes, we do not need probabilities. Not checkable · 2005
Not checkable Not checkable 2005 The internal structure of the box is called the architecture of the model. Not checkable · 2005
Not checkable Not checkable 2005 A model measures the goodness of a combination of observed variables (X) and variables to be predicted (Y). Not checkable · 2005
Not checkable Not checkable 2005 The questions are in increasing order of complexity. Not checkable · 2005
Not checkable Not checkable 2005 We can put anything we want in the box. Not checkable · 2005
Not checkable Not checkable 2005 Architecture + Inference Algo + Loss Function = Model Not checkable · 2005
Not checkable Not checkable 2005 In general, we will search for the value of the latent variable that allows us to get an answer (Y) of smallest energy. Not checkable · 2005
Not checkable Not checkable 2005 The machine should be designed and trained to answer the simplest question possible. Not checkable · 2005
Not checkable Not checkable 2005 Z: is the latent variable (never observed). Not checkable · 2005
Not checkable Not checkable 2005 Pick a loss function: in such a way that minimizing it with respect to W over a training set will make the inference algorithm find the… Not checkable · 2005
Not checkable Not checkable 2005 When the robot faces an obstacle, it MUST turn left of right. Not checkable · 2005
Back to the list

Yann LeCun

Open its page

Not checkable

“The EBM approach provides a common theoretical framework for many learning models, including traditional discriminative and generative approaches, as well as graph-transformer networks, conditional random fields, maximum margin Markov networks, and several manifold learning methods.”

Yann LeCun 2006 A Tutorial on Energy-Based Learning (yann.lecun.com)

The EBM approach provides a common theoretical framework for many learning models, including traditional discriminative and generative…

Not checkable An opinion, value judgement or statement with nothing to check.

Cite this claim

Yann LeCun, “The EBM approach provides a common theoretical framework for many learning models, including traditional discriminative and generative…” (said 2006). Verdict: not checkable. Reliability API, claim c_fac3f6a77c31, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_fac3f6a77c31

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.