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.
Transmuting prompts into weights
arXiv:2510. 08734v3 Announce Type: replace Abstract: A growing body of research has demonstrated that the behavior of large language models can be effectively controlled at inference time by directly modifying their internal states, either through vector additions to their activations or through updates to their weight matrices.
Related stories
Hugging Face Trending Papers
Sep 23
Distilling Sequential Computation in Transformer Language Models
Transformer language models process sequences token by token in an autoregressive manner, making growing contexts increasingly expensive. Yet many adjacent token spans are highly predictable or freque...
arXiv Computation and Language
Sep 24
Distilling Sequential Computation in Transformer Language Models
arXiv:2609.27233v1 Announce Type: new Abstract: Transformer language models process sequences token by token in an autoregressive manner, making growing contexts increasingly expensive. Yet many adja...
arXiv AI
Aug 5
The Transformer Revolution, Part 1: Dynamic Processing through Output- Weight Interconnections
arXiv:2608. 03921v1 Announce Type: new Abstract: This paper offers a new interpretation of the Transformer during inference.
arXiv AI
Jul 2
CoT-X: An Adaptive Framework for Cross-Model Chain-of-Thought Transfer and Optimization
arXiv:2511. 05747v3 Announce Type: replace Abstract: Chain-of-Thought (CoT) reasoning enhances the problem-solving ability of large language models (LLMs) but leads to substantial inference overhead, limiting deployment in resource-constrained settings.
arXiv Machine Learning
4d ago
Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Space
arXiv:2609.37731v1 Announce Type: new Abstract: Activation space and parameter space provide complementary views of model computation. Activations represent information, while weights read, transform...
arXiv AI
Aug 11
The Transformer Revolution, Part 1: Dynamic Processing through Output-Weight Interconnections
arXiv:2608. 03921v2 Announce Type: replace Abstract: This paper offers a new interpretation of the Transformer during inference.
arXiv AI
Jun 16
Tyler: Typed Latent Reasoning for Language Models -- When to Think, What to Compute, and How Much to Allocate
arXiv:2606. 16360v1 Announce Type: cross Abstract: Chain-of-thought (CoT) prompting improves reasoning in large language models (LLMs) by externalizing intermediate computation as discrete text tokens, but this textual interface also introduces redundancy and inference overhead.
arXiv AI
Jul 22
Fluid Reasoning Representations
arXiv:2602. 04843v2 Announce Type: replace Abstract: Frontier large language models increasingly solve complex tasks involving abstract concepts through extended test-time thinking.
arXiv AI
Jun 4
Can Reasoning Path still be Effective as Input? Bridging Post-Reasoning to Chain-of-Thought Compression
arXiv:2510. 08647v2 Announce Type: replace-cross Abstract: Recent developments have enabled advanced reasoning in Large Language Models (LLMs) via long Chain-of-Thought (CoT), trading efficiency during inference for performance.
arXiv AI
Jul 28
Beyond Block Boundaries: Multi-Block Editing for Diffusion Large Language Models
arXiv:2607. 22663v1 Announce Type: new Abstract: Block diffusion has emerged as the dominant paradigm for scaling discrete diffusion language models (dLLMs), because decoding text in fixed-size blocks preserves parallel generation within each block while keeping the quadratic attention cost tractable.
arXiv Machine Learning
Aug 12
The Parser Already Knows: Lightweight Bias Correction in Constrained Decoding
arXiv:2608. 10137v1 Announce Type: cross Abstract: Grammar Constrained Decoding (GCD) forces Language Models (LMs) to produce syntactically valid outputs by masking out non-conforming tokens at each step.