Privacy-aware Berrut Approximated Coded Computing applied to general distributed learning
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908359620296704 |
|---|---|
| author | Martínez-Luaña, Xavier Fernández-Veiga, Manuel Díaz-Redondo, Rebeca P. Fernández-Vilas, Ana |
| author_facet | Martínez-Luaña, Xavier Fernández-Veiga, Manuel Díaz-Redondo, Rebeca P. Fernández-Vilas, Ana |
| contents | Coded computing is one of the techniques that can be used for privacy protection in Federated Learning. However, most of the constructions used for coded computing work only under the assumption that the computations involved are exact, generally restricted to special classes of functions, and require quantized inputs. This paper considers the use of Private Berrut Approximate Coded Computing (PBACC) as a general solution to add strong but non-perfect privacy to federated learning. We derive new adapted PBACC algorithms for centralized aggregation, secure distributed training with centralized data, and secure decentralized training with decentralized data, thus enlarging significantly the applications of the method and the existing privacy protection tools available for these paradigms. Particularly, PBACC can be used robustly to attain privacy guarantees in decentralized federated learning for a variety of models. Our numerical results show that the achievable quality of different learning models (convolutional neural networks, variational autoencoders, and Cox regression) is minimally altered by using these new computing schemes, and that the privacy leakage can be bounded strictly to less than a fraction of one bit per participant. Additionally, the computational cost of the encoding and decoding processes depends only of the degree of decentralization of the data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06759 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Privacy-aware Berrut Approximated Coded Computing applied to general distributed learning Martínez-Luaña, Xavier Fernández-Veiga, Manuel Díaz-Redondo, Rebeca P. Fernández-Vilas, Ana Machine Learning Cryptography and Security Distributed, Parallel, and Cluster Computing Information Theory Coded computing is one of the techniques that can be used for privacy protection in Federated Learning. However, most of the constructions used for coded computing work only under the assumption that the computations involved are exact, generally restricted to special classes of functions, and require quantized inputs. This paper considers the use of Private Berrut Approximate Coded Computing (PBACC) as a general solution to add strong but non-perfect privacy to federated learning. We derive new adapted PBACC algorithms for centralized aggregation, secure distributed training with centralized data, and secure decentralized training with decentralized data, thus enlarging significantly the applications of the method and the existing privacy protection tools available for these paradigms. Particularly, PBACC can be used robustly to attain privacy guarantees in decentralized federated learning for a variety of models. Our numerical results show that the achievable quality of different learning models (convolutional neural networks, variational autoencoders, and Cox regression) is minimally altered by using these new computing schemes, and that the privacy leakage can be bounded strictly to less than a fraction of one bit per participant. Additionally, the computational cost of the encoding and decoding processes depends only of the degree of decentralization of the data. |
| title | Privacy-aware Berrut Approximated Coded Computing applied to general distributed learning |
| topic | Machine Learning Cryptography and Security Distributed, Parallel, and Cluster Computing Information Theory |
| url | https://arxiv.org/abs/2505.06759 |