Skip to content
#small language model Open access

A Region, Not a List: A Pre-Registered Bilingual Induction-Circuit Probe Across Three Scales

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Explainable Artificial Intelligence (XAI)

Abstract

Mechanistic interpretability has mapped the induction circuit –- the attention head that copies a token it has seen in context –- almost exclusively in English models, and a circuit localized in one small carrier is routinely read as if it described the family. This paper does both tests at once. We report a pre-registered head-level probe of induction inside a Chinese-dominant bilingual model (Qwen2.5-0.5B-Instruct; 24 layers x 14 heads), run on CPU only and with no external interpretability library, and then apply the same driver, the same $20$ parallel sentence pairs, the same score and the same frozen criteria to a larger carrier of the same family (Qwen2.5-1.5B-Instruct; 28 layers x 12 heads) and to a third carrier at a further scale (Qwen2.5-3B-Instruct; 36 layers x 16 heads). At the reference scale, a token-level random-repetition probe and a Chinese natural-language probe recover the identical top-8 head set (Jaccard $1.000$): the natural-language phenomenon is the same mechanism, head for head. Chinese and English share six of eight heads, with language-specific members (Chinese L16H02/H03; English L09H10 and the final-layer L23H02), and Chinese induction strength is $4.2 $ English ($0.1912$ vs.\ $0.0454$); forced character-level segmentation leaves the head set largely intact ($0.600$, granularity-invariant). The cross-scale test splits. The instrument replicates: the circuit is detectable with the same margin (signal maxima $0.971/0.993$ against null maxima $0.031/0.028$), the Chinese cross-level consistency holds ($0.455$), language sharing holds ($0.455$), and the granularity reading is preserved ($0.600$, granularity-invariant). The membership does not replicate uniformly: the English cross-level consistency is non-monotone across scale ($0.600$ at $0.5$B, fails at $1.5$B with $0.231 < 0.4$, restored at $3$B with $0.455$), and the strength asymmetry narrows with scale ($4.2 4.6 2.0 $) while remaining positive. A post-hoc check under three set definitions separates the English failure at $1.5$B (partly a top-$k$ truncation artifact: top-16 restores $0.455$) from the granularity reversal, which is substantive at $1.5$B (all three definitions agree) but definition-sensitive at $3$B (top-8 $0.600$, score $>0.5$ only $0.167$) –- the participation claim rests on the pre-registered top-8 definition, not on definition robustness. The durable cross-scale objects are therefore the circuit region and its strength asymmetry; the exact membership list is not. We report the negative branches as the result, not as a failure. Pre-registrations, both probe ledgers, the shared driver and analysis scripts are available from the authors upon reasonable request via email.

View source

Similar papers

#small language model Dataset Open access Oct 2026

Socratic guiding questions in synthetic arithmetic data: matched LoRA runs (revision v2)

Supporting data, adapters, predictions and code for the article *Low-Cost LoRA Fine-Tuning of Small Language Models for Multi-Step Arithmetic Reasoning* by Jake O'Grady, Asena Isik Gürhan, Chee Fong Ting and Effirul Ramlan (University of Galway). We generated 20,000 GSM8K-derived arithmetic problems with step-by-step s...

O'Grady, Jake, Gürhan, Asena Isik, Chee, Fong Ting et al. · 465 citations
#computer vision Open access Jun 2016

Software Development in Startup Companies: The Greenfield Startup Model

The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.

Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al. · 178 citations · ⚡14
#computer vision Open access Oct 2016

Software Startups - A Research Agenda

Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.

M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al. · 157 citations · ⚡17
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15
#computer vision Review Open access May 2015

A survey study on major technical barriers affecting the decision to adopt cloud services

The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.

Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al. · 111 citations · ⚡8
#computer vision Open access Feb 2018

Lean Internal Startups for Software Product Innovation in Large Companies: Enablers and Inhibitors

This study investigates how Lean internal startup facilitates software product innovation in large companies and identifies its enablers and inhibitors, and shows the potential of the method-in-action framework to investigate the Lean startup approach in non-startup context.

Henry Edison, Nina M. Smørsgård, Xiaofeng Wang et al. · 78 citations · ⚡6

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.