range-penalization-theoretical-insights-with-applications-in-federated-learning-1e10800f·1 events·first seen Aliases: Range Penalization: Theoretical Insights with Applications in Federated Learning
This paper introduces range regularization for federated learning, identifying shared-weight features across clients while adaptively clustering personalized feature weights at extreme values (termed polar clustering). The approach targets statistical accuracy, cross-client regularity, and resource efficiency for quantization and coding. New nonasymptotic proof techniques are developed for the seminorm-based regularizer, alongside a fast optimization algorithm exploiting local strong convexity.