Kernel stick-breaking processes
David B. Dunson,Juhyun Park +1 more
TL;DR: A retrospective Markov chain Monte Carlo algorithm is developed for posterior computation, and the methods are illustrated using a simulated example and an epidemiological application.
read more
Abstract: We propose a class of kernel stick-breaking processes for uncountable collections of dependent random probability measures. The process is constructed by first introducing an infinite sequence of random locations. Independent random probability measures and beta-distributed random weights are assigned to each location. Predictor-dependent random probability measures are then constructed by mixing over the locations, with stick-breaking probabilities expressed as a kernel multiplied by the beta weights. Some theoretical properties of the process are described, including a covariate-dependent prediction rule. A retrospective Markov chain Monte Carlo algorithm is developed for posterior computation, and the methods are illustrated using a simulated example and an epidemiological application.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Fundamentals of Nonparametric Bayesian Inference
Subhashis Ghosal,Aad van der Vaart +1 more
- 26 Jun 2017
TL;DR: This authoritative text draws on theoretical advances of the past twenty years to synthesize all aspects of Bayesian nonparametrics, from prior construction to computation and large sample behavior of posteriors, making it valuable for both graduate students and researchers in statistics and machine learning.
703
Retrospective Markov chain Monte Carlo methods for Dirichlet process hierarchical models
TL;DR: In this paper, a Markov chain Monte Carlo (MCMCMC) algorithm is proposed to sample from the exact posterior distribution of quantities of interest, which can be used to approximate the Dirichlet process.
The Nested Dirichlet Process
TL;DR: In this article, the problem of nonparametric modeling of these distributions, borrowing information across centers while also allowing centers to be clustered is addressed, and an efficient Markov chain Monte Carlo algorithm is developed for computation.
367
Nonparametric Bayes Modeling of Multivariate Categorical Data
David B. Dunson,Chuanhua Xing +1 more
TL;DR: This article develops a nonparametric Bayes approach, which defines a prior with full support on the space of distributions for multiple unordered categorical variables, and shows this can be accomplished through a Dirichlet process mixture of product multinomial distributions, which is also a convenient form for posterior computation.
Bayesian Spatial Quantile Regression
TL;DR: A spatial quantile regression model is developed that does not assume normality and allows the covariates to affect the entire conditional distribution, rather than just the mean, and suggests that an increase in daily average temperature will lead to the largest increase in ozone in the Industrial Midwest and Northeast.
References
A Bayesian Analysis of Some Nonparametric Problems
TL;DR: In this article, a class of prior distributions, called Dirichlet process priors, is proposed for nonparametric problems, for which treatment of many non-parametric statistical problems may be carried out, yielding results that are comparable to the classical theory.
A Constructive Definition of Dirichlet Priors
Jayaram Sethuraman
- 01 May 1991
TL;DR: In this article, a class of priors known as Dirichlet measures have been used for the distribution of a random variable X when it takes values in R sub K, where K is the dimension of all probability measures on a large space.
Gibbs sampling methods for stick-breaking priors
TL;DR: Two general types of Gibbs samplers that can be used to fit posteriors of Bayesian hierarchical models based on stick-breaking priors are presented and the blocked Gibbs sampler, based on an entirely different approach that works by directly sampling values from the posterior of the random measure.
Ferguson Distributions Via Polya Urn Schemes
TL;DR: In this article, it was shown that a random probability measure P* on X has a Ferguson distribution with parameter p if for every finite partition (B1, *. *, B) of X, the vector p*(B,), * * *, p *(B) has a Dirichlet distribution with parameters (Bj), *--, cp(B,) (when p(B), = 0, this means p*) = 0 with probability 1).