Metraipolis › archive › dc_49fa694ceb6f
Shrinkage prior for implicit generative models — arXiv:2611.05241
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05241
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:41:12.945Z
- SHA-256 of the archived text
6ceea7e5d0aa9caa12131c5476b422ddf0a068bac1ffb67f9d4016b08d860860- Stable URL of this page
https://metraipolis.com/documento/dc_49fa694ceb6f
How to cite
Shrinkage prior for implicit generative models — arXiv:2611.05241 — arXiv (en), https://arxiv.org/abs/2611.05241 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49fa694ceb6f (Metraipolis archive dc_49fa694ceb6f, sha256 6ceea7e5d0aa9caa12131c5476b422ddf0a068bac1ffb67f9d4016b08d860860)
BibTeX
@misc{dc49fa694ceb6f,
title = {Shrinkage prior for implicit generative models — arXiv:2611.05241},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05241},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49fa694ceb6f; sha256 6ceea7e5d0aa9caa12131c5476b422ddf0a068bac1ffb67f9d4016b08d860860},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05241. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Implicit generative models based on deep neural networks have revolutionized many scientific fields, from weather research to language generation. They successfully model complex random objects arising in real-world problems. In this work, we propose a sample-efficient training mechanism for these models. Our approach leverages regularized inference with shrinkage priors and generalized Bayes. In the large $p$ (parameter dimension) and small $n$ (sample size) setting, sparsity-inducing priors have been successfully used for linear regression when $p \gg n$. However, their application to implicit generative models remains challenging due to the intractability of the likelihood function. To address this, we adapt a scoring rule posterior based on a strictly proper scoring rule, following the generalized Bayes framework. We then propose a block SGMCMC within Gibbs sampling mechanism. This enables efficient exploration of high-dimensional parameter spaces by identifying a sparse representation of neural implicit generative models. We demonstrate the performance of our proposed method through experiments on $p \gg n$ linear regression and an application of neural generative models. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Computation (stat.CO). Pagina del lavoro: https://arxiv.org/abs/2611.05241 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:29:47.339Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).