Many recent Markov chain Monte Carlo (MCMC) samplers leverage continuous dynamics to define a transition kernel that efficiently explores a target distribution. In tandem, a focus has been on devising scalable variants that subsample the data and use stochastic gradients in place of full-data gradients in the dynamic s…
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 “stochastic samplers”
New method corrects bias in stochastic gradient samplers.
problem Bias in stochastic gradient samplers.
method Gradient-Guided Monte Carlo with stochastic gradients.
result Corrected sampler yields nonzero acceptance probabilities.
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…
A new method speeds up sampling in diffusion models.
problem Slow sample generation in diffusion models.
method Proposed Splitting Integrators for fast stochastic sampling.
result Achieved FID score of 2.36 in 100 NFE, significantly faster than baselines.
Adjoint sampler targets infinite-dimensional function spaces for efficient sampling.
problem Limited theory and algorithms for sampling infinite-dimensional function spaces.
method Adjoint Sampler for infinite-dimensional function spaces based on stochastic maximum principle.
result FAS achieves superior performance in synthetic and real systems.
New algorithm speeds up sampling from complex distributions.
problem Efficiently sampling from non-log-concave distributions.
method Stochastic Proximal Samplers (SPS) based on SGLD and MALA.
result SPS-SGLD and SPS-MALA achieve faster sampling with reduced gradient complexity.
We convert deterministic flow models to stochastic samplers.
problem Deterministic flow models are sensitive to errors and cannot condition on intermediate states.
method Transform ODEs into SDEs with the same marginal distributions.
result Empirically outperforms deterministic samplers and controls generation diversity.
We introduce a novel stochastic version of the non-reversible, rejection-free Bouncy Particle Sampler (BPS), a Markov process whose sample trajectories are piecewise linear. The algorithm is based on simulating first arrival times in a doubly stochastic Poisson process using the thinning method, and allows efficient sa…
New SMC samplers improve stochastic optimisation efficiency.
problem Optimizing functions with intractable gradients in machine learning and statistics.
method Sequential Monte Carlo (SMC) samplers for stochastic optimisation.
result Significant computational gains achieved with SMC approximations.
Paper proposes a new method to speed up diffusion models.
problem High computational cost of sampling from diffusion models.
method Stochastic Runge-Kutta method for acceleration.
result Provable acceleration with reduced score function evaluations.
Improved Bayesian analysis for SVM models using a mixture sampler.
problem Efficient simulation-based analysis of stochastic volatility in mean models.
method Developed a generalized mixture sampler for SVM models, approximating non-central chi-squared distributions as mixtures of normal distributions.
result The proposed method outperforms other volatility models based on marginal likelihoods in empirical studies.
Localized sampler tackles high-dimensional sampling with fewer samples.
problem Sampling from unknown distributions with limited data.
method Combining Schrödinger bridges and plug & play Langevin samplers with localization strategy.
result Localized sampler reduces dimensionality, making sampling more efficient.
New method speeds up diffusion models without requiring complex assumptions.
problem Slow sampling in diffusion models due to high computational cost.
method Training-free acceleration scheme under minimal assumptions.
result Provable acceleration within iterations.
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
New adaptive importance samplers improve stability and accuracy.
problem Improving the stability and accuracy of importance sampling estimators.
method Introducing AdaOAIS, a new adaptive importance sampler using adaptive optimisers to address the instability of OAIS.
result AdaOAIS leads to stable importance sampling estimators in practice.
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.
Paper accelerates diffusion models, improving sampling speed.
problem Low sampling speed in score-based diffusion models.
method Design of novel training-free algorithms for deterministic and stochastic samplers.
result Accelerated samplers converge faster with improved rates.
A new method for sampling from complex distributions using Langevin samplers.
problem Sampling from unnormalized Boltzmann densities.
method Probability flow ODE derived from linear stochastic interpolants, employing Langevin samplers.
result Efficient simulation of the flow with non-asymptotic convergence rate.
ICSGLD improves efficiency in posterior sampling for big data.
problem Efficient posterior sampling for large datasets.
method Embarrassingly parallel multiple-chain CSGLD with efficient interactions.
result ICSGLD is more efficient than a single-chain CSGLD.
PDNS tackles multimodal sampling challenges using proximal point method.
problem Multimodal distributions with significant barriers between modes.
method Proximal point method on path measures, decomposing into simpler subproblems.
result PDNS effectively promotes thorough exploration across modes.
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.
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.
Stochastic gradient Markov chain Monte Carlo (SG-MCMC) has become increasingly popular for simulating posterior samples in large-scale Bayesian modeling. However, existing SG-MCMC schemes are not tailored to any specific probabilistic model, even a simple modification of the underlying dynamical system requires signifi…
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.
Ray tracing sampler improves neural network sampling efficiency and resilience.
problem Sampling neural network posterior distributions efficiently and robustly.
method Markov Chain Monte Carlo using ray tracing through likelihood space.
result Significantly higher resilience to gradient heating compared to HMC.
We propose a restricted collapsed draw (RCD) sampler, a general Markov chain Monte Carlo sampler of simultaneous draws from a hierarchical Chinese restaurant process (HCRP) with restriction. Models that require simultaneous draws from a hierarchical Dirichlet process with restriction, such as infinite Hidden markov mod…
iDEM generates samples from Boltzmann densities without data.
problem Generating statistically independent samples from unnormalized distributions.
method Iterative algorithm using energy and gradient for diffusion-based sampler training.
result iDEM achieves state-of-the-art performance and trains faster than existing methods.
We present a novel technique for learning the mass matrices in samplers obtained from discretized dynamics that preserve some energy function. Existing adaptive samplers use Riemannian preconditioning techniques, where the mass matrices are functions of the parameters being sampled. This leads to significant complexiti…
JaxSGMC simplifies SG-MCMC for Bayesian deep learning.
problem Uncertainty quantification in deep learning models.
method Modular stochastic gradient MCMC in JAX.
result Facilitates trustworthy neural network predictions.
Low-Dimensional Adaptation of Rectified Flow: A Diffusion and Stochastic Localization Perspectivestat.ML
Paper explores how Rectified Flow adapts to low-dimensional data.
problem Improving sampling efficiency in low-dimensional data.
method Investigates Rectified Flow's adaptation to low-dimensional support and introduces a stochastic version.
result Shows improved sampling efficiency with complexity.
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.
In this work, we propose a model for estimating volatility from financial time series, extending the non-Gaussian family of space-state models with exact marginal likelihood proposed by Gamerman, Santos and Franco (2013). On the literature there are models focused on estimating financial assets risk, however, most of t…
Model clusters networks and their communities simultaneously.
problem Clustering networks and their communities in unlabeled, heterogeneous networks.
method Nested Stochastic Block Model (NSBM) with Bayesian approach and NDP prior.
result Model accurately estimates both within and across network clustering structures.
A new sampling method called Restart improves both speed and quality of generative processes.
problem Balancing speed and quality in generative processes involving differential equations.
method Alternates between adding noise and following ODE, improving both speed and quality.
result Surpasses previous SDE and ODE samplers in both speed and accuracy.
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.
Although the word-popularity based negative sampler has shown superb performance in the skip-gram model, the theoretical motivation behind oversampling popular (non-observed) words as negative samples is still not well understood. In this paper, we start from an investigation of the gradient vanishing issue in the skip…
ASBS improves sampling from Boltzmann distributions without importance weighting.
problem Sampling from Boltzmann distributions with known energies but unknown samples.
method Adjoint Schrödinger Bridge Sampler using kinetic-optimal transportation.
result ASBS achieves scalable and efficient sampling without importance weighting.
The R package stochvol provides a fully Bayesian implementation of heteroskedasticity modeling within the framework of stochastic volatility. It utilizes Markov chain Monte Carlo (MCMC) samplers to conduct inference by obtaining draws from the posterior distribution of parameters and latent variables which can then be …
Recent years have witnessed amazing outcomes from "Big Models" trained by "Big Data". Most popular algorithms for model training are iterative. Due to the surging volumes of data, we can usually afford to process only a fraction of the training data in each iteration. Typically, the data are either uniformly sampled or…
New algorithm optimizes stochastic optimization with circular dependency.
problem Circular dependency between decision variable and importance sampling.
method Single-loop stochastic approximation algorithm based on Nesterov's dual averaging.
result Achieves minimal asymptotic variance and resolves circular optimization challenge.
The sampling efficiency of MCMC methods in Bayesian inference for stochastic volatility (SV) models is known to highly depend on the actual parameter values, and the effectiveness of samplers based on different parameterizations varies significantly. We derive novel algorithms for the centered and the non-centered para…
Develops diffusion samplers for target distributions with efficient score and density estimates.
problem Estimating scores and densities for time-varying distributions.
method Sequential Monte Carlo with diffusion paths and control variates.
result Effective samplers for time-varying distributions with theoretical guarantees and practical applications.
A new method for training diffusion models using likelihood matching.
problem Training efficient and accurate diffusion models.
method Likelihood Matching approach, quasi-likelihood approximation, score and Hessian estimation.
result Consistent matching of first two transitional moments between diffusion steps.
An infinite parallel tempering bouncy particle sampler improves sampling efficiency for multimodal distributions.
problem Sampling from complex posterior distributions with high accuracy and efficiency.
method Introduced an infinite parallel tempering bouncy particle sampler (BPS-PT) to accelerate convergence.
result Demonstrated improved sampling efficiency for multimodal distributions through numerical simulations.
A fast MCMC sampler for sparse Bayesian inference.
problem Sparse Bayesian inference problems with high computational cost.
method Asynchronous Gibbs sampler extended with data sub-sampling.
result The Markov chain admits an invariant distribution that recovers the main signal with high probability.
We propose a stochastic gradient Markov chain Monte Carlo (SG-MCMC) algorithm for scalable inference in mixed-membership stochastic blockmodels (MMSB). Our algorithm is based on the stochastic gradient Riemannian Langevin sampler and achieves both faster speed and higher accuracy at every iteration than the current sta…
Stochastic attention learns to retrieve and generate from memory without training.
problem Learning to retrieve and generate from memory efficiently.
method Langevin dynamics on modern Hopfield energy for stochastic attention.
result Stochastic attention can retrieve and generate from memory without training, matching gold standards.
PASOA optimizes Bayesian design by improving SMC samplers and EIG.
problem Sequential design optimization for accurate parameter inference.
method Sequential optimization using contrastive estimation, SMC samplers, and tempering.
result PASOA optimizes design and inference with improved consistency.