A multi-task network approach for calculating discrimination-free insurance prices

Mathias Lindholm, Ronald Richman, Andreas Tsanakas, Mario V. Wüthrich
7/6/2022
cs.LGcs.AIcs.CE

No confident code implementation found for this paper.

Abstract

In applications of predictive modeling, such as insurance pricing, indirect or proxy discrimination is an issue of major concern. Namely, there exists the possibility that protected policyholder characteristics are implicitly inferred from non-protected ones by predictive models, and are thus having an undesirable (or illegal) impact on prices. A technical solution to this problem relies on building a best-estimate model using all policyholder characteristics (including protected ones) and then averaging out the protected characteristics for calculating individual prices. However, such approaches require full knowledge of policyholders' protected characteristics, which may in itself be problematic. Here, we address this issue by using a multi-task neural network architecture for claim predictions, which can be trained using only partial information on protected characteristics, and it produces prices that are free from proxy discrimination. We demonstrate the use of the proposed model and we find that its predictive accuracy is comparable to a conventional feedforward neural network (on full information). However, this multi-task network has clearly superior performance in the case of partially missing policyholder information.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lindholm2022multitask,
  title  = {A multi-task network approach for calculating discrimination-free insurance prices},
  author = {Mathias Lindholm and Ronald Richman and Andreas Tsanakas and Mario V. Wüthrich},
  year   = {2022},
  eprint = {2207.02799},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.02799v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.02799.svg)](https://codeofpaper.com/paper/2207.02799)

Discussion