Minerval
Sourceunknowntext stored

https://arxiv.org/html/2503.04941v2

Author not recordedDate not recordedOriginal︎ ↗Archived copy

Claims8
ExaminationsNone
Text156 sections
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 1, 2026
ReachNo copies recorded
StructureIn 8 claims' maps0 sources downstream across 8 claims
EvidenceNot yet read

Examinations

None recorded.

Text1122 passages · 8 marked

No examination yetMarked passage
Report GitHub Issue6 passages
Back to arXiv1 passage
Report Issue0 passages
Back to Abstract0 passages
Download PDF0 passages
Abstract0 passages
1 Introduction0 passages
2 The Model at a High Level0 passages
3 The AI Development Module0 passages
AI training runs0 passages
AI Inference0 passages
Adjustment costs0 passages
Depreciation of compute stock0 passages
Physical limits and heating bottlenecks0 passages
Law of motion for effective compute0 passages
Law of motion for the size of largest training run0 passages
4 The AI automation module: Mapping Effective Compute to Automation0 passages
5 The Macroeconomics Module: Translating Automation into Economic Output0 passages
Social planner’s problem0 passages
Technology0 passages
Investment frictions0 passages
6 Model Add-ons: R&D Externalities and Uncertainty0 passages
7 Model Functionality0 passages
Model Outputs0 passages
Model functionality: Some AI development trajectories that can be explored0 passages
8 Limitations0 passages
Lack of non-AI technological progress1 passage
Failure to incorporate data production0 passages
Stylized labor reallocation assumptions0 passages
Omission of market structure and strategic behavior0 passages
Stylized and static labor task space0 passages
Other bottlenecks0 passages
9 Concluding Remarks0 passages
References0 passages
A Authorship, Credit Attribution, and Acknowledgments0 passages
B A Basis for a Compute-Based Model of AI0 passages
C Solving The Model0 passages
C.1 Solution Approach: Baseline Model0 passages
C.2 Solution approach: R&D externalities add-on0 passages
D Model inputs0 passages
D.1 General economics parameters0 passages
D.2 Technological parameters0 passages
D.2.1 Hardware R&D parameters0 passages
D.2.2 Software R&D parameters0 passages
D.3 AI and compute parameters0 passages
D.3.1 Compute investment parameters0 passages
D.3.2 Compute stock parameters0 passages
D.3.3 Runtime compute parameters0 passages
D.3.4 Automation parameters0 passages
D.4 Add-ons0 passages
Sanity checks0 passages
Parameters requiring extra caution0 passages
License: CC BY 4.01 passage
GATE: An Integrated Assessment Model for AI Automation1 passage
Abstract1 passage
Keywords : artificial intelligence, integrated assessment models0 passages
Contents0 passages
1 Introduction0 passages
2 The Model at a High Level0 passages
3 The AI Development Module0 passages
4 The AI automation module: Mapping Effective Compute to Automation0 passages
5 The Macroeconomics Module: Translating Automation into Economic Output0 passages
6 Model Add-ons: R&D Externalities and Uncertainty0 passages
7 Model Functionality0 passages
8 Limitations0 passages
9 Concluding Remarks0 passages
References0 passages
A Authorship, Credit Attribution, and Acknowledgments0 passages
B A Basis for a Compute-Based Model of AI0 passages
C Solving The Model0 passages
C.1 Solution Approach: Baseline Model0 passages
C.2 Solution approach: R&D externalities add-on0 passages
D Model inputs0 passages
D.1 General economics parameters0 passages
D.2 Technological parameters0 passages
D.2.1 Hardware R&D parameters0 passages
D.2.2 Software R&D parameters0 passages
D.3 AI and compute parameters0 passages
D.3.1 Compute investment parameters0 passages
D.3.2 Compute stock parameters0 passages
D.3.3 Runtime compute parameters0 passages
D.3.4 Automation parameters0 passages
D.4 Add-ons0 passages
1 Introduction14 passages
2 The Model at a High Level16 passages
3 The AI Development Module31 passages
AI training runs7 passages
AI Inference35 passages
Gustafson19 passages
Adjustment costs5 passages
Depreciation of compute stock4 passages
Physical limits and heating bottlenecks12 passages
Law of motion for effective compute12 passages
Law of motion for the size of largest training run13 passages
4 The AI automation module: Mapping Effective Compute to Automation27 passages · 1 marked
4.1 Task Automation: The Extensive Margin

Both our model and those of Davidson and Korinek and Suh share a core assumption: AI systems trained with more compute become capable of automating increasingly complex tasks. This creates a direct link between advances in computing power and the expansion of AI’s economic impact through task automation.

We model R i ​ ( t ) R_{i}(t) according to29 passages · 1 marked
4.3 Labor Reallocation

A third key component of the automation process, is the process of reallocation of human labor from automated to yet-to-be automated tasks. Intuitively, as AI automation proceeds, the automation process can be expected to result in a significant increase in effective labor supply for automated tasks (more on this in Section 5 ). In a setting in which labor tasks are assumed to be complements in production (as we assume in GATE, see Section 5 ) a potentially significant determinant of the macroeconomic impacts of AI automation will be given by the extent to which the economy is “bottlenecked” by the non-automated tasks, in which effective labor supply can be expected to increase at a much slower rate than in automated tasks.

5 The Macroeconomics Module: Translating Automation into Economic Output6 passages
Social planner’s problem27 passages
Technology21 passages · 1 marked

We employ the labor accumulation metaphor for two reasons. Firstly for simplicity, as it is easier to analyze than keeping track of additional factors of production and variable parameters governing the substitutability of different factors of production. Secondly, to emphasize what we believe is a key distinction between AI and previous automation technologies: the ability of AI to eventually automate all labor tasks currently performed by humans, leading to AI becoming a perfect substitute for all types of human labor once full automation occurs. This approach is of course of a metaphor, as AI development depends on processes of compute accumulation that are similar in nature to standard capital accumulation. Alternative modelling strategies, for instance modelling AI development as increasing the substitutability of human and AI labor at the level of each task would produce similar predictions. is the key mechanism through which AI development affects output in GATE, as we abstract away from any effects of AI development on TFP, which is exogenously defined and kept constant over time. 23 23 23

Investment frictions19 passages
6 Model Add-ons: R&D Externalities and Uncertainty48 passages · 1 marked
6.2 Uncertainty About AI Automation

Another drawback of the baseline specification of GATE is that we have not allowed for any uncertainty affecting the mapping between AI system technical characteristics and the set of tasks that the system is able to perform. In other words, we have assumed that the social planner is omniscient about the path of AI labor automation. When this assumption is relaxed, uncertainty about the relationship between compute investment and automation capabilities can significantly alter investment decisions and economic trajectories. In such conditions, uncertainty about future automation capabilities can lead to more cautious investment decisions, thereby depressing the overall level of investment in AI.

7 Model Functionality2 passages
Model Outputs21 passages
Model functionality: Some AI development trajectories that can be explored14 passages
8 Limitations1 passage
Lack of non-AI technological progress7 passages
Failure to incorporate data production1 passage · 1 marked

The AI development module abstracts away from important non-compute inputs, particularly data availability, cost, and quality. While the compute-based framework captures many key dynamics of AI development, it omits potentially significant constraints around data collection, quantity, and curation requirements. This simplification could lead to overly optimistic automation timelines by not accounting for cases where data scarcity or quality issues become binding constraints, even with abundant compute resources—a concern that appears increasingly relevant given recent projections about the exhaustion of public training data ( Villalobos et al., 2022 ) . This concern may be especially salient for complex tasks that rely on real-world embodiment or physical experimentation, where data can be especially costly to gather. Future iterations of the model could benefit from explicitly incorporating data as a complementary input alongside compute, though this would inevitably introduce additional complexity into modeling the interplay between data requirements, collection costs, and AI automation capabilities.

