SPS Feed

Communication base stations can achieve high-precision tracking and accurate classification for multiple extended targets in the context of integrated communication and sensing by transmitting wideband signal. However, the time resources of the base stations are often limited. In the time-division operation mode, part of the time resources must be reserved to guarantee communication performance, while the rest of the resources must be properly allocated for better multi-target sensing performance.

This paper explores constrained non-convex personalized federated learning (PFL), in which a group of workers train local models and a global model, under the coordination of a server. To address the challenges of efficient information exchange and robustness against the so-called Byzantine workers, we propose a projected stochastic gradient descent algorithm for PFL that simultaneously ensures Byzantine-robustness and communication efficiency. 

This article proposes a distributed time-varying optimization approach to address the dynamic resource allocation problem, leveraging a sliding mode technique. The algorithm integrates a fixed-time sliding mode component to ensure that the global equality constraints are met, and is coupled with a fixed-time distributed control mechanism involving the nonsmooth consensus idea for attaining the system's optimal state.