STPRMLJun 25, 2014

Learning the ergodic decomposition

arXiv:1406.6670v11.22 citations
Originality Synthesis-oriented
AI Analysis

This addresses the theoretical problem of Bayesian learning in ergodic theory for statisticians and machine learning researchers, but it appears incremental as it builds on established concepts like ergodic decomposition.

The paper tackles the problem of a Bayesian agent learning the structure of a stationary process from past observations, proving that the agent's predictions about the near future converge to those based on the long-run empirical frequencies of the process.

A Bayesian agent learns about the structure of a stationary process from ob- serving past outcomes. We prove that his predictions about the near future become ap- proximately those he would have made if he knew the long run empirical frequencies of the process.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes