Communication-Constrained Private Decentralized Online Personalized Mean Estimation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908635029831680 |
|---|---|
| author | Yakimenka, Yauhen Lin, Hsuan-Yin Rosnes, Eirik Kliewer, Jörg |
| author_facet | Yakimenka, Yauhen Lin, Hsuan-Yin Rosnes, Eirik Kliewer, Jörg |
| contents | We consider the problem of communication-constrained collaborative personalized mean estimation under a privacy constraint in an environment of several agents continuously receiving data according to arbitrary unknown agent-specific distributions. A consensus-based algorithm is studied under the framework of differential privacy in order to protect each agent's data. We give a theoretical convergence analysis of the proposed consensus-based algorithm for any bounded unknown distributions on the agents' data, showing that collaboration provides faster convergence than a fully local approach where agents do not share data, under an oracle decision rule and under some restrictions on the privacy level and the agents' connectivity, which illustrates the benefit of private collaboration in an online setting under a communication restriction on the agents. The theoretical faster-than-local convergence guarantee is backed up by several numerical results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_04702 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Communication-Constrained Private Decentralized Online Personalized Mean Estimation Yakimenka, Yauhen Lin, Hsuan-Yin Rosnes, Eirik Kliewer, Jörg Social and Information Networks Information Theory Machine Learning We consider the problem of communication-constrained collaborative personalized mean estimation under a privacy constraint in an environment of several agents continuously receiving data according to arbitrary unknown agent-specific distributions. A consensus-based algorithm is studied under the framework of differential privacy in order to protect each agent's data. We give a theoretical convergence analysis of the proposed consensus-based algorithm for any bounded unknown distributions on the agents' data, showing that collaboration provides faster convergence than a fully local approach where agents do not share data, under an oracle decision rule and under some restrictions on the privacy level and the agents' connectivity, which illustrates the benefit of private collaboration in an online setting under a communication restriction on the agents. The theoretical faster-than-local convergence guarantee is backed up by several numerical results. |
| title | Communication-Constrained Private Decentralized Online Personalized Mean Estimation |
| topic | Social and Information Networks Information Theory Machine Learning |
| url | https://arxiv.org/abs/2511.04702 |