Pith. sign in

REVIEW 2 cited by

On the Limitations of Compute Thresholds as a Governance Strategy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.05694 v2 pith:2NXYWMAZ submitted 2024-07-08 cs.AI cs.CLcs.ETcs.LG

On the Limitations of Compute Thresholds as a Governance Strategy

classification cs.AI cs.CLcs.ETcs.LG
keywords computethresholdsessayriskbettercomputergovernanceunderstanding
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

At face value, this essay is about understanding a fairly esoteric governance tool called compute thresholds. However, in order to grapple with whether these thresholds will achieve anything, we must first understand how they came to be. To do so, we need to engage with a decades-old debate at the heart of computer science progress, namely, is bigger always better? Does a certain inflection point of compute result in changes to the risk profile of a model? Hence, this essay may be of interest not only to policymakers and the wider public but also to computer scientists interested in understanding the role of compute in unlocking breakthroughs. This discussion is timely given the wide adoption of compute thresholds in both the White House Executive Orders on AI Safety (EO) and the EU AI Act to identify more risky systems. A key conclusion of this essay is that compute thresholds, as currently implemented, are shortsighted and likely to fail to mitigate risk. The relationship between compute and risk is highly uncertain and rapidly changing. Relying upon compute thresholds overestimates our ability to predict what abilities emerge at different scales. This essay ends with recommendations for a better way forward.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Verifying Restrictions on Frontier AI Research

    cs.CY 2026-06 unverdicted novelty 5.0

    Catalogs 28 candidate verification mechanisms for restrictions on AI research and identifies key factors affecting their feasibility.

  2. Hardware-Level Governance of AI Compute: A Feasibility Taxonomy for Regulatory Compliance and Treaty Verification

    cs.CR 2026-04 unverdicted novelty 5.0

    Proposes a feasibility taxonomy of 20 hardware-level AI compute governance mechanisms organized by monitoring, verification, and enforcement, with mappings to regulatory scenarios that highlight immaturity of treaty-v...