Adaptive density estimation for stationary processes
Matthieu Lerasle (IMT)

TL;DR
This paper introduces an adaptive density estimation algorithm for stationary processes with mixing conditions, achieving optimal convergence rates similar to independent data scenarios.
Contribution
It develops a model selection procedure based on a generalized Mallows' C_p for stationary processes with mixing, providing oracle inequalities and adaptivity over Besov spaces.
Findings
Estimator achieves i.i.d. convergence rates
Oracle inequalities established for the estimator
Method applicable to β- and τ-mixing processes
Abstract
We propose an algorithm to estimate the common density of a stationary process . We suppose that the process is either or -mixing. We provide a model selection procedure based on a generalization of Mallows' and we prove oracle inequalities for the selected estimator under a few prior assumptions on the collection of models and on the mixing coefficients. We prove that our estimator is adaptive over a class of Besov spaces, namely, we prove that it achieves the same rates of convergence as in the i.i.d framework.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
