MétaCan
Menu
Back to cohort
Record W1883968710 · doi:10.1109/cwit.2015.7255145

On maximal correlation, mutual information and data privacy

2015· article· en· W1883968710 on OpenAlexaff
Shahab Asoodeh, Fady Alajaji, Tamás Linder

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsQueen's University
Fundersnot available
KeywordsMutual informationConstraint (computer-aided design)CorrelationInformation privacyComputer scienceSet (abstract data type)Function (biology)Upper and lower boundsDifferential privacyPrivate information retrievalTheoretical computer scienceMathematicsData miningArtificial intelligenceComputer security

Abstract

fetched live from OpenAlex

The rate-privacy function is defined in [1] as a tradeoff between privacy and utility in a distributed private data system in which both privacy and utility are measured using mutual information. Here, we use maximal correlation in lieu of mutual information in the privacy constraint. We first obtain some general properties and bounds for maximal correlation and then modify the rate-privacy function to account for the privacy-constrained estimation problem. We find a bound for the utility in this problem when the maximal correlation privacy is set to some threshold ϵ > 0 and construct an explicit privacy scheme which achieves this bound.

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.019
metaresearch head score (Gemma)0.073
Version: metacan-v3-hybrid-931329e0061cValidation 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.019
Threshold uncertainty score0.103

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.073
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0030.006
Science and technology studies0.0020.012
Scholarly communication0.0060.019
Open science0.0030.008
Research integrity0.0040.007
Insufficient payload (model declined to judge)0.0020.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.066
GPT teacher head0.295
Teacher spread0.229 · 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 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

Citations47
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicPrivacy-Preserving Technologies in DataFrench-language works237,207