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 -
Predictions
Statements about events outside the person's control, checked once they fell due: did they come true?
64 43 83 -
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.
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
23 claims
“This loss is always positive, since the second term is a lower bound on the first term.”
Yann LeCun et al., tutorial authors 2006 A Tutorial on Energy-Based Learning (yann.lecun.com)
The generalized perceptron loss is always positive because its second term is a lower bound on its first term.
Resolved true The record shows it happened or was so.
The evidence is the person's or their organisation's own records.
What would count as true or false
Use the generalized perceptron loss as defined in the 2006 source (LeCun et al., 'A Tutorial on Energy-Based Learning'): the energy of the correct answer minus the minimum energy over all answers. 'Positive' is read in its loose sense of non-negative. TRUE: under that definition, the second term (the minimum over all Y, which includes the correct answer) is always less than or equal to the first term, so the loss can never be negative. Cases where the loss equals zero do not count against the claim. MOSTLY TRUE: the loss is non-negative only under a mild condition in the definition (for example, that the minimum is taken over a set that includes the correct answer), and the source states that condition elsewhere. MOSTLY FALSE: the loss is non-negative only under significant extra assumptions that the source does not state. FALSE: under the source's definition the loss can be negative, because the second term is not a lower bound on the first.
Evidence
- A tutorial on energy-based - Yann LeCun Yann LeCun (yann.lecun.com) · 19 August 2006 Own record
“the learning procedure must shape the energy surface so that the desired value of Y has lower energy than all other (undesired) values.”
Reasoning
The resolution criteria fix the loss as the energy of the correct answer minus the minimum energy over all answers. The 2006 tutorial (E2) treats the desired value of Y as one of the values of Y that the energy is compared over, so the minimum is taken over a set that includes the correct answer. A minimum over a set that includes the correct answer can never exceed that answer's energy, so the second term is a lower bound on the first and the loss is never negative. Under the criteria, cases where the loss is zero do not count against the claim.
Cite this claim
Yann LeCun, “The generalized perceptron loss is always positive because its second term is a lower bound on its first term.” (said 2006). Verdict: resolved true. Reliability API, claim c_3c8927246b5c, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_3c8927246b5c
Claims without a verdict
- Unresolvable 110
- Not yet due 3
- Not researched 309
- Not checkable 669
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.