<tt>SPLICE:</tt>a synthetic paid loss and incurred cost experience simulator
Bibliographic record
Abstract
Abstract In this paper, we first introduce a simulator of cases estimates ofincurred lossescalledSPLICE(SyntheticPaidLoss andIncurredCostExperience). In three modules, case estimates are simulated in continuous time, and a record is output for each individual claim. Revisions for the case estimates are also simulated as a sequence over the lifetime of the claim in a number of different situations. Furthermore, some dependencies in relation to case estimates of incurred losses are incorporated, particularly recognising certain properties of case estimates that are found in practice. For example, the magnitude of revisions depends on ultimate claim size, as does the distribution of the revisions over time. Some of these revisions occur in response to occurrence of claim payments, and soSPLICErequires input of simulated per-claim payment histories. The claim data can be summarised by accident and payment “periods” whose duration is an arbitrary choice (e.g. month, quarter, etc.) available to the user.SPLICEis built on an existing simulator of individual claim experience calledSynthETIC(introduced in Avanziet al. 2021b,Insurance: Mathematics and Economics,100, 296–308), which offers flexible modelling of occurrence, notification, as well as the timing and magnitude of individual partialpayments. This is in contrast with theincurred losses, which constitute the additional contribution ofSPLICE. The inclusion of incurred loss estimates provides a facility that almost no other simulators do.SPLICEis is a fully documented R package that is publicly available and open source (on CRAN).SPLICE, combined withSynthETIC, provides 11 modules (occurrence, notification, etc.), any one or more of which may be re-designed according to the user’s requirements. It comes with a default version that is loosely calibrated to resemble a specific (but anonymous) Auto Bodily Injury portfolio, as well as data generation functionality that outputs alternative data sets under a range of hypothetical scenarios differing in complexity. The general structure is suitable for most lines of business, with some reparameterisation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.015 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".