Online Program Home
  My Program

All Times EDT

Abstract Details

Activity Number: 69 - Highlights of the Canadian Journal of Statistics
Type: Invited
Date/Time: Monday, August 9, 2021 : 10:00 AM to 11:50 AM
Sponsor: SSC (Statistical Society of Canada)
Abstract #316898
Title: Random Weighting Schemes for Bayesian Computation
Author(s): Michael Newton* and Nicholas Polson and Jianeng Xu and Tun Lee Ng
Companies: University of Wisconsin, Madison and University of Chicago and University of Chicago and University of Wisconsin, Madison
Keywords: clustering; bootstrap; Dirichlet process

Bayesian computation relies on approximations, be they from Monte Carlo error, as in Markov chain Monte Carlo, or from simplified posterior structures, as in variational Bayes, for example. Optimization often plays second fiddle to integration, considering the inference role of marginal posterior distributions. But there is a class of optimization schemes that has long been known to provide for approximate posterior sampling in certain models. I will review some recent developments in the domain of randomly weighted objective functions, drawing connections to model-guided nonparametric Bayesian inference including the weighted Bayesian bootstrap and the loss-likelihood bootstrap. The use of random weighting with clustering is of interest, and if time permits I will discuss improvements to large-scale testing in genomics based upon random weighting schemes.

Based in part on a CJS paper with Nick Polson and Jianeng Xu, and also on work with my PhD student Tun Lee Ng.

Authors who are presenting talks have a * after their name.

Back to the full JSM 2021 program