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
“Very often, the inference algorithm can only give us an approximate answer, or is not guaranteed to give us the global minimum of the energy.”
Yann LeCun et al., tutorial authors 2006 A Tutorial on Energy-Based Learning (yann.lecun.com)
Inference algorithms in energy-based learning often give only approximate answers or do not guarantee finding the global energy minimum.
Resolved true The record shows it happened or was so.
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 2006 against the energy-based learning and optimisation literature of that time. True: standard sources (textbooks, surveys, the energy-based learning tutorial literature) show that in many practical energy-based models the inference step (minimising energy over outputs or latent variables) is done with approximate methods or with methods that can get stuck in local minima, because exact global minimisation is intractable or non-convex in general. Mostly true: this holds in substance, but 'very often' overstates it slightly, for example if exact inference was in fact typical for the model classes in common use. Mixed: approximate or non-global inference was common for some major model classes but rare for others, so 'very often' holds for only about half of them. Mostly false: approximate or non-global inference happened only in a narrow set of cases and exact global inference was the norm. False: the evidence shows that inference in energy-based models of that period was generally exact and guaranteed to find the global minimum.
Evidence
- Markov Random Fields University of Toronto, CSC 2503 course handout (D.J. Fleet & A.D. Jepson) · 2011
“Inference with MRFs is challenging as useful factorizations of the joint distribution, like those for chains and trees are not available. For all but a few special cases, MAP estimation is NP-hard.”
- Markov Random Field Modeling, Inference & Learning in Computer Vision & Image Understanding: A Survey Computer Vision and Image Understanding (Wang, Komodakis, Paragios), archived on HAL · 2013
“The minimization of such non-submodular energy functions is NP-hard in general [23, 25] and an approximation algorithm would be required to approach the global optimum.”
- Energy-Based Models cs.nyu.edu/~yann (LeCun's NYU research page) · 19 July 2005 Own record
“Again, no collapse occurs, but the computation is considerably more expensive than in the previous example, because we need to compute the integral over all values of Y”
- Energy-Based Models and Loss Functions, Linear Machines Yann LeCun, NYU Courant Institute (course lecture, Spring 2004) · 2004 Own record
“Best output: (cid:20)Y = minY E(W; Y; X) = W 0X.”
Reasoning
E1 says that MAP estimation in Markov random fields is NP-hard "for all but a few special cases", and E2 says that, in the same MRF setting, minimising non-submodular energy functions is NP-hard in general. E2 adds that an approximation algorithm would be required to approach the global optimum. Both sources date from after 2006 (2011 and 2013), but they state general complexity results that do not depend on the date, so they support the claim as of 2006. E4 shows a linear model where exact minimisation is trivial, but that is the kind of special case E1 sets aside, and it does not undercut "very often".
Cite this claim
Yann LeCun, “Inference algorithms in energy-based learning often give only approximate answers or do not guarantee finding the global energy minimum.” (said 2006). Verdict: resolved true. Reliability API, claim c_8c8c26210cba, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_8c8c26210cba
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.