Geometric Data Perturbation with Noisy-Anchor Alignment for Privacy-Preserving Collaborative Learning
Not on the map. Why?
Abstract (arXiv)
Geometric data perturbation enables one-shot representation sharing for privacy-preserving collaborative learning: each participant applies a secret distance-preserving transformation to its private data and uploads the resulting representation to a central analyst. We study analyst-participant collusion, in which a colluding participant discloses its data and transformation to help the analyst reconstruct another participant's data. Independent participant-specific transformations block direct inversion through a disclosed common transformation but leave uploads in incompatible coordinate systems, degrading pooled learning. Data Collaboration analysis restores compatibility by aligning transformed copies of a common anchor matrix withheld from the analyst. We show that, when the centered anchor matrix has full column rank, a colluder who discloses it enables exact recovery of every participant's transformation and inversion of noiseless private representations. Adding noise to private-data representations leaves this transformation-recovery channel intact and reduces leakage at a substantial utility cost. Instead, we perturb the anchor representations: each participant perturbs only its transformed anchor representation, preserving the geometry of its private-data upload while turning known-anchor transformation recovery into a noisy estimation problem. The analyst estimates the alignment using a spectral estimator for a generalized orthogonal Procrustes problem. We analyze recovery attacks against this protocol and compare both noise placements on the CelebA and VGGFace2 facial image datasets. Under the evaluated collusion attacks, noisy-anchor alignment retains higher downstream accuracy at low identity-linkage levels. Participant-count experiments examine the utility gains and limitations of larger collaborations at comparable measured linkage.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 19 Aug 2026.
Builds on
19 of 35 references.
References · 19
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,509
- 2017VGGFace2: A dataset for recognising faces across pose and agecited by 911
- 2019Towards Federated Learning at Scale: System Designcited by 826
- 2014Learning Face Representation from Scratchcited by 451
- 2018Improving the Gaussian Mechanism for Differential Privacy: Analytical Calibration and Optimal Denoisingcited by 216
- 2021Privacy-Preserving Machine Learning: Methods, Challenges and Directionscited by 58
- 2020MAAD-Face: A Massively Annotated Attribute Dataset for Face Imagescited by 31
- 2023Selective Knowledge Sharing for Privacy-Preserving Federated Distillation without A Good Teachercited by 25
- 2021Accuracy and Privacy Evaluations of Collaborative Data Analysiscited by 13
7 more
- 2022Non-readily identifiable data collaboration analysis for multiple datasets including personal informationcited by 10
- 2021Near-Optimal Bounds for Generalized Orthogonal Procrustes Problem via Generalized Power Methodcited by 4
- 2020On Lightweight Privacy-Preserving Collaborative Learning for Internet of Things by Independent Random Projectionscited by 3
- 2024New Solutions Based on the Generalized Eigenvalue Problem for the Data Collaboration Analysiscited by 3
- 2024Data Collaboration Analysis with Orthonormal Basis Selection and Alignmentcited by 2
- 2026Single-Round Clustered Federated Learning via Data Collaboration Analysis for Non-IID Datacited by 1
- 2026Nonlinear Data Integration via Kernel Methods for Data Collaboration Analysiscited by 1
Built on by
Not cited yet.