deterministic-sensors-should-precede-llm-judges
mechanismmechanism reasoningpending review

In an agent's verify-and-fix loop, deterministic checks — tests, linters, schema validators — should be exhausted before any model-based judge is added, because they are free, fast and give the same verdict every time, while an LLM-as-judge costs tokens per run, returns non-deterministic verdicts, and so belongs only on properties no rule can express, and even then as an advisory signal until measured against human review.

Ingested from a paper but not yet reviewed by a human. It is deliberately inert: it does not move any technique’s standing, does not count toward the backtest, and is excluded anywhere a claim would carry weight. Read the source before relying on it.

Capability: Fixing its own mistakes · Agentic, Coding agent

Sources

Status: pending-reviewLast checked: 2026-09-11Evidence activityHow much the field cites the sources under this claimvery heavily cited in the last 12 months503 in 12mo · 1164 total — Large Language Models Cannot Self-Correct Reasoning Yet2 sources not yet checked, so not counted
Contest this claim

Disagreeing is the most useful thing you can do here. Both sides of every contested claim in this catalog were assembled by the same person, which is its weakest point.

Related claims

Notes

Sits beside external-feedback-repair-works-only-with-real-grounding and says why: the grounding that makes reflect-and-retry work is exactly what a computational sensor provides and an inferential one does not.