Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2409.13272 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913509638406144 |
|---|---|
| author | Bianchi, Pascal Delyon, Bernard Priser, Victor Portier, François |
| author_facet | Bianchi, Pascal Delyon, Bernard Priser, Victor Portier, François |
| contents | This paper addresses the problem of approximating an unknown probability distribution with density $f$ -- which can only be evaluated up to an unknown scaling factor -- with the help of a sequential algorithm that produces at each iteration $n\geq 1$ an estimated density $q_n$.The proposed method optimizes the Kullback-Leibler divergence using a mirror descent (MD) algorithm directly on the space of density functions, while a stochastic approximation technique helps to manage between algorithm complexity and variability. One of the key innovations of this work is the theoretical guarantee that is provided for an algorithm with a fixed MD learning rate $η\in (0,1 )$. The main result is that the sequence $q_n$ converges almost surely to the target density $f$ uniformly on compact sets. Through numerical experiments, we show that fixing the learning rate $η\in (0,1 )$ significantly improves the algorithm's performance, particularly in the context of multi-modal target distributions where a small value of $η$ allows to increase the chance of finding all modes. Additionally, we propose a particle subsampling method to enhance computational efficiency and compare our method against other approaches through numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_13272 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Stochastic mirror descent for nonparametric adaptive importance sampling Bianchi, Pascal Delyon, Bernard Priser, Victor Portier, François Statistics Theory This paper addresses the problem of approximating an unknown probability distribution with density $f$ -- which can only be evaluated up to an unknown scaling factor -- with the help of a sequential algorithm that produces at each iteration $n\geq 1$ an estimated density $q_n$.The proposed method optimizes the Kullback-Leibler divergence using a mirror descent (MD) algorithm directly on the space of density functions, while a stochastic approximation technique helps to manage between algorithm complexity and variability. One of the key innovations of this work is the theoretical guarantee that is provided for an algorithm with a fixed MD learning rate $η\in (0,1 )$. The main result is that the sequence $q_n$ converges almost surely to the target density $f$ uniformly on compact sets. Through numerical experiments, we show that fixing the learning rate $η\in (0,1 )$ significantly improves the algorithm's performance, particularly in the context of multi-modal target distributions where a small value of $η$ allows to increase the chance of finding all modes. Additionally, we propose a particle subsampling method to enhance computational efficiency and compare our method against other approaches through numerical experiments. |
| title | Stochastic mirror descent for nonparametric adaptive importance sampling |
| topic | Statistics Theory |
| url | https://arxiv.org/abs/2409.13272 |