arXiv (All)
open access
Model Complexity and Restrictiveness
We study the measure of restrictiveness proposed in Fudenberg, Gao, and Liang (2026) to evaluate complexity of economic models using synthetic data. We show that Rademacher complexity is an affine transformation of a particular case of a consistent finite-sample estimate of restrictiveness. Our resu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Reduced Complexity Model Intercomparison Project phase 3: experimental protocol for coordinated constraining and evaluation of reduced-complexity models#458464
- Irreversibility and Complexity#108327
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model#155229
- Regime Compression and Scientific Discovery: How Bounded Inquiry Turns Accumulated Constraint into New Explanatory Structure#695622
- The Fine-Tuning Objection to Superdeterminism Conflates Specificity with Complexity: How Algorithmic Probability Dissolves the Primary Argument Against Violating Statistical Independence#167420
Record · ID 1155719
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive