FedCCA: Federated Canonical Correlation Analysis

Zhengquan Luo, Kai Fong Ernest Chong, Pengfei Wei, Changyou Chen, Peilin Zhao, Renmin Han, Chunlai Zhou, Yunlong Wang, Zhiqiang Xu
Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, PMLR 300:424-432, 2026.

Abstract

Canonical Correlation Analysis (CCA) is a key tool for cross-modal learning, but centralized solutions are impractical due to the heavy cost of high-dimensional covariance operations and the privacy sensitivity of distributed data. To address these challenges, we propose FedCCA, a federated framework that replaces explicit inverses and inner least-squares solves with a truncated von Neumann series, reducing matrix inversions to lightweight matrix–vector multiplications while retaining provable convergence. This series formulation not only improves efficiency, but also provides explicit and tunable control of truncation error, and its structure naturally splits into client-side multiplications and a server-side projection step, making it particularly suitable for federated deployment. Building on this foundation, we incorporate Gaussian differential privacy and derive practical upper and lower bounds on the required noise variance, which yield end-to-end $(\varepsilon,\delta)$ guarantees together with convergence stability. Empirical results on five datasets confirm that FedCCA achieves accuracy comparable to centralized CCA and consistently outperforms ALS/TALS baselines in both sub-optimality gap and convergence speed, all while maintaining rigorous privacy protection.

Cite this Paper


BibTeX
@InProceedings{pmlr-v300-luo26a, title = { FedCCA: Federated Canonical Correlation Analysis }, author = {Luo, Zhengquan and Chong, Kai Fong Ernest and Wei, Pengfei and Chen, Changyou and Zhao, Peilin and Han, Renmin and Zhou, Chunlai and Wang, Yunlong and Xu, Zhiqiang}, booktitle = {Proceedings of The 29th International Conference on Artificial Intelligence and Statistics}, pages = {424--432}, year = {2026}, editor = {Khan, Emtiyaz and Li, Yingzhen and Solin, Arno and Ramdas, Aaditya}, volume = {300}, series = {Proceedings of Machine Learning Research}, month = {02--05 May}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v300/main/assets/luo26a/luo26a.pdf}, url = {https://proceedings.mlr.press/v300/luo26a.html}, abstract = { Canonical Correlation Analysis (CCA) is a key tool for cross-modal learning, but centralized solutions are impractical due to the heavy cost of high-dimensional covariance operations and the privacy sensitivity of distributed data. To address these challenges, we propose FedCCA, a federated framework that replaces explicit inverses and inner least-squares solves with a truncated von Neumann series, reducing matrix inversions to lightweight matrix–vector multiplications while retaining provable convergence. This series formulation not only improves efficiency, but also provides explicit and tunable control of truncation error, and its structure naturally splits into client-side multiplications and a server-side projection step, making it particularly suitable for federated deployment. Building on this foundation, we incorporate Gaussian differential privacy and derive practical upper and lower bounds on the required noise variance, which yield end-to-end $(\varepsilon,\delta)$ guarantees together with convergence stability. Empirical results on five datasets confirm that FedCCA achieves accuracy comparable to centralized CCA and consistently outperforms ALS/TALS baselines in both sub-optimality gap and convergence speed, all while maintaining rigorous privacy protection. } }
Endnote
%0 Conference Paper %T FedCCA: Federated Canonical Correlation Analysis %A Zhengquan Luo %A Kai Fong Ernest Chong %A Pengfei Wei %A Changyou Chen %A Peilin Zhao %A Renmin Han %A Chunlai Zhou %A Yunlong Wang %A Zhiqiang Xu %B Proceedings of The 29th International Conference on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2026 %E Emtiyaz Khan %E Yingzhen Li %E Arno Solin %E Aaditya Ramdas %F pmlr-v300-luo26a %I PMLR %P 424--432 %U https://proceedings.mlr.press/v300/luo26a.html %V 300 %X Canonical Correlation Analysis (CCA) is a key tool for cross-modal learning, but centralized solutions are impractical due to the heavy cost of high-dimensional covariance operations and the privacy sensitivity of distributed data. To address these challenges, we propose FedCCA, a federated framework that replaces explicit inverses and inner least-squares solves with a truncated von Neumann series, reducing matrix inversions to lightweight matrix–vector multiplications while retaining provable convergence. This series formulation not only improves efficiency, but also provides explicit and tunable control of truncation error, and its structure naturally splits into client-side multiplications and a server-side projection step, making it particularly suitable for federated deployment. Building on this foundation, we incorporate Gaussian differential privacy and derive practical upper and lower bounds on the required noise variance, which yield end-to-end $(\varepsilon,\delta)$ guarantees together with convergence stability. Empirical results on five datasets confirm that FedCCA achieves accuracy comparable to centralized CCA and consistently outperforms ALS/TALS baselines in both sub-optimality gap and convergence speed, all while maintaining rigorous privacy protection.
APA
Luo, Z., Chong, K.F.E., Wei, P., Chen, C., Zhao, P., Han, R., Zhou, C., Wang, Y. & Xu, Z.. (2026). FedCCA: Federated Canonical Correlation Analysis . Proceedings of The 29th International Conference on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research 300:424-432 Available from https://proceedings.mlr.press/v300/luo26a.html.

Related Material