Supervising the Chain Ladder
The chain ladder's volume-weighted pattern minimises an explicit loss function, yet is rarely booked as such. Practitioners adjust the pattern and record the final adjusted ratios. This paper treats the chain ladder's pattern selection as a supervised-learning problem. Judgement on pattern adjustments becomes a framework of defined penalties and hyperparameters on the chain ladder's loss function, treated here as an objective function in machine learning. Data weights are generalised with a decay and a power parameter for recency and volume weighting. Benchmark shaping and smoothness enter through a reference penalty and Whittaker-Henderson smoothing. The assembled objective is strictly convex and minimised by a single linear system. Each hyperparameter becomes an interpretable adjustment in its own right, declarable by judgement and categorised as an experience or a prospective adjustment. Experience adjustments can be set more objectively by a proposed training loop and a reserve validation score on held-out calendar diagonals. Further hyperparameter-based adjustments are written as almost-everywhere differentiable penalties that re-time or reshape the pattern. A worked example carries one real Schedule P triangle through an incurred and then a paid training stage, demonstrating the workflow.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Mack's estimator motivated by large exposure asymptotics in a compound Poisson setting
The distribution-free chain ladder of Mack justified the use of the chain ladder predictor and enabled Mack to derive an estimator of conditional mean squared error of prediction for the chain ladder predictor. Classical…
PredictionClaim Reserving via Inverse Probability Weighting: A Micro-Level Chain-Ladder Method
Claim reserving primarily relies on macro-level models, with the Chain-Ladder method being the most widely adopted. These methods were heuristically developed without minimal statistical foundations, relying on oversimpl…
From Chain-Ladder to Individual Claims Reserving
The chain-ladder (CL) method is the most widely used claims reserving technique in non-life insurance. This manuscript introduces a novel approach to computing the CL reserves based on a fundamental restructuring of the …
Ladder Up, Memory Down: Low-Cost Fine-Tuning With Side Nets
Fine-tuning large language models (LLMs) is often limited by the memory available on commodity GPUs. Parameter-efficient fine-tuning (PEFT) methods such as QLoRA reduce the number of trainable parameters, yet still incur…
parameter-efficient fine-tuningNatural Language UnderstandingLadderNet: Multi-path networks based on U-Net for medical image segmentation
U-Net has been providing state-of-the-art performance in many medical image segmentation problems. Many modifications have been proposed for U-Net, such as attention U-Net, recurrent residual convolutional U-Net (R2-UNet…
DecoderImage SegmentationMedical Image SegmentationRetinal Vessel Segmentation+2