MétaCan
Menu
Back to cohort
Record W4387928556 · doi:10.48550/arxiv.2310.13786

Fundamental Limits of Membership Inference Attacks on Machine Learning Models

2023· preprint· en· W4387928556 on OpenAlexaff
Eric Aubinais, Élisabeth Gassiat, Pablo Piantanida

Bibliographic record

VenuearXiv (Cornell University) · 2023
Typepreprint
Languageen
FieldComputer Science
TopicAdversarial Robustness in Machine Learning
Canadian institutionsnot available
FundersInstitut Universitaire de FranceAgence Nationale de la Recherche
KeywordsOverfittingInferenceComputer scienceMachine learningStatistical inferenceArtificial intelligencePoint (geometry)Statistical modelData miningMathematicsArtificial neural networkStatistics

Abstract

fetched live from OpenAlex

Membership inference attacks (MIA) can reveal whether a particular data point was part of the training dataset, potentially exposing sensitive information about individuals. This article provides theoretical guarantees by exploring the fundamental statistical limitations associated with MIAs on machine learning models at large. More precisely, we first derive the statistical quantity that governs the effectiveness and success of such attacks. We then theoretically prove that in a non-linear regression setting with overfitting learning procedures, attacks may have a high probability of success. Finally, we investigate several situations for which we provide bounds on this quantity of interest. Interestingly, our findings indicate that discretizing the data might enhance the learning procedure's security. Specifically, it is demonstrated to be limited by a constant, which quantifies the diversity of the underlying data distribution. We illustrate those results through simple simulations.

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

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.037
metaresearch head score (Gemma)0.220
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.037
Threshold uncertainty score0.196

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0370.220
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0020.002
Science and technology studies0.0030.012
Scholarly communication0.0060.014
Open science0.0040.011
Research integrity0.0050.012
Insufficient payload (model declined to judge)0.0030.001

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.251
GPT teacher head0.254
Teacher spread0.002 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations2
Published2023
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdversarial Robustness in Machine LearningFrench-language works237,207