DOCSLIB.ORG

Slice Sampling for General Completely Random Measures

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Slice Sampling for General Completely Random Measures Slice Sampling for General Completely Random Measures Peiyuan Zhu Alexandre Bouchard-Cotˆ e´ Trevor Campbell Department of Statistics University of British Columbia Vancouver, BC V6T 1Z4 Abstract such model can select each category zero or once, the latent categories are called features [1], whereas if each Completely random measures provide a princi- category can be selected with multiplicities, the latent pled approach to creating flexible unsupervised categories are called traits [2]. models, where the number of latent features is Consider for example the problem of modelling movie infinite and the number of features that influ- ratings for a set of users. As a first rough approximation, ence the data grows with the size of the data an analyst may entertain a clustering over the movies set. Due to the infinity the latent features, poste- and hope to automatically infer movie genres. Cluster- rior inference requires either marginalization— ing in this context is limited; users may like or dislike resulting in dependence structures that prevent movies based on many overlapping factors such as genre, efficient computation via parallelization and actor and score preferences. Feature models, in contrast, conjugacy—or finite truncation, which arbi- support inference of these overlapping movie attributes. trarily limits the flexibility of the model. In this paper we present a novel Markov chain As the amount of data increases, one may hope to cap- Monte Carlo algorithm for posterior inference ture increasingly sophisticated patterns. We therefore that adaptively sets the truncation level using want the model to increase its complexity accordingly. auxiliary slice variables, enabling efficient, par- In our movie example, this means uncovering more and allelized computation without sacrificing flexi- more diverse user preference patterns and movie attributes bility. In contrast to past work that achieved this from the growing number of registered users and new on a model-by-model basis, we provide a gen- movie releases. Bayesian nonparametric methods (BNP) eral recipe that is applicable to the broad class enable unbounded model capacity by positing infinite- of completely random measure-based priors. dimensional prior distributions. These infinite dimen- The efficacy of the proposed algorithm is eval- sional priors are designed so that for any given dataset uated on several popular nonparametric mod- only a finite number of latent parameters are utilized, mak- els, demonstrating a higher effective sample ing Bayesian nonparametric inference possible in practice. size per second compared to algorithms using The present work is concerned with developing efficient marginalization as well as a higher predictive and flexible inference methods for a class of BNP priors performance compared to models employing called completely random measures (CRMs) [3], which fixed truncations. are commonly used in practice [4–7]. In particular, CRMs provide a unified approach to the construction of BNP priors over both latent features and traits [8, 9]. 1 INTRODUCTION Previous approaches to CRM posterior inference can be categorized into two main types. First, some methods In unsupervised data analysis, one aims to uncover com- analytically marginalize the infinite dimensional objects plex latent structure in data. Traditionally, this structure involved in CRMs [1, 10–14]. This has the disadvan- has been assumed to take the form of a clustering, in tage of making restrictive conjugacy assumptions and is which each data point is associated with exactly one latent moreover not amenable to parallelization. A second type category. Here we are concerned with a new generation of inference method introduced by Blei and Jordan [15] of unobserved structures such that each data point can instead uses a fixed truncation of the infinite model. How- be associated to any number of latent categories. When Proceedings of the 36th Conference on Uncertainty in Artificial Intelligence (UAI), PMLR volume 124, 2020. ever, this strategy is at odds with the motivation behind N0 := f0; 1; 2;::: g via BNP, namely, its ability to learn model capacity as part of indep the inferential procedure. Campbell et al. [16] provide a Xnk ∼ h(·; θk) n; k 2 [N] × N priori error bounds on such truncation, but it is not obvi- 1 ! indep X ous how to extend these bounds to approximation errors Yn ∼ f ·; Xnkδ k n 2 [N]; on the posterior distribution. k=1 Our method is based on slice sampling, a family of where δ(·) denotes a Dirac delta measure, h is a distri- Markov chain Monte Carlo methods first used in a BNP bution on N0, and f is a distribution on the space of context by [17]. Slice samplers have advantages over observations. Note that each data point yn is influenced both marginalization and truncation techniques: they do only by those traits k for which xnk > 0, and the value not require conjugacy, enable parallelization, and target of xnk denotes the amount of influence. the exact nonparametric posterior distribution. But while To generate the infinite collection of ( k; θk) pairs, we there is a rich literature on sampling methods for BNP use a Poisson point process [24] on the product space of latent feature and trait models—e.g., the Indian buffet / traits and rates Ψ × R+ with σ-finite mean measure µ, beta-Bernoulli process [13, 18], hierarchies thereof [10], 1 normalized CRMs [12, 19], beta-negative binomial pro- f k; θkgk=1 ∼ PP(µ) µ(Ψ × R+) = 1: (1) cess [14, 20], generalized gamma process [21], gamma- Equivalently, this process can be formulated as a com- Poisson process [11], and more—these have often been pletely random measure (CRM) [3] on the space of traits developed on a model-by-model basis. 1 Ψ by placing a Dirac measure at each k with weight θk , In contrast to these past model-specific techniques, we 1 develop our sampler based on a series representation of X θkδ k ∼ CRM(µ): (2) the Levy´ process [22] underlying the CRM. In a fash- k=1 ion similar to [23] we introduce auxiliary variables that adaptively truncate the series representation; only finitely In Bayesian nonparametric modelling, the traits are typi- many latent features are updated in each Gibbs sweep. cally generated independently of the rates, i.e., The representation that we utilize factorizes the weights µ (dθ; d ) = ν (dθ) H (d ) ; of CRMs into a transformed Poisson process with inde- pendent and identically distributed marks, thereby turning where H is a probability measure on Ψ, and ν is a σ-finite the sampling problem into evaluating the mean measure measure on R+. In order to guarantee that the CRM has of a marginalized Poisson point process over a zero-set. infinitely many atoms, we require that ν satisfies The remainder of the paper is organized as follows: Sec- ν (R+) = 1; tion 2 introduces the general model that we consider, se- and in order to guarantee that each observation y is only ries representations of CRMs, and posterior inference via n influenced by finitely many traits having x 6= 0 a.s., marginalization and truncation. Section 3 discusses our k nk we require that main contributions, including model augmentation and 1 ! slice sampling. Section 4 demonstrates how the method- X Z ology can be applied to two popular latent feature models. E 1fXnk 6= 0g = (1 − h(0jθ))ν (dθ) < 1: Finally, in Section 5 we compare our method against sev- k=1 eral state-of-the-art samplers for these models on both To summarize, the model we consider in this paper is: real and synthetic datasets. 1 X θkδ k ∼ CRM (ν × H) 2 BACKGROUND k=1 indep Xnk ∼ h(·; θk) n; k 2 [N] × N 2.1 MODEL ! indep X Yn ∼ f ·; Xnkδ k n 2 [N]: (3) In the standard Bayesian nonparametric latent trait model k [16], we are given a data set of random observations 1More generally, CRMs are the sum of a deterministic mea- N sure, an atomic measure with fixed atom locations, and a Poisson (Yn)n=1 generated using an infinite collection of latent traits ( )1 , 2 Ψ with corresponding rates (θ )1 , point process-based measure as in Eq. (2). In BNP models, there k k=1 k k k=1 is typically no deterministic component, and the fixed-location θk 2 R+ := [0; 1). We assume each data point Yn, atomic component has finitely many atoms, posing no chal- n 2 [N] := f1;:::;Ng is influenced by each trait k lenge in posterior inference. Thus we focus only on the infinite in an amount corresponding to an integer count Xnk 2 Poisson point process-based component in this paper. 2.2 SEQUENTIAL REPRESENTATION be parallelized across n, making them computationally expensive with large amounts of data. While the specification of f k; θkgk as a Poisson point process is mathematically elegant, it does not lend itself Fixed truncation Another option for posterior infer- immediately to computation. For this purpose—since ence is to truncate a sequential representation of the CRM there are infinitely many atoms—we require a way of such that it generates finitely many traits, i.e., generating them one-by-one in a sequence using famil- iar finite-dimensional distributions; this is known as a K ( k;Vk; Γk)k=1 ∼ Eq. (4) sequential representation of the CRM. While there are indep many such representations (see [16] for an overview), here Xnk ∼ h(·; τ(Vk; Γk)) n; k 2 [N] × [K] we will employ the general class of series representations, K ! indep X which simulate the traits k and rates θk via Yn ∼ f ·; Xnkδ k n 2 [N]: k=1 k i.i.d. X i.i.d. Ej ∼ Exp(1) Γk = Ej Vk ∼ G Because there are only finitely many traits and rates in j=1 this model, it is not difficult to develop Gibbs sampling i.i.d.
Load more

