Steganography is the art of covert communication that pursues the secrecy of concealment. In adaptive steganography, the most commonly used framework of steganography, the sender embeds a “secret message” signal within another “cover” signal with respect to a certain adaptive distortion function that measures the distortion incurred, contributing to the composite “stego” signal that resembles the cover, and the receiver extracts the “secret message” signal from the stego.

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. 

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.

We consider a least absolute deviation (LAD) approach to the robust phase retrieval problem that aims to recover a signal from its absolute measurements corrupted with sparse noise. To solve the resulting non-convex optimization problem, we propose a robust alternating minimization (Robust-AM) derived as an unconstrained Gauss-Newton method.

Conventional beamforming methods for intelligent reflecting surfaces (IRSs) or reconfigurable intelligent surfaces (RISs) typically entail the full channel state information (CSI). However, the computational cost of channel acquisition soars exponentially with the number of IRSs. To bypass this difficulty, we propose a novel strategy called blind beamforming that coordinates multiple IRSs by means of statistics without knowing CSI.