arXiv AI

Amplitude-Only FFN Intervention for Tool-Structured LLM Inference: Method, Gated Evaluation Protocol, and Cross-Model Empirical Results

The paper introduces Amplitude Gating (AG), an inference-time technique that selectively masks feed‑forward network (FFN) activation coordinates while keeping pretrained weights unchanged. AG employs six SwiGLU sites to separate shared and gate‑only inputs, expands gate/value channels, and uses magnitude‑ranked entropy masks or a Newton‑Schulz windowed ranking variant to provide alternative forward paths without retraining. Experiments on three Qwen checkpoints and eight text/tool endpoints show modest improvements in function‑call and ToolBench endpoints, though statistical significance is not established and further experiments are required.

arXiv AI
Sep 4

ObserverBench: Testing Mechanistic Estimates for Intervention and Control

ObserverBench is a benchmark framework that evaluates whether internal mechanistic estimators—called observers—are suitable for guiding interventions, control, or safety actions in language models. It separates estimation accuracy from the loss incurred by the chosen action, showing that accurate predictions do not always lead to better decisions. Experiments on GPT‑2‑small, Qwen2.5‑7B, Gemma‑2‑9B‑it, and Qwen3.5‑9B demonstrate that observers trained on action loss can reduce deployment loss, while traditional metrics like AUROC may rank monitors differently from actual performance.

By Vijay Erramilli
arXiv Machine Learning
Sep 23

Spectral Tail Interventions in Decoder-Only Language Models: Reasoning-Sensitive Weight Structure from Controlled Surgery

The paper investigates how the upper spectral tails of weight matrices in decoder‑only transformer language models influence reasoning behavior. By performing controlled interventions on the query–key product and comparing them to factor‑level surgeries, the authors find that edits targeting the spectral tail more strongly affect model performance across multiple checkpoints and reasoning benchmarks. The study also explores how inverse participation ratios predict accuracy transitions and shows that tail‑aware low‑rank adaptations converge faster than standard methods.

By Ibne Farabi Shihab, Sanjida Akhter, Md Najmus Swaqeeb, Abu Sa-Adat Mohamed Moon-Im Al Ahsan, Anuj Sharma
arXiv Machine Learning
Oct 3

Sharpen Before You Adapt: Data-Free Entry-State Sharpening for Test-Time Reinforcement Learning

The paper introduces entry-state sharpening, a data‑free pre‑training step that prepares a language model’s checkpoint in a sharper, lower‑entropy state before test‑time reinforcement learning (TTRL). By reducing policy entropy, the model can more efficiently use its limited adaptation budget, leading to higher endpoint conversion efficiency across tasks such as MATH, GPQA, and AMC. Experiments with different data‑free objectives (e.g., R‑Zero vs. SPIRAL) demonstrate that the choice of pre‑training objective strongly influences the checkpoint’s readiness for TTRL, and a label‑free self‑distillation intervention can further sharpen the entry state.

By Zhanming Zhang, Vinoth Selvendran
arXiv Machine Learning
Sep 1

The Intervention Gap in Latent World Models

The paper introduces the concept of intervention fidelity in latent world models, measuring whether a model’s open‑loop transitions align with actual environment interventions. Experiments on TD‑MPC2, Cheetah, and DreamerV3 show that high reward fit does not guarantee fidelity, and that self‑supervised models can outperform task‑anchored ones in preserving intervention effects. The authors propose a capture‑gated audit to localize failures and argue that fidelity must be directly audited on the model’s native interface.

By Donna Vakalis
arXiv Machine Learning
Oct 23

Why Constrained Updates Still Forget: A Functional-Path Analysis of Continual SFT

The paper investigates why constrained updates in supervised fine‑tuning (SFT) still lead to forgetting by developing a functional‑path analysis that decomposes changes in old loss into controlled direction, gradient staleness, probe mismatch, and finite‑step effects. It introduces a conditional refresh budget and identifies a restoring direction provided by informative replay, showing that the placement of constraints relative to Adam and the granularity of constraints significantly affect retention across code‑label audits. The study also explores checkpointed generation, replay schedules, and sequential‑task comparisons, demonstrating that subspace regularization, projection, and supervised replay differentially influence backward transfer and content retention.

By Qingsen Ma, Dianyun Wang, Jiahong Liu, Irwin King
Hugging Face Trending Papers
Sep 2

ObserverBench: Testing Mechanistic Estimates for Intervention and Control

ObserverBench is a benchmark framework that evaluates whether internal mechanistic estimators—called observers—are suitable for guiding interventions, control, or safety actions in language models. It separates estimation accuracy from the loss incurred by the chosen action, demonstrating that accurate average estimates can still lead to poor decisions. Experiments on GPT‑2‑small, Qwen2.5‑7B, Gemma‑2‑9B‑it, and Qwen3.5‑9B show that observers trained on action loss tend to select lower‑loss actions, while traditional metrics like AUROC can rank monitors differently from deployment loss, highlighting the need for task‑specific evaluation.