Guanglei Li, Peng Chen · Information 2026 · 2026
DOI: 10.3390/info17090927
Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).
Heterogeneous client distributions and differential-privacy noise can slow learning. This study proposes time-varying privacy-scheduled differentially private federated learning (TVP-DPFL), combining a public Gaussian multiplier schedule, bounded reliability-weighted signals, and control-variate drift correction. Inverse-square normalization gives the time-varying and fixed schedules identical final Gaussian Rényi differential-privacy costs. On the Open University Learning Analytics Dataset (OULAD) and the Predict Students’ Dropout and Academic Success dataset from the University of California, Irvine repository (UCI-Dropout), the three-seed endpoint results are close to a differentially private variant of Stochastic Controlled Averaging for Federated Learning (DP-SCAFFOLD) under the common 30-round aggregate-update budget of ε = 8. The ten-seed scheduling comparison shows earlier attainment of the 95% validation target: 11.1 versus 12.4 rounds on OULAD and 16.4 versus 18.7 rounds on UCI-Dropout (two-sided Wilcoxon p = 0.002). The normalized area under the validation learning curve over 30 rounds (AULC30) also favors the time-varying schedule. The privacy guarantee applies to aggregate updates conditional on fixed bounded weights and control states, with auxiliary metadata and control-state releases requiring separate protection and accounting. Communication efficiency is measured by coordinated rounds and model/control-vector payloads on retrospective public-data silos.
No comments yet — start the discussion below.