Generative Bayesian Computation for Maximum Expected Utility

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Polson, Nick, Ruggeri, Fabrizio, Sokolov, Vadim
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910581282308096
author Polson, Nick
Ruggeri, Fabrizio
Sokolov, Vadim
author_facet Polson, Nick
Ruggeri, Fabrizio
Sokolov, Vadim
contents Generative Bayesian Computation (GBC) methods are developed to provide an efficient computational solution for maximum expected utility (MEU). We propose a density-free generative method based on quantiles that naturally calculates expected utility as a marginal of quantiles. Our approach uses a deep quantile neural estimator to directly estimate distributional utilities. Generative methods assume only the ability to simulate from the model and parameters and as such are likelihood-free. A large training dataset is generated from parameters and output together with a base distribution. Our method a number of computational advantages primarily being density-free with an efficient estimator of expected utility. A link with the dual theory of expected utility and risk taking is also discussed. To illustrate our methodology, we solve an optimal portfolio allocation problem with Bayesian learning and a power utility (a.k.a. fractional Kelly criterion). Finally, we conclude with directions for future research.
format Preprint
id arxiv_https___arxiv_org_abs_2408_16101
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Generative Bayesian Computation for Maximum Expected Utility
Polson, Nick
Ruggeri, Fabrizio
Sokolov, Vadim
Computation
Machine Learning
Generative Bayesian Computation (GBC) methods are developed to provide an efficient computational solution for maximum expected utility (MEU). We propose a density-free generative method based on quantiles that naturally calculates expected utility as a marginal of quantiles. Our approach uses a deep quantile neural estimator to directly estimate distributional utilities. Generative methods assume only the ability to simulate from the model and parameters and as such are likelihood-free. A large training dataset is generated from parameters and output together with a base distribution. Our method a number of computational advantages primarily being density-free with an efficient estimator of expected utility. A link with the dual theory of expected utility and risk taking is also discussed. To illustrate our methodology, we solve an optimal portfolio allocation problem with Bayesian learning and a power utility (a.k.a. fractional Kelly criterion). Finally, we conclude with directions for future research.
title Generative Bayesian Computation for Maximum Expected Utility
topic Computation
Machine Learning
url https://arxiv.org/abs/2408.16101