IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.27229.html

On the approximation of posterior laws in compound loss models by conditional Wasserstein GANs

Author

Listed:
  • Aleksandar Arandjelovic
  • Pavel V. Shevchenko
  • George Tzougas

Abstract

Bayesian inference in compound loss models must often be repeated across policies, market scenarios, and prior specifications. Outside conjugate cases, this may require repeated numerical integration or Markov chain Monte Carlo (MCMC). We formulate this problem as amortized posterior approximation and construct a conditional Wasserstein generative adversarial network conditioned on sufficient statistics, prior mean and coefficient of variation, and mixture weights of prior families. Notably, a single shared generator is able to approximate the posterior laws of both the Poisson intensity and the Pareto shape parameter under mixtures of Gamma, inverse-Gaussian, and lognormal priors. We assess the approximation by simulation-based calibration and by comparisons with analytical posteriors, deterministic quadrature, and extensive MCMC simulations. In an application to data on extreme natural catastrophe losses, we produce rolling one-year posterior predictive distributions, and examine the effects of heavy-tailed severity and prior-family uncertainty on aggregate tail risk.

Suggested Citation

  • Aleksandar Arandjelovic & Pavel V. Shevchenko & George Tzougas, 2026. "On the approximation of posterior laws in compound loss models by conditional Wasserstein GANs," Papers 2608.27229, arXiv.org.
  • Handle: RePEc:arx:papers:2608.27229
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.27229
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2608.27229. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.