A Proximal Newton Adaptive Importance Sampler
V\'ictor Elvira, \'Emilie Chouzenoux, O. Deniz Akyildiz

TL;DR
This paper introduces a proximal Newton adaptive importance sampler that efficiently estimates expectations for non-smooth target distributions, broadening AIS applicability beyond differentiable cases.
Contribution
It proposes a novel proximal Newton method for adaptive importance sampling, enabling effective proposal adaptation for non-smooth targets.
Findings
Effective in convex constrained scenarios
Performs well with non-smooth sparse priors
Enhances AIS for non-differentiable distributions
Abstract
Adaptive importance sampling (AIS) algorithms are a rising methodology in signal processing, statistics, and machine learning. An effective adaptation of the proposals is key for the success of AIS. Recent works have shown that gradient information about the involved target density can greatly boost performance, but its applicability is restricted to differentiable targets. In this paper, we propose a proximal Newton adaptive importance sampler for the estimation of expectations with respect to non-smooth target distributions. We implement a scaled Newton proximal gradient method to adapt the proposal distributions, enabling efficient and optimized moves even when the target distribution lacks differentiability. We show the good performance of the algorithm in two scenarios: one with convex constraints and another with non-smooth sparse priors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · Gaussian Processes and Bayesian Inference
