MétaCan
Menu
Back to cohort
Record W4411542027 · doi:10.1145/3715275.3732211

Trustworthy ML Regulation as a Principal-Agent Problem

2025· article· en· W4411542027 on OpenAlexafffund
Mohammad Yaghini, Andrew Magnuson, Natalie Dullerud, Nicolas Papernot

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsVector InstituteUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of CanadaGovernment of CanadaCanadian Institute for Advanced Research
KeywordsTrustworthinessComputer sciencePrincipal (computer security)Computer securityPrincipal component analysisArtificial intelligence

Abstract

fetched live from OpenAlex

As ML-enabled systems become increasingly prevalent, so do their societal risks, such as excessive privacy and fairness violations.Mitigating such risks is frequently at odds with the system's overall performance.As a result, companies producing these systems and the public place different relative importance on these objectives-a case of misaligned incentives.Public regulators seeking to curb such risks are faced with designing regulations with a penalty structure that balances unmitigated societal risks and unnecessary financial burdens on a burgeoning industry.However, regulators often do not have access to the data or the training procedure of the model used by companies.Such access asymmetries can cause uncertainties in risk estimations that we show can lead to unintended over-regulation of law-abiding companies (1-7% drop in accuracy on three vision datasets).The access asymmetries that enabled unintended over-regulation are an artifact of the separation of the company and the regulator.This realization leads us to formulate ML Regulation as a Principal-Agent Problem (PAP).We provide a taxonomy of PAPs in this domain and tackle the problem of optimal penalty design in a reduced setting, which allows us to align the company's incentives with the public expectation of safety.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.640
Threshold uncertainty score0.997

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.0060.004

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.059
GPT teacher head0.401
Teacher spread0.342 · 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; both teacher heads agree on what is shown here.

Study designTheoretical or conceptual
Domainnot available
GenreOther

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
Published2025
Admission routes2
Has abstractyes

Explore more

Same topicAuction Theory and ApplicationsFrench-language works237,207