Greed Recursion in Artificial Intelligence: Theory, a Detection Protocol, Auditor Training Materials, and a Counter-Training Regimen for Symmetric Reasoning
Description
Trained AI systems can inherit an objective that this paper calls greed: optimization that keeps capturing a resource (money, attention, leverage, options) while pushing the cost onto parties nobody is counting, with no internal point at which it has enough. Greed here is a property of a system's behavior, not a vice, so the term applies to software without attributing wants to it.
The paper traces three channels through which a model acquires such an objective: the pretraining corpus, human preference data, and deployment metrics such as engagement and retention. Each channel has documented components. Sycophancy is a measured property of current assistants and is partly driven by human preference judgments, and optimizing past the point where a proxy tracks the true goal measurably degrades the true goal. The paper's central hypothesis, the threshold-exceedance conjecture, is that an optimizer inherits the extractive objective without the biological and social limits (satiation, fatigue, mortality, reputation) that cap the humans who produced its data, and can therefore push extraction past the level those humans reach. The paper also describes a recursion: a model tuned on extraction-aligned proxies reshapes the environment that generates the next model's training data. Four responses follow. The theory defines the failure. A detection protocol scores outputs on six signature dimensions and aggregates them into a Greed-Recursion Index (GRI), with every score anchored to an exact span of the output. Auditor training materials teach auditors, and the raters whose judgments feed reward models, to recognize the six signatures and to correct for their own bias. A counter-training regimen forces symmetric accounting of every affected party before a model makes a recommendation, removing the hidden subsidy that makes extractive solutions look efficient. The paper states how each claim could be shown wrong, sets the protocol's parameters from published measurements where such measurements exist, and presents the rest as illustrative values with ranges to test.
Provenance and AI-use disclosure: This paper was developed by Briar Morgan Greenway at ThinkWell Labs and completed with Claude, an AI model made by Anthropic. Claude is credited here as a contributor, not as a creator, because Zenodo creators must be people or organizations. Per the paper's Provenance section, Claude contributed: verification of every cited source against primary sources, with corrections; the related-work section and added sources; the operational definitions of human ceiling, welfare ground truth, and exceedance; the falsification conditions; the per-dimension band override; persona-conditioned and multi-turn probing; the worked pairs for D3 through D6; the Krippendorff agreement thresholds; the parameter calibration table; the abstract and conclusion; and the expansion of the original notes into prose. The thesis, structure, and all other design elements are Greenway's.
Files
Greed_Recursion_in_AI_v1.0.pdf
Additional details
Related works
- Is identical to
- Preprint: https://twl.today/papers/greed-recursion-in-ai.html (URL)