MétaCan
Menu
Back to cohort
Record W2552541708

Higher-Order Feature Synthesis for Insurance Scoring Models

2009· article· en· W2552541708 on OpenAlexaboutno aff
Charles Dugas, Nicolas Chapados, Xavier Saint‐Mleux, Pascal Vincent

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEconomics, Econometrics and Finance
TopicInsurance and Financial Risk Management
Canadian institutionsnot available
Fundersnot available
KeywordsOverfittingFeature selectionProfitability indexComputer scienceSortingFeature (linguistics)Rank (graph theory)Data miningSelection (genetic algorithm)Knapsack problemRanking (information retrieval)HeuristicsOrder (exchange)Machine learningMathematicsAlgorithmEconomics
DOInot available

Abstract

fetched live from OpenAlex

In many jurisdictions, automobile insurers have access to risk-sharing pools to which they can transfer some of their worst risks. Better selection of these risks in order to maximize profitability is the application we consider in this paper. To that end, different feature selection and modeling approaches are tested and compared against the historical data of a mid-sized Canadian insurer. In particular, we introduce a flexible scoring model that estimates each risk’s loss ratio, a target that is better suited to the application considered than the usual claims level. We also devise a feature selection method that is robust to overfitting due to the use of a rank averaging technique. By analogy to the knapsack problem, we show what should be the most suitable sorting criterion depending on pool regulations. Given the sequential structure of insurance data, model selection through cross validation with free permutation of instances must be discarded. Instead, we use a similar technique but that is coherent with the sequential structure. We explain how different software maturity levels lead to different levels of information being available at the time a decision must be made which in turn, impacts profitability.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.915
Threshold uncertainty score0.719

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.036
GPT teacher head0.222
Teacher spread0.185 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicInsurance and Financial Risk ManagementFrench-language works237,207