Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.18748 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929259172331520 |
|---|---|
| author | Wang, Shijie Shin, Minsuk Bai, Ray |
| author_facet | Wang, Shijie Shin, Minsuk Bai, Ray |
| contents | Estimating the mixing density of a latent mixture model is an important task in signal processing. Nonparametric maximum likelihood estimation is one popular approach to this problem. If the latent variable distribution is assumed to be continuous, then bootstrapping can be used to approximate it. However, traditional bootstrapping requires repeated evaluations on resampled data and is not scalable. In this letter, we construct a generative process to rapidly produce nonparametric maximum likelihood bootstrap estimates. Our method requires only a single evaluation of a novel two-stage optimization algorithm. Simulations and real data analyses demonstrate that our procedure accurately estimates the mixing density with little computational cost even when there are a hundred thousand observations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_18748 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fast Bootstrapping Nonparametric Maximum Likelihood for Latent Mixture Models Wang, Shijie Shin, Minsuk Bai, Ray Methodology Estimating the mixing density of a latent mixture model is an important task in signal processing. Nonparametric maximum likelihood estimation is one popular approach to this problem. If the latent variable distribution is assumed to be continuous, then bootstrapping can be used to approximate it. However, traditional bootstrapping requires repeated evaluations on resampled data and is not scalable. In this letter, we construct a generative process to rapidly produce nonparametric maximum likelihood bootstrap estimates. Our method requires only a single evaluation of a novel two-stage optimization algorithm. Simulations and real data analyses demonstrate that our procedure accurately estimates the mixing density with little computational cost even when there are a hundred thousand observations. |
| title | Fast Bootstrapping Nonparametric Maximum Likelihood for Latent Mixture Models |
| topic | Methodology |
| url | https://arxiv.org/abs/2402.18748 |