Semi-parametric Bayesian change-point model based on the Dirichlet process

Gianluca Mastrantonio

Home/Archive/arXiv

arXiv · 1805.06478

Semi-parametric Bayesian change-point model based on the Dirichlet process

Gianluca Mastrantonio

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work we introduce a semi-parametric Bayesian change-point model, defining its time dynamic as a latent Markov process based on the Dirichlet process. We treat the number of change point as a random variable and we estimate it during model fitting. Posterior inference is carried out using a Markov chain Monte Carlo algorithm based on a marginalized version of the proposed model. The model is illustrated using simulated examples and two real datasets, namely the coal- mining disasters, that is a widely used dataset for illustrative purpose, and a dataset of indoor radon recordings. With the simulated examples we show that the model is able to recover the parameters and number of change points, and we compare our results with the ones of the-state- of-the-art models, showing a clear improvement in terms of change points identification. The results obtained on the coal-mining disasters and radon data are coherent with previous literature.

Explore related subjects

stat.CO

Keep this discovery

BibTeX RIS

Gianluca Mastrantonio. 2018-05-16. Semi-parametric Bayesian change-point model based on the Dirichlet process. https://arxiv.org/abs/1805.06478

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Extended One-Liners for the Gamma, Poisson, and Binomial Distributions

We demonstrate explicit transformations of three independent uniforms with exact Gamma$(a,1)$, $a>0$, Poisson$(\lambda)$, $\lambda>0$, and Binomial$(N,p)$, $N\geq 1$, $0\leq p \leq 1$ laws using only elementary operations.

stat.CO↗

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗

arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