Learning the ergodic decomposition
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes
We propose methods to estimate the individual $\beta$-mixing coefficients of a real-valued geometrically ergodic Markov process from a single sample-path $X_0,X_1, \dots,X_n$. Under standard smoothness conditions on the …
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs
This paper establishes that optimistic algorithms attain gap-dependent and non-asymptotic logarithmic regret for episodic MDPs. In contrast to prior work, our bounds do not suffer a dependence on diameter-like quantities…
Long-term decomposition of robust pricing kernels under G-expectation
This study develops a BSDE method for the long-term decomposition of pricing kernels under the G-expectation framework. We establish the existence, uniqueness, and regularity of solutions to three types of quadratic G-BS…
Ergodic characterization of non-ergodic anomalous diffusion processes
Canonical characterization techniques that rely upon mean squared displacement ($\mathrm{MSD}$) break down for non-ergodic processes, making it challenging to characterize anomalous diffusion from an individual time-seri…
Time SeriesTime Series AnalysisA note on concentration inequalities for the overlapped batch mean variance estimators for Markov chains
In this paper, we study the concentration properties of quadratic forms associated with Markov chains using the martingale decomposition method introduced by Atchad\'e and Cattaneo (2014). In particular, we derive concen…