arXiv Machine Learning
Jul 10
Prompt Compression via Activation Aggregation
arXiv:2607. 08399v1 Announce Type: cross Abstract: Large language models process prompts by propagating activations through dozens of layers before generating a response.
Learning a Single Token to Replace Long System Prompts in LLMs
Related stories
arXiv AI
Jun 10
GRID: Scaling Task-Agnostic Inference in Continual Prompt Tuning
arXiv:2507. 14725v4 Announce Type: replace-cross Abstract: Prompt-based continual learning (CL) offers a parameter-efficient way to adapt large language models (LLMs) across task sequences.
arXiv AI
Jul 28
SyRuP: Enhancing System-Prompt Following via Reward-Guided Prediction in LLM Decoding
arXiv:2607. 23991v1 Announce Type: cross Abstract: Large Language Models (LLMs) are increasingly controlled through system prompts that specify roles, styles, formats, and safety requirements.
arXiv AI
Aug 24
SCOPE: A Generative Approach for LLM Prompt Compression
SCOPE is a training‑free generative prompt‑compression framework that reduces LLM input length by chunking a prompt into semantically coherent segments, rewriting each chunk to be more concise, and then reconstructing a coherent prompt. Unlike token‑removal methods, SCOPE’s chunk‑level rewriting preserves critical information and text coherence, and includes optimization techniques for finer‑grained control of compression ratios. Extensive evaluations on question‑answering and summarization tasks show that SCOPE consistently outperforms selective compression baselines, especially at high compression ratios.
Hugging Face Trending Papers
Jul 2
PARTREP: Learning What to Repeat for Decoder-only LLMs
While decoder-only LLMs excel at a vast array of natural language tasks, it suffers from an asymmetric information flow induced by causal attention: later tokens are richer in contextual grounding than earlier ones. A simple and effective remedy is prompt repetition -- just appending a second copy of prompt before generation can redistribute grounding across positions and improve reasoning performance.
arXiv Machine Learning
Aug 3
PTP: Previous-Token Prediction based LLM Inversion for Near-Exact Prompt Reconstruction
arXiv:2607. 29378v1 Announce Type: cross Abstract: Large language models (LLMs) generate text by auto-regressively sampling the next token.
arXiv Machine Learning
Jul 3
PARTREP: Learning What to Repeat for Decoder-only LLMs
arXiv:2607. 01792v1 Announce Type: cross Abstract: While decoder-only LLMs excel at a vast array of natural language tasks, it suffers from an asymmetric information flow induced by causal attention: later tokens are richer in contextual grounding than earlier ones.
arXiv AI
Aug 3
TAPR: Enhancing LLM Performance with a Task-Aware Prompt Rewriter
arXiv:2607. 28657v1 Announce Type: new Abstract: Large Language Models (LLMs) often require carefully crafted prompts to unlock their full potential, which can be a barrier for non-expert users.
arXiv Machine Learning
Aug 5
Learning to Translate from Soft to Hard LLM Prompts
arXiv:2605. 27642v2 Announce Type: replace-cross Abstract: Soft prompting, also known as continuous prompting, is a parameter-efficient method for tuning LLMs to specific tasks.
arXiv AI
3d ago
DIP: Dynamic In-Context Planner For Diffusion Language Models
arXiv:2601.03199v2 Announce Type: replace-cross Abstract: Diffusion language models (DLMs) have shown strong potential for general natural language tasks with in-context examples. Existing In-Context...
arXiv AI
Jul 31
ARC-Encoder: learning compressed text representations for large language models
arXiv:2510. 20535v2 Announce Type: replace-cross Abstract: Recent techniques such as retrieval-augmented generation or chain-of-thought reasoning have led to longer contexts and increased inference costs.
arXiv Machine Learning
Aug 4
Learning What to Remember: Test-Time Training via Context Distillation
arXiv:2608. 01672v1 Announce Type: cross Abstract: Effective long-context modeling is not merely about retaining more of the past, but about preserving the information that may prove relevant later.