RECALL: Library-Like Behavior In Language Models is Enhanced by Self-Referencing Causal Cycles

• URL: http://arxiv.org/abs/2501.13491v1
• Date: Thu, 23 Jan 2025 09:14:07 GMT
• Title: RECALL: Library-Like Behavior In Language Models is Enhanced by Self-Referencing Causal Cycles
• Authors: Munachiso Nwadike, Zangir Iklassov, Toluwani Aremu, Tatsuya Hiraoka, Velibor Bojkovic, Benjamin Heinzerling, Hilal Alqaubeh, Martin Takáč, Kentaro Inui,
• Abstract summary: We introduce the concept of the self-referencing causal cycle (abbreviated RECALL) It enables large language models to bypass the limitations of unidirectional causality. We find that RECALL is driven by what we designate as cycle tokens.
• Score: 18.140067201462884
• License:
• Abstract: We introduce the concept of the self-referencing causal cycle (abbreviated RECALL) - a mechanism that enables large language models (LLMs) to bypass the limitations of unidirectional causality, which underlies a phenomenon known as the reversal curse. When an LLM is prompted with sequential data, it often fails to recall preceding context. For example, when we ask an LLM to recall the line preceding "O say does that star-spangled banner yet wave" in the U.S. National Anthem, it often fails to correctly return "Gave proof through the night that our flag was still there" - this is due to the reversal curse. It occurs because language models such as ChatGPT and Llama generate text based on preceding tokens, requiring facts to be learned and reproduced in a consistent token order. While the reversal curse is often viewed as a limitation, we offer evidence of an alternative view: it is not always an obstacle in practice. We find that RECALL is driven by what we designate as cycle tokens - sequences that connect different parts of the training data, enabling recall of preceding tokens from succeeding ones. Through rigorous probabilistic formalization and controlled experiments, we demonstrate how the cycles they induce influence a model's ability to reproduce information. To facilitate reproducibility, we provide our code and experimental details at https://anonymous.4open.science/r/remember-B0B8/.

Related papers

• Non-Halting Queries: Exploiting Fixed Points in LLMs [4.091772241106195]
  We introduce a new vulnerability that exploits fixed points in autoregressive models and use it to craft queries that never halt. We demonstrate the non-halting anomaly in a number of experiments performed in base (unaligned) models. Our experiments with the gradient search based inversion technique ARCA show that non-halting is prevalent across models and may be easily induced with a few input tokens.
  arXiv  Detail & Related papers  (2024-10-08T18:38:32Z)
• Reranking Laws for Language Generation: A Communication-Theoretic Perspective [23.375569123152324]
  We conceptualize the generator as a sender transmitting multiple descriptions of a message through parallel noisy channels. We provide conditions under which this protocol isally error-free even in scenarios where the reranker is imperfect. We use our framework to obtain reranking laws which we validate empirically on two real-world tasks using large language models.
  arXiv  Detail & Related papers  (2024-09-11T09:27:50Z)
• From Loops to Oops: Fallback Behaviors of Language Models Under Uncertainty [67.81977289444677]
  Large language models (LLMs) often exhibit undesirable behaviors, such as hallucinations and sequence repetitions. We categorize fallback behaviors - sequence repetitions, degenerate text, and hallucinations - and extensively analyze them. Our experiments reveal a clear and consistent ordering of fallback behaviors, across all these axes.
  arXiv  Detail & Related papers  (2024-07-08T16:13:42Z)
• The Factorization Curse: Which Tokens You Predict Underlie the Reversal Curse and More [27.731438642876114]
  We study the reversal curse, where models cannot recall information when probed in a different order than was encountered during training. We find that the factorization curse is an inherent failure of the next-token prediction objective used in popular large language models. Our results uncover a promising path forward: factorization-agnostic objectives can significantly mitigate the reversal curse and hint at improved knowledge storage and planning capabilities.
  arXiv  Detail & Related papers  (2024-06-07T18:00:37Z)
• Mitigating Reversal Curse in Large Language Models via Semantic-aware Permutation Training [57.771940716189114]
  We show that large language models (LLMs) suffer from the "reversal curse" The root cause of the reversal curse lies in the different word order between the training and inference stage. We propose Semantic-aware Permutation Training (SPT) to address this issue.
  arXiv  Detail & Related papers  (2024-03-01T18:55:20Z)
• OPERA: Alleviating Hallucination in Multi-Modal Large Language Models via Over-Trust Penalty and Retrospection-Allocation [124.9008419182485]
  We present OPERA, a novel MLLM decoding method grounded in an Over-trust Penalty and a Retrospection-Allocation strategy. Our approach begins with an interesting observation that, most hallucinations are closely tied to the knowledge aggregation patterns in the self-attention matrix. Based on the observation, OPERA introduces a penalty term on the model logits during the beam-search decoding to mitigate the over-trust issue.
  arXiv  Detail & Related papers  (2023-11-29T18:57:07Z)
• Explaining Emergent In-Context Learning as Kernel Regression [61.57151500616111]
  Large language models (LLMs) have initiated a paradigm shift in transfer learning. In this paper, we investigate the reason why a transformer-based language model can accomplish in-context learning after pre-training. We find that during ICL, the attention and hidden features in LLMs match the behaviors of a kernel regression.
  arXiv  Detail & Related papers  (2023-05-22T06:45:02Z)
• Back to the Future: Unsupervised Backprop-based Decoding for Counterfactual and Abductive Commonsense Reasoning [79.48769764508006]
  generative language models (LMs) can be trained to condition only on the past context or to perform narrowly scoped text-infilling. We propose DeLorean, a new unsupervised decoding algorithm that can flexibly incorporate both the past and future contexts. We demonstrate that our approach is general and applicable to two nonmonotonic reasoning tasks: abductive text generation and counterfactual story revision.
  arXiv  Detail & Related papers  (2020-10-12T17:58:43Z)
• Remembering for the Right Reasons: Explanations Reduce Catastrophic Forgetting [100.75479161884935]
  We propose a novel training paradigm called Remembering for the Right Reasons (RRR) RRR stores visual model explanations for each example in the buffer and ensures the model has "the right reasons" for its predictions. We demonstrate how RRR can be easily added to any memory or regularization-based approach and results in reduced forgetting.
  arXiv  Detail & Related papers  (2020-10-04T10:05:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.