atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

The Fundamental Limits of Least-Privilege Learning

ICML 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Contrastive representation theory · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Formalises least-privilege learning (LPP) via maximal leakage conditioned on the task label, proves a fundamental utility-leakage trade-off under strictly positive posterior, and validates it empirically on LFWA+ (CNN256 with GRAD censoring), Texas Hospital (TabNet) and other settings.

Problem

Least-privilege learning aims to learn feature representations useful for a task while preventing inference of any unrelated sensitive attribute, but this goal has only been stated informally and its feasibility was unclear.

Approach

Formalise LPP as bounding the maximal leakage of a representation conditioned on the task label (so the task label's own fundamental leakage is allowed), and prove that under a strictly positive posterior any representation with utility above gamma must violate LPP with parameter gamma, matching the LDP trade-off.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use task-useful representations under strictly positive task-label uncertaintyLeast-privilege learning · General data distributions with strictly positive posteriorutility–leakage trade-offHurt
Use a non-trivial feature map under strictly positive task-label uncertaintyLeast-privilege learning · Perfect LPP (γ = 0)conditional leakageHurt
Train with standard SGD rather than restricting representations to the task labelCNN256 · LFWA+attribute inference gain beyond fundamental leakageHurt
Apply gradient-reversal attribute censoring to the most-leaked attributeCNN256 · LFWA+leakage of the censored attributeHelped
Apply gradient-reversal attribute censoring to one sensitive attributeCNN256 · LFWA+attribute inference gain beyond fundamental leakageHurt
Use MAX-ENT attribute obfuscationAdult income model · Adultattribute inference gain beyond utility gain: two out of fourMixed
Share gradient updates instead of feature activationsCollaborative learning representations · Collaborative learning settingattribute inference gain beyond utility gainHurt
Give the adversary direct access to feature representations rather than gradientsCollaborative learning representations · Collaborative learning settingadversary inference gainHelped
Use lower-layer rather than higher-layer representationsCNN256 · LFWA+adversary inference gainMixed
Change the encoder architecture from CNN256 to ResNet18Standard-SGD model · LFWA+attribute inference gain beyond utility gainNo clear effect
Use a TabNet encoder on Texas Hospital dataTabNet · Texas Hospitalattribute inference gain beyond utility gainHurt
Use a CNN256 encoder on LFWA+CNN256 · LFWA+attribute inference gain beyond fundamental leakageHurt

Surprising findings

Limitations

Experimental setup

Datasets: LFWA+ Adult Texas Hospital Discharge

Benchmarks: LFWA+ Adult Texas Hospital Discharge

Metrics: multiplicative gain (Arimoto information alpha=infinity) attribute inference gain delta_Adv = gain(S;Z|Y) - gain(Y;Z)

Baselines: GRAD censoring MAX-ENT adversarial representation learning standard ERM with SGD

Builds on: maximal leakage conditional entropy bottleneck local differential privacy gradient reversal

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy