Scalable Structural Estimation of Networked Infrastructure: Exact Decomposition for Localized Coordination
L. Kaili Diamond, Ben Gilbert

TL;DR
This paper introduces an exact decomposition method for scalable structural estimation in large networked systems, enabling efficient analysis of local interactions without approximation.
Contribution
It develops a block-diagonal decomposition of the Bellman operator for dynamic models with localized interactions, allowing high-dimensional problems to be solved exactly.
Findings
Structural estimates show significant spatial coordination effects.
Accounting for interactions shifts predicted replacement timing.
Ignoring interactions leads to substantial misoptimization costs.
Abstract
Interaction effects are often economically central in environments where structural dynamic estimation becomes computationally infeasible. Under fixed group membership and sparse within-group interaction structure, the Bellman operator admits a block-diagonal decomposition that allows high-dimensional dynamic programs to be solved through independent group-level subproblems while preserving the original structural problem exactly. The result applies to a class of dynamic discrete choice models in which interactions are confined within stable local groups and state transitions depend only on within-group conditions. We apply the framework to replacement decisions across 14,344 GPU node locations in the Titan supercomputer, where operating environments differ systematically across cage positions. The structural estimates reveal significant spatial coordination: both neighboring failures…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
