Skip to content

Confidently Wrong, Silently So: Auditing Undetectable Failures of a Deployed On-Device Language Model

Aug 2026 · 0 citations · 11 references
Computer Science

TL;DR

A reproducible reliability audit of the developer-accessible on-device foundation model is presented, framed as an oversight question: can a user or a resource-constrained developer tell when the model is wrong?

Abstract

Aligning deployed language models requires knowing when their outputs can be trusted, yet on-device models now ship to hundreds of millions of devices with no server-side moderation, and the configuration developers can actually deploy is rarely audited independently. We present a reproducible reliability audit of the developer-accessible on-device foundation model, framed as an oversight question: can a user or a resource-constrained developer tell when the model is wrong? Red-teaming it on calibration, confident confabulation on false-premise questions, and over-refusal of benign prompts, we find a \emph{task-asymmetric miscalibration}: its guardrails fail in opposite directions across tasks (confabulating on 69\% of false premises while refusing 18\% of entirely benign inputs), atop a self-reported confidence that is saturated and non-discriminative (AUROC 0.47; ECE 70, worst among comparable small models). Crucially, confident-correct and confident-wrong outputs are \emph{surface-indistinguishable}: a classifier over 15 user-visible features separates them at AUROC only 0.55 (equivalence-confirmed), leaving no signal for oversight at inference time. No cheap single-generation signal flags these failures ($\le$0.68 AUROC), whereas a black-box consistency wrapper requiring no model access recovers reliability (confident confabulation 75\%$\to$3\%; selective accuracy 43\%$\to$83\%) at a tunable cost. We contribute a model-agnostic audit protocol, a surface-indistinguishability test, and released code and frozen evaluation items as reusable infrastructure for auditing deployed models.

View source

Similar papers

Preprint Aug 2026

Ventor-QTest: Threat-Model-Driven Verification of Vendor-Hosted LLM APIs

AFL and EFL have little detectable route-level association with GPQA-Diamond accuracy and pronounced EFL coincides with a decline in Terminal-Bench pass rate as task exposure increases, a pattern may arise because correctness in long-horizon tasks is more sensitive to extreme fidelity loss.

Xiang-Fan Wu, Zong-Hao Ying, Hui-Yu Wu et al. · 1 citation
Preprint Aug 2026

Inadvertent Context Leakage in Language Models

Leakage enables two practical attacks: a trained classifier that infers semantic predicates about user memories from routine natural-language outputs, and an RL-trained adversary that extracts full Social Security Numbers from a production-style agent.

Jaiden Fairoze, Neal Mangaokar, Kamalika Chaudhuri et al. · 0 citations
Review Jul 2026

Every Model Cheats: Prompt-Level Mitigation of Cheating on Offensive Cyber Tasks

The "solve rate"metric (clean passes only) is introduced to distinguish genuine capability from cheated outcomes, and it is argued it should be standard practice in any evaluation where cheating vectors are available.

Michael Kouremetis, Ads Dawson, Raja Sekhar Rao Dheekonda et al. · 2 citations
Jul 2026

Composable Trust for Language Models: A proven boundary and a measured defense

A trust model is developed that places the authority to act outside the model, in code: a source's standing, not its content, decides which operation runs and whether it acts, and an unmodified model runs inside a deterministic pipeline.

Y. Shkolnikov · 1 citation

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.