Approximate group context tree
From MaRDI portal
Abstract: We study a variable length Markov chain model associated with a group of stationary processes that share the same context tree but each process has potentially different conditional probabilities. We propose a new model selection and estimation method which is computationally efficient. We develop oracle and adaptivity inequalities, as well as model selection properties, that hold under continuity of the transition probabilities and polynomial -mixing. In particular, model misspecification is allowed. These results are applied to interesting families of processes. For Markov processes, we obtain uniform rate of convergence for the estimation error of transition probabilities as well as perfect model selection results. For chains of infinite order with complete connections, we obtain explicit uniform rates of convergence on the estimation of conditional probabilities, which have an explicit dependence on the processes' continuity rates. Similar guarantees are also derived for renewal processes. Our results are shown to be applicable to discrete stochastic dynamic programming problems and to dynamic discrete choice models. We also apply our estimator to a linguistic study, based on recent work, by Galves et al (2012), of the rhythmic differences between Brazilian and European Portuguese.
Recommendations
- Context tree selection and linguistic rhythm retrieval from written texts
- Model selection for variable length Markov chains and tuning the context algorithm
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL
- Context tree selection: a unifying view
- Estimation of General Stationary Processes by Variable Length Markov Chains
Cited in
(9)- Model selection for variable length Markov chains and tuning the context algorithm
- Context tree selection and linguistic rhythm retrieval from written texts
- A stochastic model for the speech sonority
- scientific article; zbMATH DE number 1138590 (Why is no real title available?)
- Joint estimation of intersecting context tree models
- Non-regular g-measures and variable length memory chains
- Adaptive Testing for Alphas in High-Dimensional Factor Pricing Models
- Distributions of pattern statistics in sparse Markov models
- Nonparametric statistical inference for the context tree of a stationary ergodic process
This page was built for publication: Approximate group context tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q524463)