Recommended publications
  • Markov Chain Monte Carlo 1 Importance Sampling
    CS731 Spring 2011 Advanced Artificial Intelligence Markov Chain Monte Carlo Lecturer: Xiaojin Zhu jerryzhu@cs.wisc.edu A fundamental problem in machine learning is to generate samples from a distribution: x ∼ p(x). (1) This problem has many important applications. For example, one can approximate the expectation of a function φ(x) Z µ ≡ Ep[φ(x)] = φ(x)p(x)dx (2) by the sample average over x1 ... xn ∼ p(x): n 1 X µˆ ≡ φ(x ) (3) n i i=1 This is known as the Monte Carlo method. A concrete application is in Bayesian predictive modeling where R p(x | θ)p(θ | Data)dθ. Clearly,µ ˆ is an unbiased estimator of µ. Furthermore, the variance ofµ ˆ decreases as V(φ)/n (4) R 2 where V(φ) = (φ(x) − µ) p(x)dx. Thus Monte Carlo methods depend on the sample size n, not on the dimensionality of x. 1 Often, p is only known up to a constant. That is, we assume p(x) = Z p˜(x) and we are able to evaluate p˜(x) at any point x. However, we cannot compute the normalization constant Z. For instance, in the 1 Bayesian modeling example, the posterior distribution is p(θ | Data) = Z p(θ)p(Data | θ). This makes sampling harder. All methods below work onp ˜. 1 Importance Sampling Unlike other methods discussed later, importance sampling is not a method to sample from p. Rather, it is a method to compute (3). Assume we know the unnormalizedp ˜. It turns out that we (or Matlab) only know how to directly sample from very few distributions such as uniform, Gaussian, etc.; p may not be one of them in general.
    [Show full text]
  • Sampling Methods (Gatsby ML1 2017)
    Probabilistic & Unsupervised Learning Sampling Methods Maneesh Sahani maneesh@gatsby.ucl.ac.uk Gatsby Computational Neuroscience Unit, and MSc ML/CSML, Dept Computer Science University College London Term 1, Autumn 2017 Both are often intractable. Deterministic approximations on distributions (factored variational / mean-field; BP; EP) or expectations (Bethe / Kikuchi methods) provide tractability, at the expense of a fixed approximation penalty. An alternative is to represent distributions and compute expectations using randomly generated samples. Results are consistent, often unbiased, and precision can generally be improved to an arbitrary degree by increasing the number of samples. Sampling For inference and learning we need to compute both: I Posterior distributions (on latents and/or parameters) or predictive distributions. I Expectations with respect to these distributions. Deterministic approximations on distributions (factored variational / mean-field; BP; EP) or expectations (Bethe / Kikuchi methods) provide tractability, at the expense of a fixed approximation penalty. An alternative is to represent distributions and compute expectations using randomly generated samples. Results are consistent, often unbiased, and precision can generally be improved to an arbitrary degree by increasing the number of samples. Sampling For inference and learning we need to compute both: I Posterior distributions (on latents and/or parameters) or predictive distributions. I Expectations with respect to these distributions. Both are often intractable. An alternative is to represent distributions and compute expectations using randomly generated samples. Results are consistent, often unbiased, and precision can generally be improved to an arbitrary degree by increasing the number of samples. Sampling For inference and learning we need to compute both: I Posterior distributions (on latents and/or parameters) or predictive distributions.
    [Show full text]
  • Stat 451 Lecture Notes 0512 Simulating Random Variables
    Stat 451 Lecture Notes 0512 Simulating Random Variables Ryan Martin UIC www.math.uic.edu/~rgmartin 1Based on Chapter 6 in Givens & Hoeting, Chapter 22 in Lange, and Chapter 2 in Robert & Casella 2Updated: March 7, 2016 1 / 47 Outline 1 Introduction 2 Direct sampling techniques 3 Fundamental theorem of simulation 4 Indirect sampling techniques 5 Sampling importance resampling 6 Summary 2 / 47 Motivation Simulation is a very powerful tool for statisticians. It allows us to investigate the performance of statistical methods before delving deep into difficult theoretical work. At a more practical level, integrals themselves are important for statisticians: p-values are nothing but integrals; Bayesians need to evaluate integrals to produce posterior probabilities, point estimates, and model selection criteria. Therefore, there is a need to understand simulation techniques and how they can be used for integral approximations. 3 / 47 Basic Monte Carlo Suppose we have a function '(x) and we'd like to compute Ef'(X )g = R '(x)f (x) dx, where f (x) is a density. There is no guarantee that the techniques we learn in calculus are sufficient to evaluate this integral analytically. Thankfully, the law of large numbers (LLN) is here to help: If X1; X2;::: are iid samples from f (x), then 1 Pn R n i=1 '(Xi ) ! '(x)f (x) dx with prob 1. Suggests that a generic approximation of the integral be obtained by sampling lots of Xi 's from f (x) and replacing integration with averaging. This is the heart of the Monte Carlo method. 4 / 47 What follows? Here we focus mostly on simulation techniques.
    [Show full text]
  • A Minimax Near-Optimal Algorithm for Adaptive Rejection Sampling
    A minimax near-optimal algorithm for adaptive rejection sampling Juliette Achdou juliette.achdou@gmail.com Numberly (1000mercis Group) Paris, France Joseph C. Lam joseph.lam@ovgu.de Otto-von-Guericke University Magdeburg, Germany Alexandra Carpentier alexandra.carpentier@ovgu.de Otto-von-Guericke University Magdeburg, Germany Gilles Blanchard gilles.blanchard@math.uni-potsdam.de Potsdam University Potsdam, Germany Abstract Rejection Sampling is a fundamental Monte-Carlo method. It is used to sample from distributions admitting a probability density function which can be evaluated exactly at any given point, albeit at a high computational cost. However, without proper tuning, this technique implies a high rejection rate. Several methods have been explored to cope with this problem, based on the principle of adaptively estimating the density by a simpler function, using the information of the previous samples. Most of them either rely on strong assumptions on the form of the density, or do not offer any theoretical performance guarantee. We give the first theoretical lower bound for the problem of adaptive rejection sampling and introduce a new algorithm which guarantees a near-optimal rejection rate in a minimax sense. Keywords: Adaptive rejection sampling, Minimax rates, Monte-Carlo, Active learning. 1. Introduction The breadth of applications requiring independent sampling from a probability distribution is sizable. Numerous classical statistical results, and in particular those involved in ma- arXiv:1810.09390v1 [stat.ML] 22 Oct 2018 chine learning, rely on the independence assumption. For some densities, direct sampling may not be tractable, and the evaluation of the density at a given point may be costly. Rejection sampling (RS) is a well-known Monte-Carlo method for sampling from a density d f on R when direct sampling is not tractable (see Von Neumann, 1951, Devroye, 1986).
    [Show full text]
  • On the Generalized Ratio of Uniforms As a Combination of Transformed Rejection and Extended Inverse of Density Sampling
    1 On the Generalized Ratio of Uniforms as a Combination of Transformed Rejection and Extended Inverse of Density Sampling Luca Martinoy, David Luengoz, Joaqu´ın M´ıguezy yDepartment of Signal Theory and Communications, Universidad Carlos III de Madrid. Avenida de la Universidad 30, 28911 Leganes,´ Madrid, Spain. zDepartment of Circuits and Systems Engineering, Universidad Politecnica´ de Madrid. Carretera de Valencia Km. 7, 28031 Madrid, Spain. E-mail: luca@tsc.uc3m.es, david.luengo@upm.es, jmiguez@tsc.uc3m.es Abstract In this work we investigate the relationship among three classical sampling techniques: the inverse of density (Khintchine’s theorem), the transformed rejection (TR) and the generalized ratio of uniforms (GRoU). Given a monotonic probability density function (PDF), we show that the transformed area obtained using the generalized ratio of uniforms method can be found equivalently by applying the transformed rejection sampling approach to the inverse function of the target density. Then we provide an extension of the classical inverse of density idea, showing that it is completely equivalent to the GRoU method for monotonic densities. Although we concentrate on monotonic probability density functions (PDFs), we also discuss how the results presented here can be extended to any non-monotonic PDF that can be decomposed into a collection of intervals where it is monotonically increasing or decreasing. In this general case, we show the connections with transformations of certain random variables and the generalized inverse PDF with the GRoU technique. Finally, we also introduce a GRoU technique to arXiv:1205.0482v7 [stat.CO] 16 Jul 2013 handle unbounded target densities. Index Terms Transformed rejection sampling; inverse of density method; Khintchine’s theorem; generalized ratio of uniforms technique; vertical density representation.
    [Show full text]
  • Efficient Sampling for Gaussian Linear Regression with Arbitrary Priors
    Efficient sampling for Gaussian linear regression with arbitrary priors P. Richard Hahn ∗ Arizona State University and Jingyu He Booth School of Business, University of Chicago and Hedibert F. Lopes INSPER Institute of Education and Research May 18, 2018 Abstract This paper develops a slice sampler for Bayesian linear regression models with arbitrary priors. The new sampler has two advantages over current approaches. One, it is faster than many custom implementations that rely on auxiliary latent variables, if the number of regressors is large. Two, it can be used with any prior with a density function that can be evaluated up to a normalizing constant, making it ideal for investigating the properties of new shrinkage priors without having to develop custom sampling algorithms. The new sampler takes advantage of the special structure of the linear regression likelihood, allowing it to produce better effective sample size per second than common alternative approaches. Keywords: Bayesian computation, linear regression, shrinkage priors, slice sampling ∗The authors gratefully acknowledge the Booth School of Business for support. 1 1 Introduction This paper develops a computationally efficient posterior sampling algorithm for Bayesian linear regression models with Gaussian errors. Our new approach is motivated by the fact that existing software implementations for Bayesian linear regression do not readily handle problems with large number of observations (hundreds of thousands) and predictors (thou- sands). Moreover, existing sampling algorithms for popular shrinkage priors are bespoke Gibbs samplers based on case-specific latent variable representations. By contrast, the new algorithm does not rely on case-specific auxiliary variable representations, which allows for rapid prototyping of novel shrinkage priors outside the conditionally Gaussian framework.
    [Show full text]
  • Monte Carlo and Markov Chain Monte Carlo Methods
    MONTE CARLO AND MARKOV CHAIN MONTE CARLO METHODS History: Monte Carlo (MC) and Markov Chain Monte Carlo (MCMC) have been around for a long time. Some (very) early uses of MC ideas: • Conte de Buffon (1777) dropped a needle of length L onto a grid of parallel lines spaced d > L apart to estimate P [needle intersects a line]. • Laplace (1786) used Buffon’s needle to evaluate π. • Gosset (Student, 1908) used random sampling to determine the distribution of the sample correlation coefficient. • von Neumann, Fermi, Ulam, Metropolis (1940s) used games of chance (hence MC) to study models of atomic collisions at Los Alamos during WW II. We are concerned with the use of MC and, in particular, MCMC methods to solve estimation and detection problems. As discussed in the introduction to MC methods (handout # 4), many estimation and detection problems require evaluation of integrals. EE 527, Detection and Estimation Theory, # 4b 1 Monte Carlo Integration MC Integration is essentially numerical integration and thus may be thought of as estimation — we will discuss MC estimators that estimate integrals. Although MC integration is most useful when dealing with high-dimensional problems, the basic ideas are easiest to grasp by looking at 1-D problems first. Suppose we wish to evaluate Z G = g(x) p(x) dx Ω R where p(·) is a density, i.e. p(x) ≥ 0 for x ∈ Ω and Ω p(x) dx = 1. Any integral can be written in this form if we can transform their limits of integration to Ω = (0, 1) — then choose p(·) to be uniform(0, 1).
    [Show full text]
  • Concave Convex Adaptive Rejection Sampling
    Concave Convex Adaptive Rejection Sampling Dilan G¨or¨ur and Yee Whye Teh Gatsby Computational Neuroscience Unit, University College London {dilan,ywteh}@gatsby.ucl.ac.uk Abstract. We describe a method for generating independent samples from arbitrary density functions using adaptive rejection sampling with- out the log-concavity requirement. The method makes use of the fact that a function can be expressed as a sum of concave and convex func- tions. Using a concave convex decomposition, we bound the log-density using piecewise linear functions for and use the upper bound as the sam- pling distribution. We use the same function decomposition approach to approximate integrals which requires only a slight change in the sampling algorithm. 1 Introduction Probabilistic graphical models have become popular tools for addressing many machine learning and statistical inference problems in recent years. This has been especially accelerated by general-purpose inference toolkits like BUGS [1], VIBES [2], and infer.NET [3], which allow users of graphical models to spec- ify the models and obtain posterior inferences given evidence without worrying about the underlying inference algorithm. These toolkits rely upon approximate inference techniques that make use of the many conditional independencies in graphical models for efficient computation. By far the most popular of these toolkits, especially in the Bayesian statistics community, is BUGS. BUGS is based on Gibbs sampling, a Markov chain Monte Carlo (MCMC) sampler where one variable is sampled at a time conditioned on its Markov blanket. When the conditional distributions are of standard form, samples are easily obtained using standard algorithms [4]. When these condi- tional distributions are not of standard form (e.g.
    [Show full text]
  • Approximate Slice Sampling for Bayesian Posterior Inference
    Approximate Slice Sampling for Bayesian Posterior Inference Christopher DuBois∗ Anoop Korattikara∗ Max Welling Padhraic Smyth GraphLab, Inc. Dept. of Computer Science Informatics Institute Dept. of Computer Science UC Irvine University of Amsterdam UC Irvine Abstract features, or as is now popular in the context of deep learning, dropout. We believe deep learning is so suc- cessful because it provides the means to train arbitrar- In this paper, we advance the theory of large ily complex models on very large datasets that can be scale Bayesian posterior inference by intro- effectively regularized. ducing a new approximate slice sampler that uses only small mini-batches of data in ev- Methods for Bayesian posterior inference provide a ery iteration. While this introduces a bias principled alternative to frequentist regularization in the stationary distribution, the computa- techniques. The workhorse for approximate posterior tional savings allow us to draw more samples inference has long been MCMC, which unfortunately in a given amount of time and reduce sam- is not (yet) quite up to the task of dealing with very pling variance. We empirically verify on three large datasets. The main reason is that every iter- different models that the approximate slice ation of sampling requires O(N) calculations to de- sampling algorithm can significantly outper- cide whether a proposed parameter is accepted or not. form a traditional slice sampler if we are al- Frequentist methods based on stochastic gradients are lowed only a fixed amount of computing time orders of magnitude faster because they effectively ex- for our simulations. ploit the fact that far away from convergence, the in- formation in the data about how to improve the model is highly redundant.
    [Show full text]
  • Reparameterization Gradients Through Acceptance-Rejection Sampling Algorithms
    Reparameterization Gradients through Acceptance-Rejection Sampling Algorithms Christian A. Naessethyz Francisco J. R. Ruizzx Scott W. Lindermanz David M. Bleiz yLink¨opingUniversity zColumbia University xUniversity of Cambridge Abstract 2014] and text [Hoffman et al., 2013]. By definition, the success of variational approaches depends on our Variational inference using the reparameteri- ability to (i) formulate a flexible parametric family zation trick has enabled large-scale approx- of distributions; and (ii) optimize the parameters to imate Bayesian inference in complex pro- find the member of this family that most closely ap- babilistic models, leveraging stochastic op- proximates the true posterior. These two criteria are timization to sidestep intractable expecta- at odds|the more flexible the family, the more chal- tions. The reparameterization trick is appli- lenging the optimization problem. In this paper, we cable when we can simulate a random vari- present a novel method that enables more efficient op- able by applying a differentiable determinis- timization for a large class of variational distributions, tic function on an auxiliary random variable namely, for distributions that we can efficiently sim- whose distribution is fixed. For many dis- ulate by acceptance-rejection sampling, or rejection tributions of interest (such as the gamma or sampling for short. Dirichlet), simulation of random variables re- For complex models, the variational parameters can lies on acceptance-rejection sampling. The be optimized by stochastic gradient ascent on the evi- discontinuity introduced by the accept{reject dence lower bound (elbo), a lower bound on the step means that standard reparameterization marginal likelihood of the data. There are two pri- tricks are not applicable.
    [Show full text]
  • Two Adaptive Rejection Sampling Schemes for Probability Density Functions Log-Convex Tails
    1 Two adaptive rejection sampling schemes for probability density functions log-convex tails Luca Martino and Joaqu´ın M´ıguez Department of Signal Theory and Communications, Universidad Carlos III de Madrid. Avenida de la Universidad 30, 28911 Leganes,´ Madrid, Spain. E-mail: luca@tsc.uc3m.es, joaquin.miguez@uc3m.es Abstract Monte Carlo methods are often necessary for the implementation of optimal Bayesian estimators. A fundamental technique that can be used to generate samples from virtually any target probability distribution is the so-called rejection sampling method, which generates candidate samples from a proposal distribution and then accepts them or not by testing the ratio of the target and proposal densities. The class of adaptive rejection sampling (ARS) algorithms is particularly interesting because they can achieve high acceptance rates. However, the standard ARS method can only be used with log-concave target densities. For this reason, many generalizations have been proposed. In this work, we investigate two different adaptive schemes that can be used to draw exactly from a large family of univariate probability density functions (pdf’s), not necessarily log-concave, possibly multimodal and with tails of arbitrary concavity. These techniques are adaptive in the sense that every time a candidate sample is rejected, the acceptance rate is improved. The two proposed algorithms can work properly when the target pdf is multimodal, with first and second derivatives analytically intractable, and when the tails are log-convex in a infinite domain. Therefore, they can be applied in a number of scenarios in which the other generalizations of the standard ARS fail.
    [Show full text]
  • Random Number Generation for the Generalized Normal Distribution Using the Modified Adaptive Rejection Method
    INFORMATION ISSN 1343-4500 Volume 8, Number 6, pp. 829-836 @2005 International Information Institute Random number generation for the generalized normal distribution using the modified adaptive rejection method Hideo Hirose, Akihiro Todoroki Department of systems Innovation & Informatics Kyushu Institute of Technology Iizuka, Fukuoka 820-8502 Japan Abstract When we want to grasp the characteristics of the time series signals emitted massively from electric power apparatuses or electroencephalogram, and want to decide some diagnoses about the apparatuses or human brains, we may use some statistical distribution functions. In such cases, the generalized normal distribution is frequently used in pattern analysts. In assessing the correctness of the estimates of the shape of the distribution function accurately, we often use a Monte Carlo simulation study; thus, a fast and efficient random number generation method for the distribution function is needed. However, the method for generating the random numbers of the distribution seems not easy and not yet to have been developed. In this paper, we propose a random number generation method for the distribution function using the the rejection method. A newly developed modified adaptive rejection method works well in the case of log-convex density functions. Keywords: modified adaptive rejection method, exponential distribution, generalized normal distri­ bution, envelop function, log-convex, log-concave 1 Introduction vVhen we want to grasp the characteristics of the time series signals emitted massively from electric power apparatuses or electroencephalogram, and want to decide some diagnoses about the apparatuses or human brains, we may use some statistical distribution functions. For example, we take a distribution pattern in certain time zone by making average in the zone, and we see the differences among those zones by discriminating the distribution patterns zone by zone.
    [Show full text]