Signatures of Infinity: Nonergodicity and Resource Scaling in Prediction, Complexity, and Learning release_3cicfswlijdyjjwf4txyk76u6a

by James P. Crutchfield, Sarah Marzen

Released as a article .

2015  

Abstract

We introduce a simple analysis of the structural complexity of infinite-memory processes built from random samples of stationary, ergodic finite-memory component processes. Such processes are familiar from the well known multi-arm Bandit problem. We contrast our analysis with computation-theoretic and statistical inference approaches to understanding their complexity. The result is an alternative view of the relationship between predictability, complexity, and learning that highlights the distinct ways in which informational and correlational divergences arise in complex ergodic and nonergodic processes. We draw out consequences for the resource divergences that delineate the structural hierarchy of ergodic processes and for processes that are themselves hierarchical.
In text/plain format

Archived Files and Locations

application/pdf  355.6 kB
file_7oeghi3tonaoxgl667ma5cllhe
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-04-01
Version   v1
Language   en ?
arXiv  1504.00386v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6471cb3b-9ee4-4958-ba4e-c36dcdfec0b2
API URL: JSON