Search arXivSearch

arXiv · 2601.10013

Clustering-Based User Selection in Federated Learning: Metadata Exploitation for 3GPP Networks

Abstract

Federated learning (FL) enables collaborative model training without sharing raw user data, but conventional simulations often rely on unrealistic data partitioning and current user selection methods ignore data correlation among users. To address these challenges, this paper proposes a metadatadriven FL framework. We first introduce a novel data partition model based on a homogeneous Poisson point process (HPPP), capturing both heterogeneity in data quantity and natural overlap among user datasets. Building on this model, we develop a clustering-based user selection strategy that leverages metadata, such as user location, to reduce data correlation and enhance label diversity across training rounds. Extensive experiments on FMNIST and CIFAR-10 demonstrate that the proposed framework improves model performance, stability, and convergence in non-IID scenarios, while maintaining comparable performance under IID settings. Furthermore, the method shows pronounced advantages when the number of selected users per round is small. These findings highlight the framework's potential for enhancing FL performance in realistic deployments and guiding future standardization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ce Zheng, Shiyao Ma, Ke Zhang, Chen Sun, Wenqi Zhang. 2026-01-20. Clustering-Based User Selection in Federated Learning: Metadata Exploitation for 3GPP Networks. https://arxiv.org/abs/2601.10013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Circulant ADMM-Net for Fast High-resolution DoA Estimation

This paper introduces CADMM-Net and CHADMM-Net, two deep neural networks for direction of arrival estimation within the least-absolute shrinkage and selection operator (LASSO) framework. These two networks are based on a structured deep unfolding of the alternating direction method of multipliers (ADMM) algorithm through the use of circulant as well as Hermitian-circulant matrices. Along with a computational complexity of $\mathcal{O}(N\log(N))$ per layer for the inference, where $N$ is the length of the dictionary $\mathbf{A}$, they additionally exhibit a memory footprint of $N$ and approximately half of $N$ for CADMMNet and CHADMM-Net, respectively, compared with $N^{2}$ for ADMM-Net. Furthermore, these structured networks exhibit a competitive performance against ADMM-Net, LISTA, TLISTA, and THLISTA with respect to the detection rate, the angular root-mean square error, and the normalized mean squared error.

eess.SP

BASIIS: Bistatic Angular Sampling and Interpolation for ISAC Setups

Integrated Sensing and Communications (ISAC) is a defining feature of 6G, extending cellular networks with radar-like sensing at limited additional overhead. In bistatic deployments, sensing requires coordinating the transmitter (TX) and receiver (RX) arrays to scan the Cartesian product of angle of departure and arrival, resulting in a four-dimensional sampling problem in the angular domain. This work establishes a complete angular sampling framework for bistatic ISAC, extending the DFT-based optimal-sampling methodology to the full azimuth and elevation domains of both arrays. We show that the bistatic geometry couples the TX and RX elevation angles, and represent this coupling through the ortho-baseline coarray, a virtual array that captures the joint elevation aperture of the array pair. From the coarray we derive a minimal sampling and interpolation scheme, near-lossless and realizable with any beamforming architecture. Monte Carlo simulations confirm the proposed minimal acquisition essentially equalizes the detection accuracy of dense oversampled imaging while acquiring 3 to 5 times fewer TX-RX direction pairs. This allows having bistatic operations with drastically reduced overhead on the radio resource usage of ISAC systems.

eess.SP

Centroid Angle Estimation of Multiple Scatterers Using Monopulse Radar with Frequency Diversity

The monopulse technique determines the angle of a target by comparing signals from two narrow beams, yielding a precise angular estimate with low complexity. However, it struggles to resolve multiple closely spaced scatterers within the same resolution cell. Existing methods for estimating multiple scatterer angles involve complex signal processing and system modifications. We propose an effective method to estimate the angular centroid of scatterers using the mode of monopulse angle estimates. A semi-analytic expression for the angle estimate distribution is derived, confirming that its mode aligns with the centroid. To enhance estimation accuracy, we employ frequency diversity to reduce sample correlation. Numerical results validate the advantages of the proposed method, demonstrating superior performance over conventional techniques with low complexity.

eess.SP