Value Gradient Sampler: Sampling as Sequential Decision Making
We propose the Value Gradient Sampler (VGS), a trainable sampler based on the interpretation of sampling as discrete-time sequential decision-making. VGS generates samples from a given unnormalized density (i.e., energy) by drifting and diffusing randomly initialized particles. In VGS, finding the optimal drift is equivalent to solving an optimal control problem where the cost is the upper bound of the KL divergence between the target density and the samples. We employ value-based dynamic programming to solve this optimal control problem, which gives the gradient of the value function as the optimal drift vector. The connection to sequential decision making allows VGS to leverage extensively studied techniques in reinforcement learning, making VGS a fast, adaptive, and accurate sampler that achieves competitive results in various sampling benchmarks. Furthermore, VGS can replace MCMC in contrastive divergence training of energy-based models. We demonstrate the effectiveness of VGS in training accurate energy-based models in industrial anomaly detection applications.
Code (1)
Tasks
Anomaly DetectionDecision MakingSequential Decision MakingSimilar Papers 제목 키워드 기반
Efficient Stochastic Optimisation via Sequential Monte Carlo
The problem of optimising functions with intractable gradients frequently arises in machine learning and statistics, ranging from maximum marginal likelihood estimation procedures to fine-tuning of generative models. Sto…
Reinforced sequential Monte Carlo for amortised sampling
This paper proposes a synergy of amortised and particle-based methods for sampling from distributions defined by unnormalised density functions. We state a connection between sequential Monte Carlo (SMC) and neural seque…
Reinforcement LearningAutoSAM: Towards Automatic Sampling of User Behaviors for Sequential Recommender Systems
Sequential recommender systems (SRS) have gained widespread popularity in recommendation due to their ability to effectively capture dynamic user preferences. One default setting in the current SRS is to uniformly consid…
Future predictionRecommendation SystemsSequential RecommendationMeasuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming
A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and Me…
Probabilistic ProgrammingResampling Gradients Vanish in Differentiable Sequential Monte Carlo Samplers
Annealed Importance Sampling (AIS) moves particles along a Markov chain from a tractable initial distribution to an intractable target distribution. The recently proposed Differentiable AIS (DAIS) (Geffner and Domke, 202…