Stylized labor reallocation assumptions3 passages
Omission of market structure and strategic behavior2 passages
Stylized and static labor task space6 passages · 1 marked

See Autor et al. (2003) . The distinction of between cognitive and manual tasks is likely to be particularly consequential given the (to date) slower progress of AI systems in the physical realm and the plausible different production function for “digital workers” in the physical domain. Allowing for these additional dimensions of heterogeneity across labor tasks would be attractive, but would be computationally costly and highly speculative given the absence of high quality measurements for the relative economic value of physical tasks and of the key parameters of the production technologies applicable to robotics.

Other bottlenecks4 passages
9 Concluding Remarks10 passages
References390 references
Appendix A Authorship, Credit Attribution, and Acknowledgments23 passages
Appendix B A Basis for a Compute-Based Model of AI18 passages
Appendix C Solving The Model1 passage
C.1 Solution Approach: Baseline Model18 passages
C.2 Solution approach: R&D externalities add-on4 passages
Appendix D Model inputs2 passages
D.1 General economics parameters3 passages
Explanation1 passage
105 trillion to 115 trillion (110 trillion)7 passages
200 trillion to 1 quadrillion ( 450 450 trillion)4 passages
1 1 trillion2 passages
0 to 0.3 (0)13 passages
1 to 6 ( 1.45 1.45 )26 passages
D.2 Technological parameters0 passages
D.2.1 Hardware R&D parameters3 passages
Explanation32 passages
D.2.2 Software R&D parameters3 passages
Explanation1 passage
129 passages
D.3 AI and compute parameters0 passages
D.3.1 Compute investment parameters3 passages
Explanation4 passages
3 to 5 (4)2 passages
1 to 4 (2)9 passages
D.3.2 Compute stock parameters3 passages
Explanation15 passages
D.3.3 Runtime compute parameters3 passages
Explanation7 passages
7 to 11 (9)2 passages
1 to 4 (2)2 passages
10 3 10^{3} to 10 7 10^{7} ( 10 5 10^{5} )12 passages
D.3.4 Automation parameters3 passages
Explanation19 passages · 2 marked
0.4 to 0.8 (0.55)

For example, Stewart 2021 reports that global chip revenues were around 0.4% of GWP in 2005. Under the GATE production function, using our median runtime compute requirements, this implies an automated fraction of 10%. Second, we examine the estimates of Acemoglu and Restrepo (2019) who investigated automation by relating the labor share, sectoral productivity changes and labor reallocation. Between 1987 and 2017 they found a net change in task content of production of approximately 10%. As such, we choose 10% as our median estimate for this parameter, such that runtime compute initially has some economic value. We account for around 2 × \times uncertainty in this parameter.

D.4 Add-ons3 passages
Explanation1 passage
2 to 20 (8)2 passages
1 to 20 (5)2 passages
0 to 1 (no default)2 passages
0 to 1 (no default)6 passages
Sanity checks3 passages
Parameters requiring extra caution5 passages
Instructions for reporting errors7 passages
Major funding support from0 passages

Lineage across 8 claims

Draws on · none recorded
This source
https://arxiv.org/html/2503.04941v2
in 8 claims' maps
Drawn on by · none recorded

Record

Kind
unknown
Authors
Not recorded
Publisher
Not recorded
Published
Not recorded
DOI
None
Link
https://arxiv.org/html/2503.04941v2
Archived copy
https://web.archive.org/web/20260102005326/https://arxiv.org/html/2503.04941v2
Stored text
233,953 characters, retrieved Nov 1, 2026 · 156 sections, 1122 passages
Claims extracted
Versions
One known
Copies
None recorded
Corrections
None recorded
Facts checked
Nov 1, 2026

History 3

  1. Nov 1, 2026DividedSegmenter · Divided into 1331 parts by its own structure
  2. Nov 1, 2026FactsFacts fetcher · Facts looked up
  3. Nov 1, 2026Entered the graphEntered the graph; copy stored