PofoliaShared via Pofolia

Discover Artificial Intelligence· 2026Q1

Admissibility defines structural limits on optimisation in artificial intelligence

Duston Moore

Short summary

Failures in AI, such as reward hacking and benchmark failure, stem from an 'admissibility' condition: the observation regime must preserve distinctions needed for the AI's task, a constraint often overlooked.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Many AI failures arise because the observation regime fails to preserve distinctions required by the task (admissibility condition).
  • A predicate is decidable from observations only if it factors through the quotient induced by the observation map.
  • The concept of 'warrant debt' describes a residual obstruction where local coherence doesn't guarantee global assembly.
  • An architecture separating 'productive' (optimization) and 'closure' (admissibility checking) layers is proposed to manage these limits.

AI-generated from the title and abstract; the full text is not read.

Abstract

Abstract Many persistent failures of contemporary artificial intelligence are treated as failures of optimisation, data coverage, or statistical robustness. This paper argues that a recurring class of these failures arises earlier: the observation regime under which a system acts may fail to preserve the distinctions required by the predicate it is asked to decide. We make this condition precise. A predicate $$\Phi :X\rightarrow \{0,1\}$$ is decidable from observations $$M:X\rightarrow O$$ only when $$\Phi $$ factors through the quotient that M induces on X . This is an elementary factorisation condition. Its role here is not to supply a new theorem of set theory, but to state a prior proof obligation for consequential artificial intelligence systems. The paper develops that obligation in four steps. First, it gives a finite worked example, with explicit matrices and an explicit residue, in which local coherence does not decide global assembly. The residual obstruction is called warrant debt. Second, it gives an executable finite certificate prototype in which a cyclic diagnostic system receives one of three accountable verdicts: coherence failure, global admissibility, or warrant debt. Third, it gives two artificial intelligence schemata, reward hacking and benchmark or proxy failure, each as an $$X,M,\Phi $$ triple. Fourth, it states an architecture in which productive search is separated from closure authority. The productive layer proposes, predicts, or optimises; the closure layer checks admissibility, reports inadequacy, and, where the regime fails, forces rejection or escalation. The paper also records the limits of the proposal, especially the unresolved problem of detecting inadmissibility when the effective observation map is implicit in learned weights rather than declared in the architecture. A final, speculative section treats apparent human randomness as possible evidence of regime change, but only as philosophical motivation for the architectural distinction.

The authors' abstract, as published at the source. Discover Artificial Intelligence, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computational Theory and Mathematics

Computational Theory and MathematicsComputer Science