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.
Factual: Statements about the present or the past, checked against the record: did they hold up?
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.
Set before the research began.
Evidence (1)
-
E1 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, dataset release v1.1.2. https://epistacklabs.com/claims/c_3c8927246b5c
This claim is in dataset release v1.1.2, with the same verdict.
Reply to this claim
More factual claims by Yann LeCun
-
Mostly true
“The notions of partition functions, entropy, free energy, variational methods etc, that are so prevalent in the graphical models literature all come from statistical physics.”
-
Mostly true
“No one uses generalization bounds to do model selection.”
No one uses generalization bounds to do model selection; practitioners use cross-validation.
-
Resolved true
“The idea is rooted in Hubel and Wiesel’s classic 1962 work on the cat’s primary visual cortex.”
-
Resolved false
““Those agents are doing exactly what they’ve been asked to do,” LeCun said.”
-
Resolved true
““It’s AI for the physical world, so it’s not language-related,” LeCun said.”
AMI Labs' work is AI for the physical world and is not language-related.
Verdicts are made automatically; how verdicts are made.