arXiv Machine Learning

Federated Hash Projected Latent Factor Learning

arXiv:2606. 26192v1 Announce Type: new Abstract: Hash Learning (HL) is an efficient representation learning approach that maps real-valued data into compact binary representations.

arXiv Machine Learning
Oct 12

ERIS: Enhancing the Privacy-Utility-Scalability Trade-Off in Federated Learning via Federated Shard Aggregation

ERIS is a federated learning framework that introduces Federated Shard Aggregation (FSA), partitioning client updates into shards aggregated by multiple client-side aggregators to eliminate a central bottleneck and limit data exposure. The framework can integrate Distributed Shifted Compression (DSC) to further reduce communication payloads and exposed coordinates. Experiments on image, text, and large language model tasks demonstrate that ERIS maintains FedAvg-level utility while significantly cutting communication overhead and enhancing robustness against membership inference and reconstruction attacks, all without heavy cryptography or utility‑degrading perturbations.

By Dario Fenoglio, Pasquale Polverino, Akash Dhasade, Jacopo Quizi, Martin Gjoreski, Marc Langheinrich
arXiv Machine Learning
Jun 26

Quantization in Federated Learning: Methods, Challenges and Future Directions

arXiv:2606. 26822v1 Announce Type: new Abstract: Federated Learning (FL) has become a foundational paradigm for privacy-preserving distributed intelligence, yet its scalability remains fundamentally constrained by communication bottlenecks, device heterogeneity, and the challenges of training under statistically non-IID data.

By Farwa Ikram, Dipanwita Thakur, Antonella Guzzo, Giancarlo Fortino
arXiv AI
Oct 16

FedSumUp: User-Auditable Privacy-Aware Representation Sharing for Resource-Constrained Federated Intelligence

FedSumUp introduces a learnable lossy compressor that generates compact, visually interpretable representations on client devices, reducing privacy leakage and computational overhead. The compressor is trained on the server using a data‑free closed‑loop optimization that minimizes the difference between original and twice‑compressed representations after upsampling. Experiments on BloodMNIST, CIFAR‑10, and ChestMNIST show low reconstruction PSNR, significant client runtime reductions, and competitive classification accuracy while remaining robust to non‑IID data.

By Jingwei Zhao, Tiantong Sun, Yuanyuan Song, Jinhuan Guo, Wei Zishuo, Shengyu Huang, Ziyuan Ren, Wei Chen, Xiaojin Zhang