ClaimsYann LeCun

“For example, the hinge loss systematically chooses the most offending incorrect answer as the one whose energy should be pulled up.”

Yann LeCun and co-authors, tutorial authors 2006 A Tutorial on Energy-Based Learning (yann.lecun.com) archived copy

Factual AI capabilities

The hinge loss systematically chooses the most offending incorrect answer as the one whose energy is pulled up.

Mostly true True in substance, wrong in a detail.

Factual: Statements about the present or the past, checked against the record: did they hold up?

What would count as true or false

Judged against the definition of hinge loss in the energy-based learning framework (LeCun et al. 2006, 'A Tutorial on Energy-Based Learning') and standard ML theory. True if the hinge loss, as defined there, depends only on the energy of the correct answer and the energy of the most offending incorrect answer (the lowest-energy incorrect answer), so that its gradient pushes up only that answer's energy. Mostly true if this holds with a minor caveat, such as the margin condition: no push-up happens when the margin is already met. Mixed if it holds only for some formulations of hinge loss and not others. Mostly false if the hinge loss as defined pushes up several incorrect answers or another answer, with only a narrow special case matching the claim. False if the hinge loss does not single out the most offending incorrect answer.

Set before the research began.

Evidence (4)

  1. E1 Deep Learning atcold.github.io (NYU Deep Learning course notes, 2020) · 13 April 2020 Own record

    “This loss enforces that the difference between the correct answer and the most offending incorrect answer be at least $m$.”
  2. E2 A survey and taxonomy of loss functions in machine learning arXiv (ar5iv rendering)

    “This loss enforces that the difference between the correct answer and the most offending incorrect answer be at least \(m\) Taskar et al. 2003; Altun et al. 2003. Individual energies are not required to take a specific value because the hinge loss depends on energy differences.”
  3. E3 Deep Learning atcold.github.io (NYU Deep Learning course notes, 2020) · 13 April 2020 Own record

    “If you were to use this for classification, you would have $x_1$ be the score of the correct answer and $x_2$ be the score of the highest scoring incorrect answer in the mini-batch.”
  4. E4 Deep Learning atcold.github.io (NYU Deep Learning course notes, 2020) · 13 April 2020 Own record

    “For EBMs, this loss function pushes down on desired categories and pushes up on non-desired categories.”

Reasoning

An independent survey of loss functions (E2), citing Taskar et al. and Altun et al., says the hinge loss requires the energy gap between the correct answer and the most offending incorrect answer to be at least a margin m. The loss therefore depends only on that pair. The NYU course notes (E1, E3) describe the same pairing for hinge-type losses. The definition carries a margin condition: nothing is pushed up once the margin is met. E4 says a loss pushes up on non-desired categories in general; it does not say which incorrect answers are chosen or identify that loss as the hinge loss the claim describes.

Cite this claim

Yann LeCun, “The hinge loss systematically chooses the most offending incorrect answer as the one whose energy is pulled up.” (said 2006). Verdict: mostly true. Reliability API, claim c_29ff9a2301bc, method 0.1.0+c876030c, dataset release v1.1.2. https://epistacklabs.com/claims/c_29ff9a2301bc

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).

More factual claims by Yann LeCun

  1. Mostly true Factual 18 March 2024
    “For starters, transformers are equivariant to permutations.”

    Transformers are equivariant to permutations, as ConvNets are equivariant to translations.

  2. Mostly true Factual 14 March 2024
    “If it were the case, we would have AI systems that could teach themselves to drive a car in 20 hours of practice, like any 17 year-old.”

    There are currently no AI systems that can teach themselves to drive a car in about 20 hours of practice, as a 17-year-old can.

  3. Mostly true Factual 8 March 2024
    “The architecture is good, the architecture of the encoder is good, but the fact that you train the system to reconstruct images does not lead it to produce to long, good generic features of images.”

    Training an encoder to reconstruct images does not lead it to produce good generic image features, though the encoder architecture is good.

  4. Mostly true Factual 8 March 2024
    “LLMs can do none of those or they can only do them in a very primitive way and they don’t really understand the physical world.”

    Current LLMs can do none of understanding the physical world, persistent memory, reasoning and planning, or only in a very primitive way.

  5. Mostly true Factual 8 March 2024
    “No, there’s one thing that autoregressive LLMs or that LLMs in general, not just the autoregressive one, but including the bird style bidirectional ones, are exploiting and its self supervised…”

    LLMs, including BERT-style bidirectional ones, exploit self-supervised learning, and LeCun has been a very strong advocate of self-supervised learning for many years.

All of them

Verdicts are made automatically; how verdicts are made.