paper-with-me

Papers

Data Collaboration Analysis with Orthonormal Basis Selection and Alignment

2024-03-05 · Keiyu Nosaka, Yuichi Takano, Akiko Yoshise

Data Collaboration (DC) analysis offers a privacy-preserving approach to multi-source machine learning by enabling participants to train a shared model without revealing their raw data. Instead, each participant shares only linearly transformed data through a non-iterative communication protocol, thereby mitigating both privacy risks and communication overhead. The core idea of DC is that while each participant obfuscates their data with a secret linear transformation (or basis), the aggregator aligns these secret bases to a chosen target basis \textit{without knowing the secret bases}. Although DC theory suggests that any target basis spanning the same subspace as the secret bases should suffice, empirical evidence reveals that the choice of target basis can substantially influence model performance. To address this discrepancy, we propose \textbf{Orthonormal DC (ODC)}, a novel framework that enforces orthonormal constraints during the basis selection and alignment phases. Unlike conventional DC -- which allows arbitrary target bases -- ODC restricts the target to orthonormal bases, rendering the specific choice of basis negligible concerning model performance. Furthermore, the alignment step in ODC reduces to the \textbf{Orthogonal Procrustes Problem}, which admits a closed-form solution with favorable computational properties. Empirical evaluations demonstrate that ODC achieves higher accuracy and improved efficiency compared to existing DC methods, aligning with our theoretical findings. Additional evaluations assess performance in non-ideal scenarios with heterogenous distributions, also showing the best overall performance for our method. These findings position ODC as a direct and effective enhancement to current DC frameworks without compromising privacy or communication overhead when orthonormality constraints are applicable.

📄 PDF Abstract BibTeX arXiv:2403.02780

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencyPrivacy Preserving

Methods 이 논문이 사용한 방법론

Procrustes Procrustes

Similar Papers 제목 키워드 기반

Machine Learning Assisted Orthonormal Basis Selection for Functional Data Analysis

2021-03-12 · Rani Basna, Hiba Nassar, Krzysztof Podgórski

In implementations of the functional data methods, the effect of the initial choice of an orthonormal basis has not gained much attention in the past. Typically, several standard bases such as Fourier, wavelets, splines,…

BIG-bench Machine Learning

eGHWT: The Extended Generalized Haar-Walsh Transform

2021-07-11 · Naoki Saito, Yiqun Shao

Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important and much research has been done recently. The Generalize…

Enhanced Boolean Correlation Matrix Memory

2016-07-11 · Mario Mastriani

This paper introduces an Enhanced Boolean version of the Correlation Matrix Memory (CMM), which is useful to work with binary memories. A novel Boolean Orthonormalization Process (BOP) is presented to convert a non-ortho…

Learning Orthonormal Bases for Function Spaces

2026-05-19 · Hamidreza Kamkari, Mohammad Sina Nabizadeh, Justin Solomon arxiv

Infinite-dimensional orthonormal basis expansions play a central role in representing and computing with function spaces due to their favorable linear algebraic properties. However, common bases such as Fourier or wavele…

Physical Simulations

Inducing Riesz and orthonormal bases in $L^2$ via composition operators

2024-06-25 · Yahya Saleh, Armin Iske

We investigate perturbations of orthonormal bases of $L^2$ via a composition operator $C_h$ induced by a mapping $h$. We provide a comprehensive characterization of the mapping $h$ required for the perturbed sequence to …

Form