监督链梯法
Supervising the Chain Ladder
浏览论文内容
中文总结 AI 辅助
本文将链梯法的模式选择建模为监督学习问题，通过定义惩罚和超参数的目标函数，实现可解释的调整，并用真实数据验证了工作流程。
中文摘要 AI 辅助
链梯法的量加权模式最小化了一个明确的损失函数，但很少被如此记录。从业者调整模式并记录最终调整后的比率。本文将链梯法的模式选择视为一个监督学习问题。对模式调整的判断成为一个在链梯法损失函数上定义惩罚和超参数的框架，此处将其视为机器学习中的目标函数。数据权重通过衰减和幂参数进行泛化，以处理近期性和量加权。基准形状和平滑性通过参考惩罚和Whittaker-Henderson平滑引入。组装后的目标函数是严格凸的，并由单个线性系统最小化。每个超参数本身成为一个可解释的调整，可由判断声明，并归类为经验调整或前瞻调整。经验调整可以通过所提出的训练循环和在留出的日历对角线上计算的准备金验证分数更客观地设定。进一步的基于超参数的调整被写为几乎处处可微的惩罚，以重新定时或重塑模式。一个实例将一份真实的Schedule P三角形数据依次经历已发生和已赔付的训练阶段，展示了该工作流程。
英文摘要
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.
发表机构
- Dynamo Analytics
机构由 AI 辅助整理，请以论文原文为准。
