Pith. sign in

REVIEW 1 cited by

XL3M: A Training-free Framework for LLM Length Extension Based on Segment-wise Inference

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.17755 v1 pith:HUHRIBIA submitted 2024-05-28 cs.CL cs.AI

classification cs.CLcs.AI
keywords contextxl3mframeworklengthlongmodeltrainingcard
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Length generalization failure problem, namely the large language model (LLM) fails to generalize to texts longer than its maximum training length, greatly restricts the application of LLM in the scenarios with streaming long inputs. To address this problem, the existing methods either require substantial costs or introduce precision loss. In this paper, we empirically find that the accuracy of the LLM's prediction is highly correlated to its certainty. Based on this, we propose an efficient training free framework, named XL3M (it means extra-long large language model), which enables the LLMs trained on short sequences to reason extremely long sequence without any further training or fine-tuning. Under the XL3M framework, the input context will be firstly decomposed into multiple short sub-contexts, where each sub-context contains an independent segment and a common ``question'' which is a few tokens from the end of the original context. Then XL3M gives a method to measure the relevance between each segment and the ``question'', and constructs a concise key context by splicing all the relevant segments in chronological order. The key context is further used instead of the original context to complete the inference task. Evaluations on comprehensive benchmarks show the superiority of XL3M. Using our framework, a Llama2-7B model is able to reason 20M long sequences on an 8-card Huawei Ascend 910B NPU machine with 64GB memory per card.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TreeKV: Smooth Key-Value Cache Compression with Tree Structures

    cs.CL 2025-01 conditional novelty 5.0 of 10

    TreeKV uses a cyclic pair-wise eviction tree with averaged attention scores to compress LLM KV caches, reporting SOTA perplexity on PG19/OpenWebText2 and best LongBench averages.

Pith tools