Tuning Sequential Monte Carlo Samplers via Greedy Incremental Divergence Minimization

• URL: http://arxiv.org/abs/2503.15704v1
• Date: Wed, 19 Mar 2025 21:35:02 GMT
• Title: Tuning Sequential Monte Carlo Samplers via Greedy Incremental Divergence Minimization
• Authors: Kyurae Kim, Zuheng Xu, Jacob R. Gardner, Trevor Campbell,
• Abstract summary: We propose a general adaptation framework for tuning the Markov kernels in SMC samplers.<n>We provide a gradient- and tuning-free algorithm that is generally applicable for kernels such as Langevin Monte Carlo (LMC)<n>Our implementations are able to obtain a full textitschedule of tuned parameters at the cost of a few vanilla SMC runs.
• Score: 21.206714676842317
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The performance of sequential Monte Carlo (SMC) samplers heavily depends on the tuning of the Markov kernels used in the path proposal. For SMC samplers with unadjusted Markov kernels, standard tuning objectives, such as the Metropolis-Hastings acceptance rate or the expected-squared jump distance, are no longer applicable. While stochastic gradient-based end-to-end optimization has been explored for tuning SMC samplers, they often incur excessive training costs, even for tuning just the kernel step sizes. In this work, we propose a general adaptation framework for tuning the Markov kernels in SMC samplers by minimizing the incremental Kullback-Leibler (KL) divergence between the proposal and target paths. For step size tuning, we provide a gradient- and tuning-free algorithm that is generally applicable for kernels such as Langevin Monte Carlo (LMC). We further demonstrate the utility of our approach by providing a tailored scheme for tuning \textit{kinetic} LMC used in SMC samplers. Our implementations are able to obtain a full \textit{schedule} of tuned parameters at the cost of a few vanilla SMC runs, which is a fraction of gradient-based approaches.

Related papers

• Preference Optimization via Contrastive Divergence: Your Reward Model is Secretly an NLL Estimator [32.05337749590184]
  We develop a novel PO framework that provides theoretical guidance to effectively sample dispreferred completions. We then select contrastive divergence (CD) as sampling strategy, and propose a novel MC-PO algorithm. OnMC-PO outperforms existing SOTA baselines, and OnMC-PO leads to further improvement.
  arXiv  Detail & Related papers  (2025-02-06T23:45:08Z)
• AutoStep: Locally adaptive involutive MCMC [51.186543293659376]
  AutoStep MCMC selects an appropriate step size at each iteration adapted to the local geometry of the target distribution. We show that AutoStep MCMC is competitive with state-of-the-art methods in terms of effective sample size per unit cost.
  arXiv  Detail & Related papers  (2024-10-24T17:17:11Z)
• Sequential Kalman Tuning of the $t$-preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems [1.3654846342364308]
  We propose an adaptive implementation of EKI and Flow Annealed Kalman Inversion. EKI is only exact in the regime of Gaussian target measures and linear forward models. We show significant improvements in the rate of convergence compared to adaptation within standard SMC.
  arXiv  Detail & Related papers  (2024-07-10T15:56:30Z)
• GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo [0.716879432974126]
  We introduce a novel framework for constructing locally adaptive Hamiltonian Monte Carlo samplers by Gibbs sampling the algorithm's tuning parameters conditionally. For adaptively sampling path lengths, this framework -- which we call Gibbs self-tuning (GIST) -- encompasses randomized HMC, multinomial HMC, the No-U-Turn Sampler (NUTS) and the Apogee-to-Apogee Path Sampler as special cases.
  arXiv  Detail & Related papers  (2024-04-23T17:39:20Z)
• Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
  Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models. We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling. We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
  arXiv  Detail & Related papers  (2022-09-27T07:58:25Z)
• Continual Repeated Annealed Flow Transport Monte Carlo [93.98285297760671]
  We propose Continual Repeated Annealed Flow Transport Monte Carlo (CRAFT) It combines a sequential Monte Carlo sampler with variational inference using normalizing flows. We show that CRAFT can achieve impressively accurate results on a lattice field example.
  arXiv  Detail & Related papers  (2022-01-31T10:58:31Z)
• Stochastic Gradient MCMC with Multi-Armed Bandit Tuning [2.2559617939136505]
  We propose a novel bandit-based algorithm that tunes SGMCMC hyperparameters to maximize the accuracy of the posterior approximation. We support our results with experiments on both simulated and real datasets, and find that this method is practical for a wide range of application areas.
  arXiv  Detail & Related papers  (2021-05-27T11:00:31Z)
• Oops I Took A Gradient: Scalable Sampling for Discrete Distributions [53.3142984019796]
  We show that this approach outperforms generic samplers in a number of difficult settings. We also demonstrate the use of our improved sampler for training deep energy-based models on high dimensional discrete data.
  arXiv  Detail & Related papers  (2021-02-08T20:08:50Z)
• Self-Tuning Stochastic Optimization with Curvature-Aware Gradient Filtering [53.523517926927894]
  We explore the use of exact per-sample Hessian-vector products and gradients to construct self-tuning quadratics. We prove that our model-based procedure converges in noisy gradient setting. This is an interesting step for constructing self-tuning quadratics.
  arXiv  Detail & Related papers  (2020-11-09T22:07:30Z)
• 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)
• Improving Sampling Accuracy of Stochastic Gradient MCMC Methods via Non-uniform Subsampling of Gradients [54.90670513852325]
  We propose a non-uniform subsampling scheme to improve the sampling accuracy. EWSG is designed so that a non-uniform gradient-MCMC method mimics the statistical behavior of a batch-gradient-MCMC method. In our practical implementation of EWSG, the non-uniform subsampling is performed efficiently via a Metropolis-Hastings chain on the data index.
  arXiv  Detail & Related papers  (2020-02-20T18:56:18Z)

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.