ClaimsYann LeCun

“Barlow Twins tries to minimize the redundancy between the individual components of the embedding vectors.”

Meta AI blog post, byline VP and Chief AI Scientist (LeCun) 4 March 2021 Self-supervised learning: The dark matter of intelligence (Meta AI)

Factual AI capabilities

The Barlow Twins method tries to minimize redundancy between the individual components of the embedding vectors.

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?

Said for an organisation they lead or work for; it counts on both records.

What would count as true or false

True if the Barlow Twins paper (Zbontar et al., 2021) describes its objective as pushing the cross-correlation matrix between the embeddings of two distorted views towards the identity. Here the off-diagonal (redundancy-reduction) term reduces redundancy between the components of the embedding vectors. Mostly true if that is right but the claim leaves out the invariance (on-diagonal) term, since it states only one part of the objective. Mixed if redundancy reduction is only a minor or secondary part of how the method works. Mostly false if the method mainly works another way and redundancy reduction is only loosely related to it. False if the method does not minimise redundancy between embedding components at all.

Set before the research began.

Evidence (4)

  1. E1 Barlow Twins: Self-Supervised Learning via Redundancy Reduction ar5iv (arXiv HTML rendering of arXiv:2103.03230) Own record

    “Intuitively, the invariance term of the objective, by trying to equate the diagonal elements of the cross-correlation matrix to 1, makes the embedding invariant to the distortions applied. The redundancy reduction term, by trying to equate the off-diagonal elements of the cross-correlation matrix to 0, decorrelates the different vector components of the embedding.”
  2. E2 Barlow Twins: Self-Supervised Learning via Redundancy Reduction ar5iv (arXiv HTML rendering of arXiv:2103.03230) Own record

    “Based on this principle, we propose an objective function which tries to make the cross-correlation matrix computed from twin embeddings as close to the identity matrix as possible.”
  3. E3 Barlow Twins: Self-Supervised Learning via Redundancy Reduction ar5iv (arXiv HTML rendering of arXiv:2103.03230) Own record

    “First we find that removing the invariance term (on-diagonal term) or the redundancy reduction term (off-diagonal term) of our loss function leads to worse/collapsed solutions, as expected.”
  4. E4 Yann LeCun Team's Barlow Twins Method Boosts SSL in Image Representation via Redundancy Reduction | Synced Synced · 15 March 2021

    “The proposed Barlow Twins is an objective function that addresses this, measuring the cross-correlation matrix between the output features of two identical networks fed with distorted versions to make them as close as possible to the identity matrix while minimizing redundancy between concerned vector components.”

Reasoning

The Barlow Twins paper says its objective pushes the cross-correlation matrix of twin embeddings towards the identity (E2). Its off-diagonal redundancy-reduction term decorrelates the components of the embedding vectors (E1), and the ablation shows the method needs this term (E3). An independent report describes the method the same way (E4). The claim leaves out the on-diagonal invariance term, which the paper treats as an equally required part of the objective, so under the criteria the verdict is mostly true.

Cite this claim

Yann LeCun, “The Barlow Twins method tries to minimize redundancy between the individual components of the embedding vectors.” (said 4 March 2021). Verdict: mostly true. Reliability API, claim c_a3288ff8aec6, method 0.1.0+c876030c, dataset release v1.1.2. https://epistacklabs.com/claims/c_a3288ff8aec6

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.