A minimax near-optimal algorithm for adaptive rejection sampling

10/22/2018
by   Juliette Achdou, et al.
0

Rejection Sampling is a fundamental Monte-Carlo method. It is used to sample from distributions admitting a probability density function which can be evaluated exactly at any given point, albeit at a high computational cost. However, without proper tuning, this technique implies a high rejection rate. Several methods have been explored to cope with this problem, based on the principle of adaptively estimating the density by a simpler function, using the information of the previous samples. Most of them either rely on strong assumptions on the form of the density, or do not offer any theoretical performance guarantee. We give the first theoretical lower bound for the problem of adaptive rejection sampling and introduce a new algorithm which guarantees a near-optimal rejection rate in a minimax sense.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2019

Uncertainty about Uncertainty: Near-Optimal Adaptive Algorithms for Estimating Binary Mixtures of Unknown Coins

Given a mixture between two populations of coins, "positive" coins that ...
research
08/14/2018

Adaptive Sampling for Convex Regression

In this paper, we introduce the first principled adaptive-sampling proce...
research
02/05/2020

Near-Optimal Algorithms for Minimax Optimization

This paper resolves a longstanding open question pertaining to the desig...
research
05/22/2022

Near-Optimal Algorithms for Autonomous Exploration and Multi-Goal Stochastic Shortest Path

We revisit the incremental autonomous exploration problem proposed by Li...
research
04/07/2021

Near-optimal estimation of the unseen under regularly varying tail populations

Given n samples from a population of individuals belonging to different ...
research
05/25/2023

When can Regression-Adjusted Control Variates Help? Rare Events, Sobolev Embedding and Minimax Optimality

This paper studies the use of a machine learning-based estimator as a co...
research
02/06/2022

An Asymptotically Optimal Two-Part Coding Scheme for Networked Control under Fixed-Rate Constraints

It is known that fixed rate adaptive quantizers can be used to stabilize...

Please sign up or login with your details

Forgot password? Click here to reset