Pre-registration of a computational experiment on model collapse in a low-resource language setting, frozen before any model is trained. We fine-tune the open-weight model google/gemma-3-270m (bfloat16) in Bangla and in English over six generations of self-training, where each generation is trained on text generated by the previous one. Three regimes are compared per language: REPLACE (synthetic text only), ACCUMULATE (real seed text plus all synthetic generations) and ACCUMULATE-FILTER (the same with a pre-specified quality filter). Corpora are built from public Bangla and English Wikipedia and openly licensed web text, matched across languages in words per document and in token budget (10 million generated tokens per generation). Outcomes are held-out log-perplexity and bits per byte, lexical diversity of fixed-prefix samples, and recall on a paired factual-probe set, all computed automatically. Hypotheses: H0, both languages degrade under REPLACE (anchor); H1, Bangla degrades faster than English under REPLACE on the pre-specified slopes; H2, the relative benefit of accumulating real data is smaller for Bangla. The decision rule, the robustness phases in a fixed priority order with a stopping rule under the approved compute cap (one rented RTX 4090, US$30 / 70 GPU-hours), the scoped-out conditions and the analysis plan are given in the attached 01_PREREGISTRATION.md; exact chain and corpus settings are in chains.yaml and corpora.yaml; prereg_freeze_2026-10-13.json lists the SHA-256 of each attached file. No human participants are involved; the study uses public text and model outputs only. Authors: Md Tahidul Islam (ORCID 0009-0004-6798-892X, corresponding) and Maksuda Akter (ORCID 0009-0004-5808-518X), Department of Computer Science and Engineering, CCN University of Science & Technology, Cumilla, Bangladesh. Registered before any training run.
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.