The Asymptotic Cost of Complexity
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916371176095744 |
|---|---|
| author | Cripps, Martin W |
| author_facet | Cripps, Martin W |
| contents | We propose a measure of learning efficiency for non-finite state spaces. We characterize the complexity of a learning problem by the metric entropy of its state space. We then describe how learning efficiency is determined by this measure of complexity. This is, then, applied to two models where agents learn high-dimensional states. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14949 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Asymptotic Cost of Complexity Cripps, Martin W Theoretical Economics Information Theory We propose a measure of learning efficiency for non-finite state spaces. We characterize the complexity of a learning problem by the metric entropy of its state space. We then describe how learning efficiency is determined by this measure of complexity. This is, then, applied to two models where agents learn high-dimensional states. |
| title | The Asymptotic Cost of Complexity |
| topic | Theoretical Economics Information Theory |
| url | https://arxiv.org/abs/2408.14949 |