Vertically Federated Learning with Correlated Differential Privacy
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Federated learning (FL) aims to address the challenges of data silos and privacy protection in artificial intelligence. Vertically federated learning (VFL) with independent feature spaces and overlapping ID spaces can capture more knowledge and facilitate model learning. However, VFL has both privacy and utility problems in framework construction. On the one hand, sharing gradients may cause privacy leakage. On the other hand, the increase in participants brings a surge in the feature dimension of the global model, which results in higher computation costs and lower model accuracy. To address these issues, we propose a vertically federated learning algorithm with correlated differential privacy (CRDP-FL) to meet FL systems’ privacy and utility requirements. A privacy-preserved VFL framework is designed based on differential privacy (DP) between organizations with many network edge devices. Meanwhile, feature selection is performed to improve the algorithm’s efficiency and model performance to solve the problem of dimensionality explosion. We also propose a quantitative correlation analysis technique for VFL to reduce the correlated sensitivity and noise injection, balancing the utility decline due to DP protection. We theoretically analyze the privacy level and utility of CRDP-FL. A real vertically federated learning scenario is simulated with personalized settings based on the ISOLET and Breast Cancer datasets to verify the method’s effectiveness in model accuracy, privacy budget, and data correlation.
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.013 | 0.046 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it