Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy
Abstract
Client contribution estimation in Federated Learning is necessary for identifying clients' importance and for providing fair rewards. Current methods often rely on server-side validation data or self-reported client information, which can compromise privacy or be susceptible to manipulation. We introduce a data-free signal based on the matrix von Neumann (spectral) entropy of the final-layer updates, which measures the diversity of the information contributed. We instantiate two practical schemes: (i) SpectralFed, which uses normalized entropy as aggregation weights, and (ii) SpectralFuse, which fuses entropy with class-specific alignment via a rank-adaptive Kalman filter for per-round stability. Across CIFAR-10/100 and the naturally partitioned FEMNIST and FedISIC benchmarks, entropy-derived scores show a consistently high correlation with standalone client accuracy under diverse non-IID regimes - without validation data or client metadata. We compare our results with data-free contribution estimation baselines and show that spectral entropy serves as a useful indicator of client contribution.
Cite
@article{arxiv.2604.22562,
title = {Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy},
author = {Asim Ukaye and Mubarak Abdu-Aguye and Nurbek Tastan and Karthik Nandakumar},
journal= {arXiv preprint arXiv:2604.22562},
year = {2026}
}
Comments
10 pages, 4 figures, 4 pages Appendix, 6 figures in Appendix. To appear in CVPR 2026 FedVision Workshop