Robust risk aggregation with neural networks

Robust risk aggregation with neural networks

##### Date

2020

##### Authors

##### Editors

##### Journal ISSN

##### Electronic ISSN

##### ISBN

##### Bibliographical data

##### Publisher

##### Series

##### URI (citable link)

##### DOI (citable link)

##### International patent number

##### Link to the license

##### EU project number

##### Project

##### Open Access publication

##### Collections

##### Title in another language

##### Publication type

Journal article

##### Publication status

Published

##### Published in

Mathematical Finance ; 30 (2020), 4. - pp. 1229-1272. - Wiley. - ISSN 0960-1627. - eISSN 1467-9965

##### Abstract

We consider settings in which the distribution of a multivariate random variable is partly ambiguous. We assume the ambiguity lies on the level of the dependence structure, and that the marginal distributions are known. Furthermore, a current best guess for the distribution, called reference measure, is available. We work with the set of distributions that are both close to the given reference measure in a transportation distance (e.g., the Wasserstein distance), and additionally have the correct marginal structure. The goal is to find upper and lower bounds for integrals of interest with respect to distributions in this set. The described problem appears naturally in the context of risk aggregation. When aggregating different risks, the marginal distributions of these risks are known and the task is to quantify their joint effect on a given system. This is typically done by applying a meaningful risk measure to the sum of the individual risks. For this purpose, the stochastic interdependencies between the risks need to be specified. In practice, the models of this dependence structure are however subject to relatively high model ambiguity. The contribution of this paper is twofold: First, we derive a dual representation of the considered problem and prove that strong duality holds. Second, we propose a generally applicable and computationally feasible method, which relies on neural networks, in order to numerically solve the derived dual problem. The latter method is tested on a number of toy examples, before it is finally applied to perform robust risk aggregation in a real‐world instance.

##### Summary in another language

##### Subject (DDC)

510 Mathematics

##### Keywords

##### Conference

##### Review

undefined / . - undefined, undefined. - (undefined; undefined)

##### Cite This

## ISO 690

ECKSTEIN, Stephan, Michael KUPPER, Mathias POHL, 2020.*Robust risk aggregation with neural networks*. In: Mathematical Finance. Wiley.

**30**(4), pp. 1229-1272. ISSN 0960-1627. eISSN 1467-9965. Available under: doi: 10.1111/mafi.12280

## BibTex

@article{Eckstein2020-10Robus-50084, year={2020}, doi={10.1111/mafi.12280}, title={Robust risk aggregation with neural networks}, number={4}, volume={30}, issn={0960-1627}, journal={Mathematical Finance}, pages={1229--1272}, author={Eckstein, Stephan and Kupper, Michael and Pohl, Mathias} }

## RDF

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/50084"> <dcterms:abstract xml:lang="eng">We consider settings in which the distribution of a multivariate random variable is partly ambiguous. We assume the ambiguity lies on the level of the dependence structure, and that the marginal distributions are known. Furthermore, a current best guess for the distribution, called reference measure, is available. We work with the set of distributions that are both close to the given reference measure in a transportation distance (e.g., the Wasserstein distance), and additionally have the correct marginal structure. The goal is to find upper and lower bounds for integrals of interest with respect to distributions in this set. The described problem appears naturally in the context of risk aggregation. When aggregating different risks, the marginal distributions of these risks are known and the task is to quantify their joint effect on a given system. This is typically done by applying a meaningful risk measure to the sum of the individual risks. For this purpose, the stochastic interdependencies between the risks need to be specified. In practice, the models of this dependence structure are however subject to relatively high model ambiguity. The contribution of this paper is twofold: First, we derive a dual representation of the considered problem and prove that strong duality holds. Second, we propose a generally applicable and computationally feasible method, which relies on neural networks, in order to numerically solve the derived dual problem. The latter method is tested on a number of toy examples, before it is finally applied to perform robust risk aggregation in a real‐world instance.</dcterms:abstract> <dcterms:issued>2020-10</dcterms:issued> <dc:contributor>Pohl, Mathias</dc:contributor> <dc:creator>Pohl, Mathias</dc:creator> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-07-01T11:25:38Z</dcterms:available> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/50084/1/Eckstein_2-17wvsj60byn202.pdf"/> <dc:contributor>Eckstein, Stephan</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/50084/1/Eckstein_2-17wvsj60byn202.pdf"/> <dcterms:title>Robust risk aggregation with neural networks</dcterms:title> <dc:rights>Attribution 4.0 International</dc:rights> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/50084"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/> <dc:creator>Eckstein, Stephan</dc:creator> <dc:creator>Kupper, Michael</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dc:contributor>Kupper, Michael</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2020-07-01T11:25:38Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

##### Internal note

##### xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

##### Examination date of dissertation

##### Method of financing

##### Comment on publication

##### Alliance license

##### Corresponding Authors der Uni Konstanz vorhanden

##### International Co-Authors

##### Bibliography of Konstanz

Yes

##### Refereed

Yes