Deep Learning systems augmented with a memory module are starting to show impressive results in natural language processing.
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?
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 February 2015. TRUE: by 18 February 2015, work had been published or posted showing deep networks augmented with an explicit memory module (for example, Memory Networks or Neural Turing Machines) achieving notable results on NLP tasks such as question answering, and these results were regarded as impressive and emerging. MOSTLY TRUE: results existed, but mainly on synthetic or toy NLP tasks rather than on real-world benchmarks. MOSTLY FALSE: memory-augmented models existed, but had shown only marginal or non-NLP results. FALSE: no memory-augmented deep learning NLP results had appeared by that date.
Set before the research began.
Evidence (4)
-
E1 Memory Networks arXiv (rendered via ar5iv.labs.arxiv.org)
“We investigate these models in the context of question answering (QA) where the long-term memory effectively acts as a (dynamic) knowledge base, and the output is a textual response. We evaluate them on a large-scale QA task, and a smaller, but more complex, toy task generated from a simulated world.”
-
E2 Memory Networks arXiv (rendered via ar5iv.labs.arxiv.org)
“Some answers appear fine, whereas others are nonsensical.”
-
E3 Memory Networks arXiv (rendered via ar5iv.labs.arxiv.org)
“Our work was submitted to arxiv just before the Neural Turing Machine work of Graves et al. 2014, which is one of the most relevant related methods.”
-
E4 Neural Turing Machines arXiv (rendered via ar5iv.labs.arxiv.org)
“Preliminary results demonstrate that Neural Turing Machines can infer simple algorithms such as copying, sorting, and associative recall from input and output examples.”
Reasoning
E3 shows that the Memory Networks preprint was submitted to arXiv in 2014, just before the Graves et al. 2014 Neural Turing Machine work, which is before the claim date. It tested a memory-augmented network on question answering, using a large-scale QA task and a toy task generated from a simulated world. The evidence does not show these results being described as impressive: the paper itself (E2) says some answers appear fine while others are nonsensical. The Neural Turing Machine paper (E4) reports preliminary results on algorithmic tasks such as copying, sorting and associative recall; the quoted passage does not mention language results. Memory-augmented NLP results clearly existed by February 2015, but nothing here shows they were seen as impressive on real-world benchmarks, so the claim holds largely but not fully.
Cite this claim
Yann LeCun, “Deep Learning systems augmented with a memory module are starting to show impressive results in natural language processing.” (said 18 February 2015). Verdict: mostly true. Reliability API, claim c_24d8dbb268c8, method 0.1.0+c876030c, dataset release v1.1.2. https://epistacklabs.com/claims/c_24d8dbb268c8
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
“For starters, transformers are equivariant to permutations.”
Transformers are equivariant to permutations, as ConvNets are equivariant to translations.
-
Mostly true
“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.”
-
Mostly true
“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.”
-
Mostly true
“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.”
-
Mostly true
“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…”
Verdicts are made automatically; how verdicts are made.