论文检索

误设隐马尔可夫模型中最大似然估计的渐近性质AI 解读

Let $(Y_{k})_{k\in\mathbb{Z}}$ be a stationary sequence on a probability space $(\Omega,\mathcal{A},\mathbb{P})$ taking values in a standard Borel space $\mathsf{Y}$. Consider the associated maximum likelihood estimator with respect to a parametrized family of hidden Markov models such that the law of the observations $(Y_{k})_{k\in\mathbb{Z}}$ is not assumed to be described by any of the hidden Markov models of this family. In this paper we investigate the consistency of…

一般隐马尔可夫模型最大似然估计量的一致性AI 解读

Consider a parametrized family of general hidden Markov models, where both the observed and unobserved components take values in a complete separable metric space. We prove that the maximum likelihood estimator (MLE) of the parameter is strongly consistent under a rather minimal set of assumptions. As special cases of our main result, we obtain consistency in a large class of nonlinear state space models, as well as general results on linear Gaussian state space models and…

长记忆估计量：傅里叶方法与小波方法的比较AI 解读

Semi-parametric estimation methods of the long-memory exponent of a time series have been studied in several papers, some applied, others theoretical, some using Fourier methods, others using a wavelet-based technique. In this paper, we compare the Fourier and wavelet approaches to the local regression method and to the local Whittle method. We provide an overview of these methods, describe what has been done and indicate the available results and the conditions under which…

潜变量模型的在线期望最大化算法AI 解读

Summary We propose a generic on-line (also sometimes called adaptive or recursive) version of the expectation–maximization (EM) algorithm applicable to latent variable models of independent observations. Compared with the algorithm of Titterington, this approach is more directly connected to the usual EM algorithm and does not rely on integration with respect to the complete-data distribution. The resulting algorithm is usually simpler and is shown to achieve convergence to…

加权样本的极限定理及其在序贯蒙特卡洛方法中的应用AI 解读

In the last decade, sequential Monte Carlo methods (SMC) emerged as a key tool in computational statistics [see, e.g., Sequential Monte Carlo Methods in Practice (2001) Springer, New York, Monte Carlo Strategies in Scientific Computing (2001) Springer, New York, Complex Stochastic Systems (2001) 109–173]. These algorithms approximate a sequence of distributions by a sequence of weighted empirical measures associated to a weighted population of particles, which are generated…

时变自回归过程的递归估计AI 解读

This paper focuses on recursive estimation of time varying autoregressive processes in a nonparametric setting. The stability of the model is revisited and uniform results are provided when the time-varying autoregressive parameters belong to appropriate smoothness classes. An adequate normalization for the correction term used in the recursive estimation procedure allows for very mild assumptions on the innovations distributions. The rate of convergence of the pointwise…

波动率长记忆的估计AI 解读

We consider semiparametric estimation of the memory parameter in a model that includes as special cases both long-memory stochastic volatility and fractionally integrated exponential GARCH (FIEGARCH) models. Under our general model the logarithms of the squared returns can be decomposed into the sum of a long-memory signal and a white noise. We consider periodogram-based estimators using a local Whittle criterion function. We allow the optional inclusion of an additional…

长程依赖时间序列的宽频带对数周期图回归AI 解读

This paper discusses the properties of an estimator of the memory parameter of a stationary long-memory time-series originally proposed by Robinson. As opposed to ‘‘narrow-band’’ estimators of the memory parameter (such as the Geweke and Porter-Hudak or the Gaussian semiparametric estimators) which use only the periodogram ordinates belonging to an interval which degenerates to zero as the sample size $n$ increases, this estimator builds a model of the spectral density of…

随机逼近版 EM 算法的收敛性AI 解读

The expectation-maximization (EM) algorithm is a powerful computational technique for locating maxima of functions. It is widely used in statistics for maximum likelihood or maximum a posteriori estimation in incomplete data models. In certain situations, however, this method is not applicable because the expectation step cannot be performed in closed form. To deal with these problems, a novel method is introduced, the stochastic approximation EM (SAEM), which replaces the…