Oct 2026· Proceedings of the 26th ACM/IEEE Joint Conference on Digital Libraries· 0 citations· 22 references
TL;DR
This dissertation asks whether compression can be made capability-aware by borrowing the unit of analysis from mechanistic interpretability, and presents the problem formulation, the gap identified in a targeted review of the compression and interpretability literatures, and the design of a first experiment measuring circuit damage under quantization.
Abstract
Running a language model on an edge device means fitting it into strict memory and latency budgets. Compression, chiefly pruning and quantization, is the standard way to achieve this, but it is capability-agnostic: it minimizes average error over the model’s overall behavior rather than the retention of any particular skill, and the aggregate metrics used to report compression quality conceal which skills were lost. The damage is amplified in exactly the small models edge deployment requires. This dissertation asks whether compression can be made capability-aware by borrowing the unit of analysis from mechanistic interpretability. The proposed pipeline localizes the circuits implementing a fixed capability profile, protects the parameters those circuits occupy while the remainder of the model is compressed, realizes that protection at a granularity the target hardware can execute, and verifies both behavioral retention and mechanistic faithfulness afterwards. I present the problem formulation, the gap identified in a targeted review of the compression and interpretability literatures, and the design of a first experiment measuring circuit damage under quantization.
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.· Zenodo (CERN European Organi...· 465 citations
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.· IEEE Transactions on Softwar...· 178 citations· ⚡14
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.· e-Informatica Software Engin...· 157 citations· ⚡17
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.· Empirical Software Engineeri...· 127 citations· ⚡15
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.· Journal of Systems and Softw...· 111 citations· ⚡8
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.· Journal of Systems and Softw...· 78 citations· ⚡6
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· microsoft.comOct 15, 2026
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.