{"title":"A Generalized Framework for Social Learning Over State-Dependent Networks","authors":"Joni Shaska;Urbashi Mitra","doi":"10.1109/TSP.2024.3460741","DOIUrl":"https://doi.org/10.1109/TSP.2024.3460741","url":null,"abstract":"Many social and distributed learning applications often exhibit highly correlated observations. In particular, knowledge of the underlying parameters is often insufficient to decouple observations statistically. This feature challenges the analysis of these learning systems and the design of learning rules. In many cases, this coupling can be effectively captured by an additional state variable. To this end, a new framework for social learning, based on the notion of state, is derived. The framework allows for extensions of several classical results for the conditionally \u0000<italic>independent</i>\u0000 case to the conditionally \u0000<italic>dependent</i>\u0000 case, considerably simplifying the design and analysis of decision rules. A numerical example focusing on Byzantine attacks in sensor networks is explored. Specifically, it is shown that the problem of learning under Byzantine attacks belongs to the proposed framework for some widely used attack models, highlighting the utility of the framework. Furthermore, the optimal decision rules for \u0000<italic>large</i>\u0000 networks are derived and shown to be superior to those computed under the assumption of conditionally independent observations.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4366-4380"},"PeriodicalIF":4.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Single-Loop Deep Actor-Critic for Constrained Reinforcement Learning With Provable Convergence","authors":"Kexuan Wang;An Liu;Baishuo Lin","doi":"10.1109/TSP.2024.3461963","DOIUrl":"https://doi.org/10.1109/TSP.2024.3461963","url":null,"abstract":"Deep actor-critic (DAC) algorithms, which combine actor-critic with deep neural network (DNN), have been among the most prevalent reinforcement learning algorithms for decision-making problems in simulated environments. However, the existing DAC algorithms are still not mature to solve realistic problems with non-convex stochastic constraints and high cost to interact with the environment. In this paper, we propose a single-loop DAC (SLDAC) algorithmic framework for general constrained reinforcement learning problems. In the actor module, the constrained stochastic successive convex approximation (CSSCA) method is applied to better handle the non-convex stochastic objective and constraints. In the critic module, the critic DNNs are only updated once or a few finite times for each iteration, which simplifies the algorithm to a single-loop framework. Moreover, the variance of the policy gradient estimation is reduced by reusing observations from the old policy. The single-loop design and the observation reuse effectively reduce the agent-environment interaction cost and computational complexity. Despite the biased policy gradient estimation incurred by the single-loop design and observation reuse, we prove that the SLDAC with a feasible initial point can converge to a Karush-Kuhn-Tuker (KKT) point of the original problem almost surely. Simulations show that the SLDAC algorithm can achieve superior performance with much lower interaction cost.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4871-4887"},"PeriodicalIF":4.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-Coherent Over-the-Air Decentralized Gradient Descent","authors":"Nicolò Michelusi","doi":"10.1109/TSP.2024.3460690","DOIUrl":"10.1109/TSP.2024.3460690","url":null,"abstract":"Implementing Decentralized Gradient Descent (DGD) in wireless systems is challenging due to noise, fading, and limited bandwidth, necessitating topology awareness, transmission scheduling, and the acquisition of channel state information (CSI) to mitigate interference and maintain reliable communications. These operations may result in substantial signaling overhead and scalability challenges in large networks lacking central coordination. This paper introduces a scalable DGD algorithm that eliminates the need for scheduling, topology information, or CSI (both average and instantaneous). At its core is a Non-Coherent Over-The-Air (NCOTA) consensus scheme that exploits a noisy energy superposition property of wireless channels. Nodes encode their local optimization signals into energy levels within an OFDM frame and transmit simultaneously, without coordination. The key insight is that the received energy equals, \u0000<italic>on average</i>\u0000, the sum of the energies of the transmitted signals, scaled by their respective average channel gains, akin to a consensus step. This property enables unbiased consensus estimation, utilizing average channel gains as mixing weights, thereby removing the need for their explicit design or for CSI. Introducing a consensus stepsize mitigates consensus estimation errors due to energy fluctuations around their expected values. For strongly-convex problems, it is shown that the expected squared distance between the local and globally optimum models vanishes at a rate of \u0000<inline-formula><tex-math>$mathcal{O}(1/sqrt{k})$</tex-math></inline-formula>\u0000 after \u0000<inline-formula><tex-math>$k$</tex-math></inline-formula>\u0000 iterations, with suitable decreasing learning and consensus stepsizes. Extensions accommodate a broad class of fading models and frequency-selective channels. Numerical experiments on image classification demonstrate faster convergence in terms of running time compared to state-of-the-art schemes, especially in dense network scenarios.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4618-4634"},"PeriodicalIF":4.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142236321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Global Algorithms for Transmit Beamforming Design in ISAC Systems","authors":"Jiageng Wu;Zhiguo Wang;Ya-Feng Liu;Fan Liu","doi":"10.1109/TSP.2024.3457817","DOIUrl":"https://doi.org/10.1109/TSP.2024.3457817","url":null,"abstract":"In this paper, we propose a MIMO transmit beamforming optimization model for joint radar sensing and multi-user communications, where the design of the beamformers is formulated as an optimization problem whose objective is a weighted combination of the sum rate and the Cramér-Rao bound, subject to the transmit power budget. Obtaining the global solution for the formulated nonconvex problem is a challenging task, since the sum-rate maximization problem itself (even without considering the sensing metric) is known to be NP-hard. The main contributions of this paper are threefold. Firstly, we derive an optimal closed-form solution to the formulated problem in the single-user case and the multi-user case where the channel vectors of different users are orthogonal. Secondly, for the general multi-user case, we propose a novel branch and bound (B&B) algorithm based on the McCormick envelope relaxation. The proposed algorithm is guaranteed to find the globally optimal solution to the formulated problem. Thirdly, we design a graph neural network (GNN) based pruning policy to determine irrelevant nodes that can be directly pruned in the proposed B&B algorithm, thereby significantly reducing the number of unnecessary enumerations therein and improving its computational efficiency. Simulation results show the efficiency of the proposed vanilla and GNN-based accelerated B&B algorithms.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4493-4508"},"PeriodicalIF":4.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142452673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tao Wang;Junli Liang;H. C. So;Hongwei Gao;Yongkang Li
{"title":"Designing Sequence Set and Mismatched Filter Bank With Diagonal-Ridge-Type Doppler Tolerance via Relative Level Optimization","authors":"Tao Wang;Junli Liang;H. C. So;Hongwei Gao;Yongkang Li","doi":"10.1109/TSP.2024.3457778","DOIUrl":"10.1109/TSP.2024.3457778","url":null,"abstract":"To detect high-speed moving targets using multiple-transmitter systems, the transmit sequence set should possess Doppler tolerance performance similar to that of linear frequency modulated signal, characterized by a diagonal-ridge-type auto-ambiguity function (AF). Although they provide space and waveform diversities to enhance sensing performance compared to single-transmitter systems, the cross-AFs introduced by the multiple transmit sequences decrease the degrees-of-freedom (DOFs), and thus the sidelobe levels of both the auto- and cross- AFs are not sufficiently low. In this paper, we first establish the relative level (between AF sidelobe and mainlobe) -based fractional models to jointly design the transmit sequence set and mismatched filter bank with diagonal-ridge-type Doppler tolerance and low sidelobe AFs. Moreover, a novel similarity constraint between the sequence and mismatched filter is devised to flexibly adjust the receiver output loss. Together with the relative-level scheme, it also reduces the DOF loss incurred by the cross AFs. Furthermore, the resultant challenging sum-of-fraction formulations with nonlinear and nonconvex constraints are effectively tackled via fraction separation and decoupling. Finally, we extend our design to solve the joint design problem of sequence set and mismatched filter bank with low sidelobe level in correlation function. Numerical results demonstrate the excellent performance of the proposed methods.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4412-4427"},"PeriodicalIF":4.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142236320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Online Graph Filtering Over Expanding Graphs","authors":"Bishwadeep Das;Elvin Isufi","doi":"10.1109/TSP.2024.3460194","DOIUrl":"https://doi.org/10.1109/TSP.2024.3460194","url":null,"abstract":"Graph filters are a staple tool for processing signals over graphs in a multitude of downstream tasks. However, they are commonly designed for graphs with a fixed number of nodes, despite real-world networks typically grow over time. This topological evolution is often known up to a stochastic model, thus, making conventional graph filters ill-equipped to withstand such topological changes, their uncertainty, as well as the dynamic nature of the incoming data. To tackle these issues, we propose an online graph filtering framework by relying on online learning principles. We design filters for scenarios where the topology is both known and unknown, including a learner adaptive to such evolution. We conduct a regret analysis to highlight the role played by the different components such as the online algorithm, the filter order, and the growing graph model. Numerical experiments with synthetic and real data corroborate the proposed approach for graph signal inference tasks and show a competitive performance w.r.t. baselines and state-of-the-art alternatives.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4698-4712"},"PeriodicalIF":4.6,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"EMORF/S: EM-Based Outlier-Robust Filtering and Smoothing With Correlated Measurement Noise","authors":"Aamir Hussain Chughtai;Muhammad Tahir;Momin Uppal","doi":"10.1109/TSP.2024.3460176","DOIUrl":"10.1109/TSP.2024.3460176","url":null,"abstract":"In this article, we consider the problem of outlier-robust state estimation where the measurement noise can be correlated. Outliers in data arise due to many reasons like sensor malfunctioning, environmental behaviors, communication glitches, etc. Moreover, noise correlation emerges in several real-world applications e.g. sensor networks, radar data, GPS-based systems, etc. We consider these effects in system modeling which is subsequently used for inference. We employ the Expectation-Maximization (EM) framework to derive both outlier-resilient filtering and smoothing methods, suitable for online and offline estimation respectively. The standard Gaussian filtering and the Gaussian Rauch–Tung–Striebel (RTS) smoothing results are leveraged to devise the estimators. In addition, Bayesian Cramer-Rao Bounds (BCRBs) for a filter and a smoother which can perfectly detect and reject outliers are presented. These serve as useful theoretical benchmarks to gauge the error performance of different estimators. Lastly, different numerical experiments, for an illustrative target tracking application, are carried out that indicate performance gains compared to similarly engineered state-of-the-art outlier-rejecting state estimators. The advantages are in terms of simpler implementation, enhanced estimation quality, and competitive computational performance.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4318-4331"},"PeriodicalIF":4.6,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142231632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yun Chen;Zixuan Chen;Yunhua Zhang;Jiefang Yang;Dong Li
{"title":"Joint Design of Doppler Resilient Unimodular Discrete Phase Sequence Waveform and Receiving Filter for Multichannel Radar","authors":"Yun Chen;Zixuan Chen;Yunhua Zhang;Jiefang Yang;Dong Li","doi":"10.1109/TSP.2024.3458175","DOIUrl":"10.1109/TSP.2024.3458175","url":null,"abstract":"Design of discrete phase sequence waveform (DPSW) with desirable co- and cross-ambiguity function (AF) properties has been a longstanding and critical challenge in the field of high-performance multichannel electronic systems, e.g. radar systems. This paper focuses on the joint design of Doppler-resilient DPSW and receiving filter with low weighted integrated sidelobe level (WISL) for multichannel radar system. This design aims to construct DPSWs of “thumbtack” shape and all-zero AFs within the desired Range-Doppler region for both co-channels and cross-channels, respectively. A peak constraint function, i.e. the penalty function, is incorporated into the objective function to control the signal-to-noise ratio loss (SNRL) due to mismatched filtering. In the design, unimodular and discrete phase constraints are imposed on each element of the sequences, while the receiving filters are subject to the energy constraint and the mismatch constraint of SNRL. Different constraints on transmitted sequences and receiving filters make the optimization problem difficult to solve. Here, an alternatively iterative algorithm based on the majorization-minimization (MM) and the coordinate descent (CD) frameworks is proposed to handle the differently constrained optimization problem. Moreover, by incorporating a general acceleration scheme and the fast Fourier transform (FFT), the computational efficiency of the proposed algorithm can be further improved. Simulation and practical experiments are conducted to validate the designed DPSWs showing superior performance when compared to that by the latest and representative methods.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4207-4221"},"PeriodicalIF":4.6,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142231633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ali Abdelbadie;Mona Mostafa;Salime Bameri;Ramy H. Gohary;Dimple Thomas
{"title":"DoA Estimation for Hybrid Receivers: Full Spatial Coverage and Successive Refinement","authors":"Ali Abdelbadie;Mona Mostafa;Salime Bameri;Ramy H. Gohary;Dimple Thomas","doi":"10.1109/TSP.2024.3459422","DOIUrl":"10.1109/TSP.2024.3459422","url":null,"abstract":"We develop two novel algorithms for estimating the direction of arrival (DoA) of multiple sources in fully-connected and partially-connected hybrid analog/digital (HAD) receivers. The first algorithm is based on the observation that the analog combiner projects received signals on a particular subspace, causing the signals corresponding to particular DoAs to be heavily attenuated. Thus, an analog combiner defines spatial sectors, beyond which the DoAs are practically undetectable. To address this difficulty, we perform DoA estimation over an exhaustive set of analog combiners spanning distinct subspaces. To refine the estimates generated by this algorithm, we develop an exponentially-converging algorithm wherein the search window is successively narrowed until convergence. Cramér-Rao lower bounds on the root-mean-square error of the proposed algorithms are derived and the superiority of these algorithms over their existing counterparts is established through numerical simulations.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4730-4744"},"PeriodicalIF":4.6,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142174784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Junbin Liu;Ya Liu;Wing-Kin Ma;Mingjie Shao;Anthony Man-Cho So
{"title":"Extreme Point Pursuit—Part I: A Framework for Constant Modulus Optimization","authors":"Junbin Liu;Ya Liu;Wing-Kin Ma;Mingjie Shao;Anthony Man-Cho So","doi":"10.1109/TSP.2024.3458008","DOIUrl":"10.1109/TSP.2024.3458008","url":null,"abstract":"This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix constraints, non-negative semi-orthogonal matrix constraints, and several types of binary assignment constraints. Capitalizing on the basic principles of concave minimization and error bounds, we study a convex-constrained penalized formulation for general CM problems. The advantage of such formulation is that it allows us to leverage non-convex optimization techniques, such as the simple projected gradient method, to build algorithms. As the first part of this study, we explore the theory of this framework. We study conditions under which the formulation provides exact penalization results. We also examine computational aspects relating to the use of the projected gradient method for each type of CM constraint. Our study suggests that the proposed framework has a broad scope of applicability.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"72 ","pages":"4541-4556"},"PeriodicalIF":4.6,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142170621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}