arXiv Computation and Language By Piotr Wilam

Calibrated concept profiles: making the reading of a model's neurons a measurement

Read the original on arXiv Computation and Language →

The paper introduces calibrated concept profiles, a method that treats direct neuron readings as measurable quantities. By sampling prompts from a defined distribution and generating two independent batteries, the authors compute a per‑neuron profile expressed in the neuron’s own activation spread, complete with noise units and a minimum resolvable change. The approach is applied to OpenCoder‑1.5B across checkpoints spanning two trillion training tokens, providing unit‑scaled, chance‑level‑aware, and checkpoint‑specific construct attribution for each neuron.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
Nov 9

Representational drift in a code model: behaviour settles, which neurons carry it does not

The study investigates representational drift in the OpenCoder‑1.5B language model by tracking how neurons encode 169 Python constructs during pretraining on two trillion tokens. While the loss for 16 grammar‑fixing constructs quickly reaches a floor, the specific neurons that carry these constructs continue to change throughout training, with no stable carrier set emerging even at the final checkpoint. The authors find that removing the identified carriers incurs a measurable performance penalty, yet the carrier sets remain dynamic, challenging the hypothesis that they settle over time.

By Piotr Wilam
arXiv AI
Oct 16

Learning to Read Out: Unembedding Dynamics in Language Model Pretraining

The paper investigates when a language model actually learns task information versus when its readout (unembedding matrix) learns to express that information. Using a new parameter‑trajectory cross‑coding method, the authors find that hidden states can encode task data early in training, but the readout reorganizes only in a narrow window (0.4–1.1% of Pythia’s pretraining). By varying the readout learning rate, they show that faster readout learning reduces the gap between hidden‑state encoding and output expression without affecting final performance.

By Matteo He, William F. Shen, Alex Iacob, Andrej Jovanovic, Xinchi Qiu, Nicholas D. Lane
arXiv AI
Oct 28

Channel Selection for Mixture-of-Experts Decoding Needs No Calibration Data

The paper demonstrates that Mixture-of-Experts (MoE) models can avoid the need for calibration data when selecting which expert channels to load during decoding. Instead of using a calibrated threshold, a top‑k selection strategy—choosing the k highest‑scoring channels per token—achieves comparable or better performance without calibration. Additionally, the authors propose a reader that uses a ternary sketch and low‑rank mapping to recover skipped channels, achieving 98.1% of full‑model accuracy while reading only 17.8% of expert weights and speeding up inference by up to 2.69× compared to optimized vLLM.

By Geunhyoung Kim, Sung Ju Hwang
arXiv Machine Learning
Aug 27

Amplifying, Not Learning: The Price of Out-of-Distribution Generalization in AI-Text Detection

The paper shows that AI‑text detectors, rather than learning a clear AI‑versus‑human boundary, amplify an inherited predictability axis that already exists in language models. This amplification causes detectors to over‑flag fluent, formal human writing while missing high‑temperature AI outputs, and the bias persists across languages, code, and detector architectures. A training‑free operator can relocate the bias but cannot erase it, underscoring that the unfairness is a structural cost of out‑of‑distribution generalization.

By Alexander Smirnov
Hugging Face Trending Papers
Oct 27

Channel Selection for Mixture-of-Experts Decoding Needs No Calibration Data

The paper demonstrates that Mixture-of-Experts (MoE) decoding can avoid the need for calibration data by using a top‑k channel selector instead of a calibrated threshold. Top‑k selection consistently matches or outperforms threshold‑based methods across various read budgets and tasks, eliminating issues like repetition‑loop collapse. Additionally, the authors propose a reader that uses a ternary sketch and low‑rank mapping to recover skipped channels, achieving 98.1% of full‑model accuracy while reading only 17.8% of routed‑expert weights and speeding up MoE blocks by up to 2.69× compared to optimized vLLM.