- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes -Fair Individual Solvent Premium (-FISP), a framework for insurance pricing that balances two competing notions of fairness:
- Actuarial fairness: Premiums reflect individuals' expected insurance losses.
- Solidarity fairness: Individuals with the same non-sensitive characteristics pay identical premiums, regardless of their sensitive attributes.
The authors introduce a fairness parameter to control the trade-off. They formulate premium determination as a constrained optimization problem that minimizes prediction error while enforcing fairness and solvency requirements. The paper establishes existence and uniqueness of the optimal premiums, generalization guarantees and boundedness.
Critical strengths
This paper provides an interpretable fairness trade-off and a mathematically tractable formulation.
Critical weaknesses
There is gap between the theory and numerical results. The finite-sample theory assumes that the empirical estimator belongs to a globally -fair hypothesis class . However, the numerical algorithm uses a neural-network implementation based on Lagrangian optimization, which enforces constraints approximately. Furthermore, the theoretical assumptions can be difficult to establish for practical neural-network models, which limit the scope of contributions.
Questions for authors
See weaknesses.
2 comments
I appreciate the authors’ response, which partially addresses my concerns. However, I believe my original score remains appropriate and have therefore decided to maintain it.
Response to Reviewer xEPR
We thank the reviewer for the constructive feedback. We carefully address the concerns and questions raised as follows:
Thank you for highlighting this distinction. The finite-sample results characterize a specified constrained estimator, rather than establish convergence or global feasibility of an arbitrary neural-network optimizer. Theorem 4.2 assumes empirical risk minimization within the globally fair class Hα, with calibrated relaxation of the empirical solvency constraints. The Lagrangian implementation approximates this problem, and its reported test-time violation rates assess practical compliance rather than certify the exact guarantees of Corollary 4.4 . We will state this distinction explicitly alongside both the theoretical results and the implementation description.
Nevertheless, the assumptions are not inherently incompatible with neural-network models. Remark C.1 identifies bounded ReLU-network classes satisfying the required hypothesis-class covering-number condition when architecture, parameter magnitudes, and the input domain are controlled. Thus, this component of the analysis applies to concrete neural-network classes, not only abstract function spaces. However, accurate plug-in estimation and inclusion of the population optimizer in the hypothesis class are additional substantive assumptions; we do not claim that using a neural network automatically establishes them.
The contribution should therefore be understood at three distinct levels: the population results characterize the constrained pricing problem independently of a neural-network parameterization; the finite-sample analysis identifies sufficient conditions for statistical guarantees; and the experiments investigate an approximate numerical implementation. In particular, existence, boundedness, and risk-order preservation do not depend on the stronger finite-sample assumptions. We will make these scopes explicit and describe the experiments as illustrating the framework’s behavior, rather than verifying that every assumption of the finite-sample theory holds for the trained networks.
We have added a remark following Corollary 4.4 (in red) showing that global α-fairness can be enforced by a simple neural-network output transformation. This demonstrates that the globally fair hypothesis class is constructively implementable, rather than requiring exhaustive verification over the input space. We explicitly distinguish this alternative parameterization from the approximate Lagrangian implementation used in the experiments and clarify that it does not, by itself, establish the remaining assumptions of the finite-sample results.