arXiv Machine Learning By Yamato Suetake, Yuta Kawakami, Shunnosuke Ikeda, Yuichi Takano

Nonlinear Data Integration via Kernel Methods for Data Collaboration Analysis

Read the original on arXiv Machine Learning →

The paper introduces a kernel-based target-normalized integration (KTI) method for data collaboration analysis, addressing the limitations of linear obfuscation and integration that can increase reconstruction risk. KTI extends linear target-normalized integration (LTI) by applying kernel ridge regression and an eigenvalue problem, and incorporates graph regularization and centering constraints to embed geometric and target-variable information. Experiments on image classification tasks show that KTI outperforms existing linear methods, especially when combined with target-variable-aware regularization, and highlight how dimensionality reduction choices impact accuracy and reconstruction risk.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 20

Geometric Data Perturbation with Noisy-Anchor Alignment for Privacy-Preserving Collaborative Learning

Geometric Data Perturbation (GDP) allows participants to share distance‑preserving transformations of their private data for one‑shot collaborative learning. The paper examines the vulnerability when an analyst colludes with participants, showing that shared‑anchor alignment can restore compatibility but also enables exact data recovery. To mitigate this, the authors propose adding noise to the anchor representations rather than the private data, demonstrating through experiments on MNIST and CelebA that this approach yields better privacy‑utility trade‑offs under collusion.

By Keiyu Nosaka, Yamato Suetake, Yuichi Takano, Yukihiko Okada, Akiko Yoshise
arXiv Machine Learning
Aug 19

Picture the Epsilon: Pursuing Identity-Level Privacy Guarantees for Images

The paper compares four audit methods for assessing identity‑level differential privacy in pre‑trained, black‑box face generators. Each method—GaussMech, KDE‑LR, MMD‑TV, and ROC‑HT—has distinct assumptions, hyperparameters, and finite‑sample limitations, and they produce markedly different epsilon estimates when applied to FaceFusion and InstantID. The study finds that all methods reveal significant identity distinguishability, but none can be reliably ranked in this high‑distinguishability regime, suggesting that future work should evaluate them on partially private mechanisms.

By Arman Zareian Jahromi, Vishnu Bondalakunta, Mohammad Akbar Bin Shah, Naimul Haque, Shuangqing Wei, George T. Amariucai
arXiv AI
Sep 16

Differential privacy representation geometry for medical image analysis

The paper introduces Differential Privacy Representation Geometry for Medical Imaging (DP‑RGMI), a framework that interprets differential privacy as a structured transformation of representation space. DP‑RGMI decomposes performance loss into encoder geometry—measured by representation displacement and spectral effective dimension—and task‑head utilization, quantified by the gap between linear‑probe and end‑to‑end utility. Across 594,000 chest X‑ray images from four datasets, the study finds that differential privacy consistently creates a utilization gap even when linear separability remains, while displacement and spectral dimension vary non‑monotonically with initialization and dataset, indicating that privacy alters representation anisotropy rather than uniformly collapsing features.

By Soroosh Tayebi Arasteh, Marziyeh Mohammadi, Sven Nebelung, Daniel Truhn