New PDMP samplers tackle variable selection in models.
problem Jointly explore model space and parameter space.
method Develop reversible jump PDMP samplers.
result New samplers mix better and are more efficient.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “PDMP samplers”
Improved PDMP samplers for multi-modal distributions using tempering.
problem Struggles of PDMP samplers with multi-modal or heavy-tailed distributions.
method Tempering PDMPs by interpolating between a tractable and posterior distribution.
result PDMP samplers can be improved to sample from multi-modal distributions.
PDMP samplers improve Bayesian PDE coefficient inference.
problem Efficient Bayesian inference in non-linear inverse problems with expensive likelihoods.
method Piecewise deterministic Markov process (PDMP) with surrogate-assisted thinning.
result PDMP samplers achieve higher accuracy and efficiency than traditional methods.
New method uses PDMPs with sub-sampling for efficient sampling from posterior distributions.
problem Efficient sampling from posterior distributions with limited data access.
method Approximate simulation of PDMPs with sub-sampling and stochastic gradient estimation.
result Stochastic-gradient PDMPs are efficient and robust compared to Langevin dynamics.
New PDMP samplers improve BNN inference with accelerated computation.
problem Inference on Bayesian Neural Networks violates independence and posterior assumptions.
method Piecewise Deterministic Markov Process (PDMP) with adaptive thinning for inhomogenous Poisson Process (IPPs) sampling.
result PDMP samplers accelerate inference in BNNs, improving accuracy and mixing performance.
Generative models using PDMPs with explicit jump rates and kernels.
problem Creating efficient generative models for complex data distributions.
method Piecewise deterministic Markov processes (PDMPs) with explicit expressions for jump rates and kernels.
result Efficient training and simulation methods for PDMP-based generative models.
Modeling Maximum drawdown Records with Piecewise Deterministic Markov Processe in Capital Marketsq-fin.RM
Modeling maximum drawdown records in capital markets using PDMP.
problem Capturing the statistical properties of maximum drawdown records in financial markets.
method Piecewise Deterministic Markov Process (PDMP) for modeling, statistical analysis of mean and variance, simulation study, parameter estimation techniques.
result Derivation of statistical results including mean and variance of maximum drawdown records.
New couplings improve understanding of molecular dynamics convergence.
problem Understanding convergence of Andersen dynamics in high dimensions.
method Presented couplings to obtain sharp convergence bounds in the Wasserstein sense.
result Sharp convergence bounds in the Wasserstein sense without global convexity.
Stochastic compliance/evasion dynamics in tax models: a piecewise deterministic Markov process approachphysics.soc-ph
New model predicts dynamic tax evasion with audits and imitation.
problem Static treatment of tax compliance and evasion in Bertotti and Modanese model.
method Piecewise Deterministic Markov Processes (PDMPs) for audits and imitation mechanisms.
result Model shows persistent fluctuations and stationary distribution, not extreme equilibrium.
Optimal timing for converting savings into annuities considering mortality risk.
problem Determining the best time to annuitize retirement savings under stochastic mortality.
method Formulated as a three-dimensional optimal stopping problem, reduced to nested one-dimensional problems, solved using PDMP structure.
result Rich structure for the optimal annuitization rule, covering various parameter specifications.
Narendra-Shapiro (NS) algorithms are bandit-type algorithms that have been introduced in the sixties (with a view to applications in Psychology or learning automata), whose convergence has been intensively studied in the stochastic algorithm literature. In this paper, we adress the following question: are the Narendra-…
Study reveals convergence properties of SGD with random learning rate.
problem Analyzing convergence of SGD with random learning rate in non-convex optimization.
method Introduced Poisson SGD with random learning rate and used stationary distribution analysis.
result Poisson SGD converges to a stationary distribution and finds global minima in non-convex optimization.
Corrected samplers reduce discretization error in discrete flow models without additional computational cost.
problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.
New samplers improve MCMC efficiency in high dimensions.
problem Efficient sampling in high-dimensional problems.
method Affine invariant ensemble samplers, including derivative-free and derivative-based HMC.
result Affine invariant ensemble HMC outperforms standard HMC in high dimensions.
New study shows Gaussian samplers struggle with heavy-tailed targets, while stable samplers excel.
problem The difficulty of sampling from heavy-tailed distributions using Gaussian versus stable oracles.
method Comparison of Gaussian and stable oracles for proximal samplers.
result Gaussian samplers have a fundamental barrier for high-accuracy guarantees in heavy-tailed sampling, while stable samplers excel.
SRO optimizes decisions against worst-case sampler induced by generative models.
problem Operational uncertainty shifts from explicit probability law to sampler induced by learned generators.
method SRO optimizes decisions against the worst-case sampler induced by perturbing the learned generator.
result Empirical worst-case objective provides high-probability upper certificate for true population objective.
The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general, and the Gibbs sampler often suffers from slow mixing. In this paper, we study the Swendsen-Wang dynamics which is a more sophisticated Mark…
Discrete diffusion samplers and bridges: Off-policy algorithms and applications in latent spacescs.LG
Discrete diffusion samplers improve sampling from unnormalised densities.
problem Sampling from discrete unnormalised densities efficiently.
method Introduce off-policy training techniques and data-to-energy Schrödinger bridge training for discrete diffusion samplers.
result Improved performance on synthetic and new benchmarks.
Unified analysis for deterministic samplers in diffusion models.
problem Challenges in analyzing deterministic samplers for diffusion models.
method Unified convergence analysis framework.
result Achieved polynomial iteration complexity for DDIM-type samplers.
This paper analyzes MaskGIT sampler and introduces a moment sampler for faster masked diffusion sampling.
problem Efficiently sampling from masked diffusion models.
method Theoretical analysis of MaskGIT sampler, introduction of moment sampler, and two innovations for improving choose-then-sample efficiency.
result The moment sampler is an asymptotically equivalent, more interpretable alternative to MaskGIT.
PTSD improves neural samplers by combining diffusion models and PT, enhancing efficiency.
problem Efficiency and correlation issues in neural samplers compared to PT.
method Sequential training of diffusion models across temperatures, combining high-temperature models for approximate lower-temperature samples.
result Significantly improved target evaluation efficiency, outperforming diffusion-based samplers.
This paper introduces a neural sampler for scalable sampling from complex distributions.
problem Efficiently sampling from high-dimensional un-normalized distributions.
method Neural implicit sampler trained with KL and Fisher divergence methods.
result The neural sampler generates large batches of samples with low computational costs.
It Takes Two to Tango: Two Parallel Samplers Improve Quality in Diffusion Models for Limited Stepscs.CV
Two parallel samplers enhance image quality in limited denoising steps.
problem Limited denoising steps in diffusion models reduce image quality.
method Two parallel samplers denoise at successive times, integrating their information.
result Two parallel samplers improve image quality compared to a single sampler.
For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of our adaptive batch-size Gibbs sampler by comparing it against the collapsed Gibb…
The Bouncy Particle Sampler is a novel rejection-free non-reversible sampler for differentiable probability distributions over continuous variables. We generalize the algorithm to piecewise differentiable distributions and apply it to generic binary distributions using a piecewise differentiable augmentation. We illust…
Neural network MCMC sampler maximizes proposal entropy for efficient sampling.
problem Inefficient sampling from complex probability distributions.
method Proposes a neural network MCMC sampler that maximizes proposal entropy.
result Significantly higher efficiency in various sampling tasks.
Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplerscs.LG
Develops new bounds for deterministic samplers in diffusion models.
problem Analyzing deterministic samplers in diffusion generative models.
method Operational interpretation of deterministic sampling; restoration and degradation steps.
result First polynomial convergence bounds for DDIM-type samplers.
Gibbs sampling, as a model learning method, is known to produce the most accurate results available in a variety of domains, and is a de facto standard in these domains. Yet, it is also well known that Gibbs random walks usually have bottlenecks, sometimes termed "local maxima", and thus samplers often return suboptima…
The paper evaluates samplers on multi-modal targets, focusing on mode separation and recovery.
problem Handling multi-modality in sampling.
method Synthetic experimental setting focusing on mode relative importance recovery.
result Illustrates the challenges and potential of samplers in multi-modality.
We present a new data-driven benchmark system to evaluate the performance of new MCMC samplers. Taking inspiration from the COCO benchmark in optimization, we view this task as having critical importance to machine learning and statistics given the rate at which new samplers are proposed. The common hand-crafted exampl…
With the rapidly growing scales of statistical problems, subset based communication-free parallel MCMC methods are a promising future for large scale Bayesian analysis. In this article, we propose a new Weierstrass sampler for parallel MCMC based on independent subsets. The new sampler approximates the full data poster…
Unified framework extends adjoint Schrödinger bridge sampler to discrete spaces.
problem Challenges in learning discrete neural samplers due to gradients and combinatorial complexity.
method Introduces discrete ASBS, a unified framework that extends adjoint Schrödinger bridge sampler to discrete spaces.
result Empirically, discrete ASBS achieves competitive sample quality with significant advantages in training efficiency and scalability.
Single-step samplers generate high-quality samples efficiently.
problem Sampling from unnormalized distributions is computationally expensive.
method Developed consistent diffusion samplers that generate samples in a single step.
result Single-step samplers produce high-fidelity samples with less than 1% of traditional samplers' evaluations.
BNEM improves Boltzmann sampler efficiency.
problem Generating IID samples from Boltzmann distributions efficiently.
method Bootstrapped Noised Energy Matching (NEM) combined with diffusion-based learning and bootstrapping.
result BNEM achieves state-of-the-art performance with improved robustness.
LSD distills high-quality samplers for DDMs with fewer steps.
problem Inefficient sampling in DDMs leads to low quality and high computational cost.
method LSD employs a distillation approach to train fast samplers with learnable coefficients and time schedules.
result LSD+ achieves higher sampling quality with fewer steps compared to existing samplers.
New sampler reduces MCMC complexity for Bayesian variable selection.
problem High-dimensional Bayesian variable selection with high computation complexity.
method Variable-complexity subset weighted-Tempered Gibbs Sampler (wTGS) with Rao-Blackwellized estimator.
result Variances of Rao-Blackwellized estimator are smaller than those of subset wTGS.
Generative Neural Samplers for the Quantum Heisenberg Chaincond-mat.stat-mech
Generative neural samplers estimate quantum spin system properties.
problem Estimating observables for quantum spin systems.
method Autoregressive models using Suzuki-Trotter transformation.
result Results for energy, specific heat, and susceptibility are in good agreement with Monte Carlo methods.
Latent Dirichlet Allocation (LDA) is a topic model widely used in natural language processing and machine learning. Most approaches to training the model rely on iterative algorithms, which makes it difficult to run LDA on big corpora that are best analyzed in parallel and distributed computational environments. Indeed…
New sampler tackles complex discrete energy landscapes efficiently.
problem Stagnation in gradient-based discrete samplers for non-convex settings.
method DREXEL sampler with Replica Exchange and Adjusted Metropolis.
result Proves samplers satisfy detailed balance and converge to target distribution.
We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improv…
Improved Gibbs sampler speeds up Bayesian exponential smoothing model.
problem Computational inefficiency of original NUTS sampler.
method Modifications to the original model and a bespoke Gibbs sampler.
result Significant improvement in sampling time by an order of magnitude.
Bad models can teach well by replicating noise.
problem Overparameterized models can replicate noise in training data.
method Knowledge distillation from noisy samplers.
result Distillation from samplers approximates Bayes optimal classifier.
Adaptive importance samplers are adaptive Monte Carlo algorithms to estimate expectations with respect to some target distribution which \textit{adapt} themselves to obtain better estimators over a sequence of iterations. Although it is straightforward to show that they have the same convergen…
The pairwise influence matrix of Dobrushin has long been used as an analytical tool to bound the rate of convergence of Gibbs sampling. In this work, we use Dobrushin influence as the basis of a practical tool to certify and efficiently improve the quality of a discrete Gibbs sampler. Our Dobrushin-optimized Gibbs samp…
This work analyzes Gibbs samplers for Bayesian hierarchical models without dimensionality constraints.
problem Analyzing convergence properties of Gibbs samplers for Bayesian hierarchical models.
method Using Bayesian asymptotics and total variation mixing times, the study provides dimension-free convergence results.
result Dimension-free convergence results for Gibbs samplers targeting hierarchical models under random data-generating assumptions.
Riemannian Proximal Sampler improves sampling on manifold data.
problem Sampling from densities on Riemannian manifolds.
method Uses MBI and RHK oracles for high-accuracy sampling.
result Sampling with ε-accuracy requires O(log(1/ε)) iterations in KL divergence.
Stein Neural Samplerstat.ML
We propose two novel samplers to generate high-quality samples from a given (un-normalized) probability density. Motivated by the success of generative adversarial networks, we construct our samplers using deep neural networks that transform a reference distribution to the target distribution. Training schemes are deve…
New method tunes SMC samplers efficiently without high costs.
problem Tuning SMC samplers with unadjusted kernels is challenging.
method Greedy Incremental Divergence Minimization (GIDM) for step size tuning.
result GIDM reduces KL divergence and tunes SMC samplers efficiently.