Evidence map›Paper›PMID 39766705›Full record

ArticleEntropy (Basel, Switzerland)2024

Generative Bayesian Computation for Maximum Expected Utility.

Nick Polson, Fabrizio Ruggeri, Vadim Sokolov

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Review
  2. Generative AI for Bayesian Computation.Entropy (Basel, Switzerland) · 2025
    Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Nick PolsonBooth School of Business, University of Chicago, Chicago, IL 60637, USA.
Fabrizio RuggeriInstitute of Applied Mathematics and Information Technologies, Italian National Research Council, 20133 Milan, Italy.ORCID 0000-0002-7655-6254
Vadim SokolovVolgenau School of Engineering, George Mason University, 4400 University Drive, MSN 5D3, Fairfax, VA 22030, USA.ORCID 0000-0002-6618-2965

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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 posterior quantiles. Our approach uses a deep quantile neural estimator to directly simulate distributional utilities. Generative methods only assume the ability to simulate from the model and parameters and as such are likelihood-free. A large training dataset is generated from parameters, data and a base distribution. Then, a supervised learning problem is solved as a non-parametric regression of generative utilities on outputs and base distribution. We propose the use of deep quantile neural networks. Our method has a number of computational advantages, primarily being density-free and an efficient estimator of expected utility. A link with the dual theory of expected utility and risk taking is also described. To illustrate our methodology, we solve an optimal portfolio allocation problem with Bayesian learning and power utility (also known as the fractional Kelly criterion). Finally, we conclude with directions for future research.

Indexed as

Bayesian computationsdecision theorygenerative methodsquantile networks

Identifiers

PMID39766705
PMCPMC11675913

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.