近似组上下文树
Approximate group context tree
摘要:
我们研究了一个可变长度的马尔可夫链模型与一组平稳的过程,共享相同的上下文树,但每个过程有潜在的不同的条件概率。我们提出了一种新的模型选择和估计方法,这是计算效率。我们开发的甲骨文和自适应不等式,以及模型选择属性,保持下的连续性的转移概率和多项式$β$混合。特别是,允许模型错误指定。这些结果适用于有趣的家庭的过程。对于马尔可夫过程,我们得到了转移概率估计误差的一致收敛速度和完美的模型选择结果。对于具有完全连接的无限级链,我们得到了关于条件概率估计的显式一致收敛速度,该条件概率与过程的连续速度有显式的依赖关系.对于更新过程也得到类似的保证。我们的结果是适用于离散随机动态规划问题和动态离散选择模型。我们还将我们的估计应用于语言研究,基于Galves等人(2012)最近的工作,巴西和欧洲葡萄牙语之间的节奏差异。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。