论文检索

期望的光滑函数之无偏蒙特卡洛估计：迈向自动化方法AI 解读

Abstract Given a smooth function $ f $, we develop a general approach to turn Monte Carlo samples with expectation $ m $ into an unbiased estimate of $ f(m) $. Specifically, we develop estimators that are based on randomly truncating the Taylor series expansion of $ f $ and estimating the coefficients of the truncated series. We derive their properties and propose a strategy to set their tuning parameters (which depend on $ m $) automatically, with a view to making the whole…

关于后向平滑算法AI 解读

In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step, which by default, has a O(N2) complexity (where N is the number of particles). Existing improvements in the literature are unsatisfactory: a popular rejection sampling-based approach, as we shall show, might lead to badly behaved execution time; another rejection sampler with stopping lacks complexity analysis; yet another MCMC-inspired algorithm comes with no…

无浪费序贯蒙特卡洛AI 解读

Abstract A standard way to move particles in a sequential Monte Carlo (SMC) sampler is to apply several steps of a Markov chain Monte Carlo (MCMC) kernel. Unfortunately, it is not clear how many steps need to be performed for optimal performance. In addition, the output of the intermediate steps are discarded and thus wasted somehow. We propose a new, waste-free SMC algorithm which uses the outputs of all these intermediate MCMC steps as particles. We establish that its…

重抽样方法的负相依性、排序与收敛AI 解读

We study convergence and convergence rates for resampling schemes. Our first main result is a general consistency theorem based on the notion of negative association, which is applied to establish the almost sure weak convergence of measures output from Kitagawa’s [J. Comput. Graph. Statist. 5 (1996) 1–25] stratified resampling method. Carpenter, Ckiffird and Fearnhead’s [IEE Proc. Radar Sonar Navig. 146 (1999) 2–7] systematic resampling method is similar in structure but…

序贯准蒙特卡洛AI 解读

Summary We derive and study sequential quasi Monte Carlo (SQMC), a class of algorithms obtained by introducing QMC point sets in particle filtering. SQMC is related to, and may be seen as an extension of, the array-RQMC algorithm of L'Ecuyer and his colleagues. The complexity of SQMC is O{Nlog(N)}, where N is the number of simulations at each iteration, and its error rate is smaller than the Monte Carlo rate OP(N−1/2). The only requirement to implement SQMC algorithms is the…

无似然推断的期望传播方法AI 解读

Many models of interest in the natural and social sciences have no closed-form likelihood function, which means that they cannot be treated using the usual techniques of statistical inference. In the case where such models can be efficiently simulated, Bayesian inference is still possible thanks to the approximate Bayesian computation (ABC) algorithm. Although many refinements have been suggested, ABC inference is still far from routine. ABC is often excruciatingly slow due…

长记忆或中间记忆高斯过程谱密度的贝叶斯非参数估计AI 解读

A stationary Gaussian process is said to be long-range dependent (resp., anti-persistent) if its spectral density $f(\lambda)$ can be written as $f(\lambda)=|\lambda|^{-2d}g(|\lambda|)$, where $0<d<1/2$ (resp., $-1/2<d<0$), and $g$ is continuous and positive. We propose a novel Bayesian nonparametric approach for the estimation of the spectral density of such processes. We prove posterior consistency for both $d$ and $g$, under appropriate conditions on the prior…

利用积分嵌套拉普拉斯近似进行潜在高斯模型的近似贝叶斯推断AI 解读

Summary Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalized) linear models, (generalized) additive models, smoothing spline models, state space models, semiparametric regression, spatial and spatiotemporal models, log-Gaussian Cox processes and geostatistical and geoadditive models. We consider approximate Bayesian inference in a popular subset of structured additive…

按出现顺序标记的隐马尔可夫模型：推断与模型选择AI 解读

Summary The system equation of a hidden Markov model is rewritten to label the components by order of appearance, and to make explicit the random behaviour of the number of components, mt. We argue that this reformulation is often a good way to achieve identifiability, as it facilitates the interpretation of the posterior density, and the estimation of the number of components that have appeared in a given sample. We develop a sequential Monte Carlo algorithm for estimating…

序贯蒙特卡洛方法的中心极限定理及其贝叶斯推断应用AI 解读

The term “sequential Monte Carlo methods” or, equivalently, “particle filters,” refers to a general class of iterative algorithms that performs Monte Carlo approximations of a given sequence of distributions of interest (πt). We establish in this paper a central limit theorem for the Monte Carlo estimates produced by these computational methods. This result holds under minimal assumptions on the distributions πt, and applies in a general framework which encompasses most of…

摘要暂缺