Skip to content

Category

small language model

3,317 papers

#small language model Open access Oct 2026

eARCO: Efficient Automated Root Cause Analysis with Prompt Optimization

Root cause analysis (RCA) for incidents in large-scale cloud systems is a complex, knowledge-intensive task that often requires significant manual effort from on-call engineers (OCEs). Improving RCA is vital for accelerating the incident resolution process and reducing service downtime and manual efforts. Recent advanc...

Drishti Goel, Raghav Magazine, Supriyo Ghosh et al. · 1 citation
#small language model Open access Oct 2026

When Does Smaller Beat Larger? Accuracy Equivalence and Output Modality Advantage of Encoder-Only Models in Domain Question Answering

In domain-specific knowledge question answering (QA) for fields such as oceanography, systems face not only deployment constraints--offline operation, data sovereignty, and long-term cost control--but also a deeper, often overlooked problem: generative large language models (LLMs), as pure text generators, are architec...

Yiping Bai · 0 citations
#small language model Open access Oct 2026

Developmental Analysis and Technical Report: Small Language Model (SLM) Training from Scratch

This report documents the ongoing development and empirical analysis of a 4.2-million-parameter Transformer-based small language model (SLM) trained from scratch by Novum Labs. The objective of this project is to evaluate the learning trajectory, convergence dynamics, semantic coherence, and dataset scaling characteris...

Khandakar Aaditta Arnab · 0 citations
#small language model Open access Oct 2026

Automatic disfluency correction for a linguistically complex language

Automatic disfluency correction is an important task in natural language processing, particularly for morphologically rich and low-resource languages such as Tamil. Disfluencies including repetitions, interjections, prolongations, and part-word repetitions can negatively affect the performance of speech transcription...

R. M., S. Pravin · 0 citations
#small language model Open access Oct 2026

AI Development with Python for Cybersecurity and Digital Forensics: Student Materials

Open educational resources for two four-hour workshops in a master's programme in network forensics. In both workshops students build something small with the help of an AI assistant and then establish how far it can be trusted. The code is short; the work is in the checking. Workshop 1: AI-assisted network detector. S...

Olga Torstensson · 0 citations
#small language model Book Open access Oct 2026

Foundations of Computational Linguistics: For EFL University Students

Foundations of Computational Linguistics: For EFL University Students is a free undergraduate textbook on precise representations and computational analysis of language. Part of the Theoretical Linguistics branch of English Language Studies for EFL University Students, it is designed for adult EFL students who have com...

Munassir Alhamami · 0 citations
#small language model Open access Oct 2026

A Preregistered Comparison of Acceptance-Gate Architectures for an LLM That Rewrites Its Own Code

When a language model is allowed to revise a program repeatedly and a gate decides which revisions to keep, what the gate checks determines what the model does. We report a preregistered experiment in which an LLM optimiser rewrote a small posture-risk classifier for 20 revisions per trajectory under four acceptance ar...

Nicholas J. Lamb · 0 citations
#small language model Open access Oct 2026

OSIRIS v4.5.1: a governed, local-first console for testing whether a small language model learns from conversation

v4.5.1 is a correction release. The claims register's τ-phase matcher now recognises '46.0 µs' and no longer matches unrelated 46 µs delays, and its finding states the phase definition as the code computes it. In the console, a document pasted while OSIRIS was answering could be classed as typed and trained on; held me...

Devin Phillip Davis · 0 citations
#small language model Open access Oct 2026

An Exact Factor-Two Witness for Two-Way Deterministic Complementation

This preprint establishes an unconditional lower bound for complementing two-way deterministic finite automata. For every n ≥ 22, it constructs a language K_n over a fixed three-letter alphabet whose source state complexity is exactly n and whose complement state complexity is exactly 2n. These exact counts use accepta...

Sudais Arif · 0 citations
#small language model Open access Oct 2026

Linda-Pro 1.3.1: a local ensemble detector of AI-generated text in English, Polish and Russian

Technical report on Linda-Pro 1.3.1: a local ensemble detector of AI-generated text in English, Polish and Russian (stylometry + two merged transformer models, one decision rule per language). Version 1.3.1 is a weights update retrained without text generated by Llama 3.x models, with additional permissively licensed h...

Vladyslav Manzyuk · 0 citations
#small language model Open access Oct 2026

audit-horizon-core: verification code for "Self-audit horizons of finitely axiomatized theories"

Verification code for the paper Self-audit horizons of finitely axiomatized theories: non-accumulation of finite reflection and the cost of external verification (H. Sendo). The code reproduces every numerical result of the paper: exact counts of formulas and the singularity analysis for first-order languages L(c,k,m)...

Hazime Sendo · 0 citations
#small language model Open access Oct 2026

Auditing unsupported claims in LLM-written intrusion alert explanations

Large language models (LLMs) are now used to explain intrusion-detection alerts, yet an explanation can sound confident while stating things the evidence does not support. We divide such statements into two tiers. Tier 1 covers unsupported specifics and Tier 2 covers background knowledge that is absent from the evidenc...

Ishita Soryan · 0 citations

From tech blogs

See all →
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.