← All projectsGitHub
Proper scoring & elicitation

Can the log score be made payable?

research/tangent-log

Bounded-payment log score by quadratic tangent extension: strictly proper, log-identical on [ε,1−ε], worst-case payment exactly ln((1−ε)/ε)+1/(1−ε), 63× Brier's curvature per range at p=10⁻³, crossover p(1−p)=1/(2R), best cutoff ε=p.

6 tests

What it found

Log score is ideal for rare faults but a confident wrong report costs unbounded stake. Extending the log generator past [ε,1−ε] by its second-order Taylor polynomial gives a strictly proper score, identical to log up to a constant inside, with worst-case payment exactly ln((1−ε)/ε)+1/(1−ε). Per unit of payment range it has 63× Brier’s curvature at p=10−3 but loses to Brier above a closed-form crossover (≈0.07), and ε=p is the best cutoff for truth p.

A figure from its own output

Figure produced by research/tangent-log: misreport
tangent-log/experiments/misreport.svg, written by the project's own experiment code.

Paper, code and results

More in Proper scoring & elicitation

All 28 Proper scoring & elicitation projects →

Other research topics

Proper scoring & elicitation28Effort & peer prediction9Verification games & slashing19Detection & tolerances14Markets as routers13Prediction-market design9Paying contributors8Decentralised training systems23Digital twins & sim-to-real164LLM chip design loops40Robot manufacturing loops53Ambient AI assistant46Self-replicating manufacturing34Simulation-first design64Engineered clothing45Task-specific AI accelerators40Algorithmic chip-design loops42Open-source purpose-built robots44The software-engineering loop43Adversarial human imitation41Open-source residential construction41Autonomous multi-angle capture34Sensing, imaging and 3D31Energy supply and dense energy storage39Robot societies among people31Agentic co-design of low-cost robots27Laundry-hanging robots25Machine learning on qualitative data23Robots on the building site27Civilizations & group psychology1History & human sciences1

Produced with AI assistance (Claude). Results are from the code in this repository and are simulated or stylised unless the abstract says otherwise; nothing here implies affiliation with or endorsement by any lab, researcher or company cited. MIT licensed.