Nonparametric Involutive Markov Chain Monte Carlo

• URL: http://arxiv.org/abs/2211.01100v1
• Date: Wed, 2 Nov 2022 13:21:52 GMT
• Title: Nonparametric Involutive Markov Chain Monte Carlo
• Authors: Carol Mak, Fabian Zaiser, Luke Ong
• Abstract summary: We show that NP-iMCMC can generalise numerous existing iMCMC algorithms to work on nonparametric models. Applying our method to the recently proposed Nonparametric HMC, an instance of (Multiple Step) NP-iMCMC, we have constructed several nonparametric extensions.
• Score: 6.445605125467574
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A challenging problem in probabilistic programming is to develop inference algorithms that work for arbitrary programs in a universal probabilistic programming language (PPL). We present the nonparametric involutive Markov chain Monte Carlo (NP-iMCMC) algorithm as a method for constructing MCMC inference algorithms for nonparametric models expressible in universal PPLs. Building on the unifying involutive MCMC framework, and by providing a general procedure for driving state movement between dimensions, we show that NP-iMCMC can generalise numerous existing iMCMC algorithms to work on nonparametric models. We prove the correctness of the NP-iMCMC sampler. Our empirical study shows that the existing strengths of several iMCMC algorithms carry over to their nonparametric extensions. Applying our method to the recently proposed Nonparametric HMC, an instance of (Multiple Step) NP-iMCMC, we have constructed several nonparametric extensions (all of which new) that exhibit significant performance improvements.

Related papers

• Online Variational Sequential Monte Carlo [49.97673761305336]
  We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference. Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
  arXiv  Detail & Related papers  (2023-12-19T21:45:38Z)
• Bayesian Decision Trees Inspired from Evolutionary Algorithms [64.80360020499555]
  We propose a replacement of the Markov Chain Monte Carlo (MCMC) with an inherently parallel algorithm, the Sequential Monte Carlo (SMC) Experiments show that SMC combined with the Evolutionary Algorithms (EA) can produce more accurate results compared to MCMC in 100 times fewer iterations.
  arXiv  Detail & Related papers  (2023-05-30T06:17:35Z)
• Knowledge Removal in Sampling-based Bayesian Inference [86.14397783398711]
  When single data deletion requests come, companies may need to delete the whole models learned with massive resources. Existing works propose methods to remove knowledge learned from data for explicitly parameterized models. In this paper, we propose the first machine unlearning algorithm for MCMC.
  arXiv  Detail & Related papers  (2022-03-24T10:03:01Z)
• A Survey for Solving Mixed Integer Programming via Machine Learning [76.04988886859871]
  This paper surveys the trend of machine learning to solve mixed integer (MIP) problems. In this paper, we first introduce the formulation and preliminaries of MIP and several traditional algorithms to solve MIP. Then, we advocate further promoting the different integration of machine learning and MIP algorithms.
  arXiv  Detail & Related papers  (2022-03-06T05:03:37Z)
• Cyclical Variational Bayes Monte Carlo for Efficient Multi-Modal Posterior Distributions Evaluation [0.0]
  Variational inference is an alternative approach to sampling methods to estimate posterior approximations. The Variational Bayesian Monte Carlo (VBMC) method is investigated with the purpose of dealing with statistical model updating problems.
  arXiv  Detail & Related papers  (2022-02-23T17:31:42Z)
• Nonparametric Hamiltonian Monte Carlo [0.0]
  This paper introduces the Non Hamiltonian Monte Carlo (NP-HMC) algorithm which generalises HMC to nonparametric models. We provide a correctness proof of NP-HMC, and empirically demonstrate significant performance improvements over existing approaches on several nonparametric examples.
  arXiv  Detail & Related papers  (2021-06-18T17:03:05Z)
• Non-convex Learning via Replica Exchange Stochastic Gradient MCMC [25.47669573608621]
  We propose an adaptive replica exchange SGMCMC (reSGMCMC) to automatically correct the bias and study the corresponding properties. Empirically, we test the algorithm through extensive experiments on various setups and obtain the results.
  arXiv  Detail & Related papers  (2020-08-12T15:02:59Z)
• Involutive MCMC: a Unifying Framework [64.46316409766764]
  We describe a wide range of MCMC algorithms in terms of iMCMC. We formulate a number of "tricks" which one can use as design principles for developing new MCMC algorithms. We demonstrate the latter with two examples where we transform known reversible MCMC algorithms into more efficient irreversible ones.
  arXiv  Detail & Related papers  (2020-06-30T10:21:42Z)
• Planning in Markov Decision Processes with Gap-Dependent Sample Complexity [48.98199700043158]
  We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process. We prove an upper bound on the number of calls to the generative models needed for MDP-GapE to identify a near-optimal action with high probability.
  arXiv  Detail & Related papers  (2020-06-10T15:05:51Z)
• MetFlow: A New Efficient Method for Bridging the Gap between Markov Chain Monte Carlo and Variational Inference [20.312106392307406]
  We propose a new computationally efficient method to combine Variational Inference (VI) with Markov Chain Monte Carlo (MCMC) This approach can be used with generic MCMC kernels, but is especially well suited to textitMetFlow, a novel family of MCMC algorithms we introduce.
  arXiv  Detail & Related papers  (2020-02-27T16:50:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.