Sign inGet started
Paper · arXiv

Fault-tolerant foundation models

Emerging computer hardware often trades reliability for energy efficiency; here we show that large-language models (LLMs) can be trained to tolerate this unreliability, and that rather than degrading, their error resilience actually increases as they grow. Modified neural scaling laws inferred from 40,000 GPU-hours of training runs on simulated faulty digital hardware quantify this trend and suggest that models learn to compute within "good" error-correcting codes, whose relative overhead remains finite no matter how large the model gets. This finding leads us to conjecture that appropriately trained LLMs may be formally fault-tolerant; if true, running AI inference on low energy, faulty ...

AuthorsTrevor McCourt, Ila R. Fiete, Isaac L. Chuang
Primary categorycs.LG
Published7 October 2026
Last updated at source7 October 2026
cs.LGcs.AIcs.AR
Embed this entry
<iframe src="https://silytics.si/embed/item/f9d12c40-fb09-4490-a8c1-f2b5645bf242" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.