Pith. sign in

REVIEW 9 cited by

Unlocking Context Constraints of LLMs: Enhancing Context Efficiency of LLMs with Self-Information-Based Content Filtering

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 2304.12102 v1 pith:7ACTFV52 submitted 2023-04-24 cs.CL

classification cs.CL
keywords contextllmsacrosscontentefficiencyenhancingfixedlength
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large language models (LLMs) have received significant attention by achieving remarkable performance across various tasks. However, their fixed context length poses challenges when processing long documents or maintaining extended conversations. This paper proposes a method called \textit{Selective Context} that employs self-information to filter out less informative content, thereby enhancing the efficiency of the fixed context length. We demonstrate the effectiveness of our approach on tasks of summarisation and question answering across different data sources, including academic papers, news articles, and conversation transcripts.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 9 Pith papers

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

  1. What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents

    cs.LG 2026-07 conditional novelty 6.0 of 10

    KV-cache eviction, prompt compression, recurrent state bounding, and agent memory consolidation are unified as one rate-distortion problem with a shared lower bound, shared failure mode, and transferable mechanisms.

  2. Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Sleep-time Knowledge Seeding plus Dreaming lets LLMs expand capacity, distill fragile in-context memories into stable parameters, and self-improve without human labels.

  3. LoRA-Gen: Specializing Large Language Model via Online LoRA Generation

    cs.CL 2025-06 conditional novelty 6.0 of 10

    LoRA-Gen generates task-specific LoRA weights with a cloud-side LLM and reparameterizes them into a smaller edge model, enabling training-free specialization with compressed context.

  4. Cartridges: Lightweight and general-purpose long context representations via self-study

    cs.CL 2025-06 conditional novelty 6.0 of 10

    A per-corpus trained KV cache, called a Cartridge, matches full-context in-context learning quality on long-document benchmarks while using up to 38.6x less serving memory.

  5. Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Reranking symmetric-task inputs so that query-relevant elements occupy high-exposure positions can substantially reduce LLM errors on aggregate queries.

  6. Not Worth Another Token: Marginal Value Estimation for Efficient Deep Research Agents

    cs.AI 2026-08 conditional novelty 4.0 of 10

    Stage placement, not the scoring rule, dominates pruning effectiveness in deep research agents; early post-retrieval pruning cuts token usage by up to 73% with modest quality loss.

  7. AI Governance through Markets

    econ.GN 2025-01 conditional novelty 4.0 of 10

    Market governance mechanisms, supported by standardized AI disclosures, can create financial incentives for responsible AI development, according to this policy paper.

  8. PIS: Linking Importance Sampling and Attention Mechanisms for Efficient Prompt Compression

    cs.CL 2025-04 reject novelty 3.0 of 10

    PIS prunes tokens with BERT attention and TF-IDF, chooses per-sentence compression ratios with a DDQN, and drops similar sentences via a Russian roulette rule, reporting modest QA and summarization gains on GPT-4o-mini.

  9. Legal Document Summarization: Enhancing Judicial Efficiency through Automation Detection

    cs.CL 2025-07 reject novelty 1.0 of 10

    A legal document summarization framework is described, but the experiments use four non-legal summarization datasets and generic equations, so the claimed judicial efficiency improvements are not established.

Pith tools