ClaimsYann LeCun

“Contrastive divergence learning can be seen as an approximation of NLL learning with two shortcuts.”

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

Not checkable

Contrastive divergence learning can be seen as an approximation of NLL learning with two shortcuts.

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

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

Cite this claim

Yann LeCun, “Contrastive divergence learning can be seen as an approximation of NLL learning with two shortcuts.” (said 2006). Verdict: not checkable. Reliability API, claim c_a48716590cba, method 0.1.0+c876030c, dataset release v1.1.2. https://epistacklabs.com/claims/c_a48716590cba

This claim is in dataset release v1.1.2, with the same verdict.

Reply to this claim

For Yann LeCun, or someone speaking for them: a correction or counter-evidence. Replies are read before anything is shown; an approved reply shows your name, role, date, statement and link. Your email address is never shown and is deleted 30 days after the decision (privacy).

Verdicts are made automatically; how verdicts are made.