论文检索

污染机制下后验采样的隐私保证AI 解读

In recent years, differential privacy has been adopted by tech-companies and governmental agencies as the standard for measuring privacy in algorithms. In this article, we study differential privacy in Bayesian posterior sampling settings. We begin by considering differential privacy in the most common privatisation setting in which Laplace or Gaussian noise is injected into the output. In an effort to achieve better differential privacy, we consider adopting Huber’s…

基于球极投影的马尔可夫链蒙特卡洛AI 解读

High-dimensional distributions, especially those with heavy tails, are notoriously difficult for off-the-shelf MCMC samplers: the combination of unbounded state spaces, diminishing gradient information, and local moves results in empirically observed “stickiness” and poor theoretical mixing properties—lack of geometric ergodicity. In this paper, we introduce a new class of MCMC samplers that map the original high-dimensional problem in Euclidean space onto a sphere and…

扩散驱动 Cox 过程的精确贝叶斯推断AI 解读

In this article, we present a novel methodology to perform Bayesian inference for Cox processes in which the intensity function is driven by a diffusion process.The novelty lies in the fact that no discretization error is involved, despite the non-tractability of both the likelihood function and the transition density of the diffusion.The methodology is based on an MCMC algorithm and its exactness is built on retrospective sampling techniques.The efficiency of the…

高维贝叶斯变量选择中不依赖维度的混合时间AI 解读

Abstract Yang et al. proved that the symmetric random walk Metropolis–Hastings algorithm for Bayesian variable selection is rapidly mixing under mild high-dimensional assumptions. We propose a novel Markov chain Monte Carlo (MCMC) sampler using an informed proposal scheme, which we prove achieves a much faster mixing time that is independent of the number of covariates, under the assumptions of Yang et al. To the best of our knowledge, this is the first high-dimensional…

准平稳蒙特卡洛与 Scale 算法AI 解读

Summary This paper introduces a class of Monte Carlo algorithms which are based on the simulation of a Markov process whose quasi-stationary distribution coincides with a distribution of interest. This differs fundamentally from, say, current Markov chain Monte Carlo methods which simulate a Markov chain whose stationary distribution is the target. We show how to approximate distributions of interest by carefully combining sequential Monte Carlo methods with methodology for…

伪边际随机游走Metropolis算法的效率AI 解读

We examine the behaviour of the pseudo-marginal random walk Metropolis algorithm, where evaluations of the target density for the accept/reject probability are estimated rather than computed precisely. Under relatively general conditions on the target distribution, we obtain limiting formulae for the acceptance rate and for the expected squared jump distance, as the dimension of the target approaches infinity, under the assumption that the noise in the estimate of the…

Summary It is possible to implement importance sampling, and particle filter algorithms, where the importance sampling weight is random. Such random-weight algorithms have been shown to be efficient for inference for a class of diffusion models, as they enable inference without any (time discretization) approximation of the underlying diffusion model. One difficulty of implementing such random-weight algorithms is the requirement to have weights that are positive with…

基于时间变换的随机波动率模型推断AI 解读

We address the problem of parameter estimation for diffusion driven stochastic volatility models through Markov chain Monte Carlo (MCMC). To avoid degeneracy issues we introduce an innovative reparametrization defined through transformations that operate on the time scale of the diffusion. A novel MCMC scheme which overcomes the inherent difficulties of time change transformations is also presented. The algorithm is fast to implement and applies to models with stochastic…

部分观测扩散过程的粒子滤波AI 解读

Summary We introduce a novel particle filter scheme for a class of partially observed multivariate diffusions. We consider a variety of observation schemes, including diffusion observed with error, observation of a subset of the components of the multivariate diffusion and arrival times of a Poisson process whose intensity is a known function of the diffusion (Cox process). Unlike currently available methods, our particle filters do not require approximations of the…

部分观测扩散模型的贝叶斯模型选择AI 解读

We present an approach to Bayesian model selection for finitely observed diffusion processes. We use data augmentation by treating the paths between observed points as missing data. For a fixed model formulation, the strong dependence between the missing paths and the volatility of the diffusion can be broken down by adopting the method of Roberts & Stramer (2001). We describe how this method may be extended to the case of model selection via reversible jump Markov chain…

离散观测扩散过程的精确且计算高效的似然估计（含讨论）AI 解读

Summary The objective of the paper is to present a novel methodology for likelihood-based inference for discretely observed diffusions. We propose Monte Carlo methods, which build on recent advances on the exact simulation of diffusions, for performing maximum likelihood and Bayesian estimation.

非高斯 Ornstein–Uhlenbeck 随机波动过程的贝叶斯推断AI 解读

Summary We develop Markov chain Monte Carlo methodology for Bayesian inference for non-Gaussian Ornstein–Uhlenbeck stochastic volatility processes. The approach introduced involves expressing the unobserved stochastic volatility process in terms of a suitable marked Poisson process. We introduce two specific classes of Metropolis–Hastings algorithms which correspond to different ways of jointly parameterizing the marked point process and the model parameters. The performance…

模糊化生成的非可分时空模型AI 解读

Summary Statistical space–time modelling has traditionally been concerned with separable covariance functions, meaning that the covariance function is a product of a purely temporal function and a purely spatial function. We draw attention to a physical dispersion model which could model phenomena such as the spread of an air pollutant. We show that this model has a non-separable covariance function. The model is well suited to a wide range of realistic problems which will…

通过再生实现自适应马尔可夫链蒙特卡洛AI 解读

Markov chain Monte Carlo (MCMC) is used for evaluating expectations of functions of interest under a target distribution π. This is done by calculating averages over the sample path of a Markov chain having π as its stationary distribution. For computational efficiency, the Markov chain should be rapidly mixing. This sometimes can be achieved only by careful design of the transition kernel of the chain, on the basis of a detailed preliminary exploratory analysis of π. An…

通过再生实现自适应马尔可夫链蒙特卡洛AI 解读

Markov chain Monte Carlo (MCMC) is used for evaluating expectations of functions of interest under a target distribution π. This is done by calculating averages over the sample path of a Markov chain having π as its stationary distribution. For computational efficiency, the Markov chain should be rapidly mixing. This sometimes can be achieved only by careful design of the transition kernel of the chain, on the basis of a detailed preliminary exploratory analysis of π. An…

Langevin 扩散离散近似的最优尺度选择AI 解读

Summary We consider the optimal scaling problem for proposal distributions in Hastings-Metropolis algorithms derived from Langevin diffusions. We prove an asymptotic diffusion limit theorem and show that the relative efficiency of the algorithm can be characterized by its overall acceptance rate, independently of the target distribution. The asymptotically optimal acceptance rate is 0.574. We show that, as a function of dimension n, the complexity of the algorithm is…

Gibbs 采样器的几何收敛AI 解读

SUMMARY The rate of convergence of the Gibbs sampler is discussed. The Gibbs sampler is a Monte Carlo simulation method with extensive application to computational issues in the Bayesian paradigm. Conditions for the geometric rate of convergence of the algorithm for discrete and continuous parameter spaces are derived, and an illustrative exponential family example is given.

基于扩散过程离散观测的贝叶斯因子AI 解读

We present an approach to model selection for a time series of data on a fine time scale. The underlying process generating the data is modelled as a continuous time stochastic process. The underlying continuous processes are assumed to be diffusions with time varying drift and diffusion coefficient. Several approaches to modelling the diffusion coefficient are described. To perform model selection, we propose an approximation to the Bayes factor that uses only the discrete…