{"title":"Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraints","authors":"Meiyi Zhu;Matteo Zecchin;Sangwoo Park;Caili Guo;Chunyan Feng;Petar Popovski;Osvaldo Simeone","doi":"10.1109/TSP.2025.3549222","DOIUrl":"10.1109/TSP.2025.3549222","url":null,"abstract":"This paper presents communication-constrained distributed conformal risk control (CD-CRC) framework, a novel decision-making framework for sensor networks under communication constraints. Targeting multi-label classification problems, such as segmentation, CD-CRC dynamically adjusts local and global thresholds used to identify significant labels with the goal of ensuring a target false negative rate (FNR), while adhering to communication capacity limits. CD-CRC builds on online exponentiated gradient descent to estimate the relative quality of the observations of different sensors, and on online conformal risk control (CRC) as a mechanism to control local and global thresholds. CD-CRC is proved to offer deterministic worst-case performance guarantees in terms of FNR and communication overhead, while the regret performance in terms of false positive rate (FPR) is characterized as a function of the key hyperparameters. Simulation results highlight the effectiveness of CD-CRC, particularly in communication resource-constrained environments, making it a valuable tool for enhancing the performance and reliability of distributed sensor networks.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1485-1500"},"PeriodicalIF":4.6,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143575097","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}
Dongyuan Lin;Xiaofeng Chen;Yunfei Zheng;Zhongyuan Guo;Qiangqiang Zhang;Shiyuan Wang
{"title":"Quaternion Information Filters With Inaccurate Measurement Noise Covariance: A Variational Bayesian Method","authors":"Dongyuan Lin;Xiaofeng Chen;Yunfei Zheng;Zhongyuan Guo;Qiangqiang Zhang;Shiyuan Wang","doi":"10.1109/TSP.2025.3549023","DOIUrl":"10.1109/TSP.2025.3549023","url":null,"abstract":"Quaternion Kalman filters (QKFs) are designed for state estimation in three-dimensional (3-D) space. To simplify initialization, this paper focuses on the quaternion information filter (QIF), which converts the information vector and matrix into quaternion form. While QIF demonstrates strong performance under the assumption of known quaternion measurement noise statistics, this assumption frequently does not hold in practical scenarios. To address this issue, a variational Bayesian adaptive QIF (VBAQIF) is proposed by modeling the inverse of the covariance matrix for the quaternion measurement noise as the quaternion Wishart distribution in this paper. First, the adaptive QIF is derived under the recursive Bayesian estimation framework to propagate the quaternoin information vector and information matrix. Then, the quaternion measurement noise covariance matrix together with the quaternion state is inferred using the variational Bayesian approach. Furthermore, a corresponding square root version, called variational Bayesian adaptive square-root QIF (VBASQIF), is developed to enhance numerical stability of VBAQIF, and this stability is analyzed from a theoretical perspective. Finally, a 3-D target tracking example is simulated to demonstrate that the proposed VBAQIF exhibits excellent performance even in the presence of uncertainties in the quaternion measurement noise covariance matrices.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1367-1378"},"PeriodicalIF":4.6,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143575098","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":"A Decentralized Primal-Dual Method With Quasi-Newton Tracking","authors":"Liping Wang;Hao Wu;Hongchao Zhang","doi":"10.1109/TSP.2025.3547787","DOIUrl":"10.1109/TSP.2025.3547787","url":null,"abstract":"This paper considers the decentralized optimization problem of minimizing a finite sum of strongly convex and twice continuously differentiable functions over a fixed-connected undirected network. A fully decentralized primal-dual method (DPDM) and its generalization (GDPDM), which allows for multiple primal steps per iteration, are proposed. In our methods, both primal and dual updates use second-order information obtained by quasi-Newton techniques which only involve matrix-vector multiplication. Specifically, the primal update applies a Jacobi relaxation step using the BFGS approximation for both computation and communication efficiency. The dual update employs a new second-order correction step. We show that the decentralized local primal updating direction on each node asymptotically approaches the centralized quasi-Newton direction. Under proper choice of parameters, GDPDM including DPDM has global linear convergence for solving strongly convex decentralized optimization problems. Our numerical results show both GDPDM and DPDM are very efficient compared with other state-of-the-art methods for solving decentralized optimization.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1323-1336"},"PeriodicalIF":4.6,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143546462","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":"Distributed Stochastic Gradient Descent With Staleness: A Stochastic Delay Differential Equation Based Framework","authors":"Siyuan Yu;Wei Chen;H. Vincent Poor","doi":"10.1109/TSP.2025.3546574","DOIUrl":"10.1109/TSP.2025.3546574","url":null,"abstract":"Distributed stochastic gradient descent (SGD) has attracted considerable recent attention due to its potential for scaling computational resources, reducing training time, and helping protect user privacy in machine learning. However, stragglers and limited bandwidth may induce random computational/ communication delays, thereby severely hindering the learning process. Therefore, how to accelerate asynchronous SGD (ASGD) by efficiently scheduling multiple workers is an important issue. In this paper, a unified framework is presented to analyze and optimize the convergence of ASGD based on stochastic delay differential equations (SDDEs) and the Poisson approximation of aggregated gradient arrivals. In particular, we present the run time and staleness of distributed SGD without a memorylessness assumption on the computation times. Given the learning rate, we reveal the relevant SDDE's damping coefficient and its delay statistics, as functions of the number of activated clients, staleness threshold, the eigenvalues of the Hessian matrix of the objective function, and the overall computational/communication delay. The formulated SDDE allows us to present both the distributed SGD's convergence condition and speed by calculating its characteristic roots, thereby optimizing the scheduling policies for asynchronous/event-triggered SGD. It is interestingly shown that increasing the number of activated workers does not necessarily accelerate distributed SGD due to staleness. Moreover, a small degree of staleness does not necessarily slow down the convergence, while a large degree of staleness will result in the divergence of distributed SGD. Numerical results demonstrate the potential of our SDDE framework, even in complex learning tasks with non-convex objective functions.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1708-1726"},"PeriodicalIF":4.6,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143546460","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":"Generalized Quantum State Tomography With Hybrid Denoising Priors","authors":"Duoduo Xue;Wenrui Dai;Ziyang Zheng;Chenglin Li;Junni Zou;Hongkai Xiong","doi":"10.1109/TSP.2025.3546655","DOIUrl":"10.1109/TSP.2025.3546655","url":null,"abstract":"Quantum state tomography (QST) is the gold standard for estimating the unknown state of quantum systems but suffers from the longstanding problem of exponentially growing measurements. Recent deep learning approaches alleviate the problem by training neural networks in a data-driven manner without theoretical convergence guarantees. They lack reliability in tomography quality and are restricted by retraining when generalized to extensive quantum systems with varying realizations in different environments. To address this issue, we propose the first generalized deep learning method for QST, named HD-QST, that leverages hybrid denoising priors with well-established convergence guarantees to fit extensive quantum states and environments. Hybrid denoising priors are achieved with the convex combination of analytic low-rank denoiser and neural network-based smooth denoiser dynamically determined via reinforcement learning. We demonstrate in theory that, when characterizing a quantum system, HD-QST guarantees a geometric convergence rate under the relaxed condition that the true density matrix is the fixed point of any one denoiser rather than the shared fixed point of multiple denoisers. Extensive experiments show that, compared with existing methods, HD-QST consistently obtains superior fidelity for pure and mixed quantum states in both single-device simulations and cross-device applications. Remarkably, it achieves state-of-the-art fidelity in QST of real-world W states by trapped ions and precise evaluation and comparison on cross-device QST on IBM quantum computers.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1532-1548"},"PeriodicalIF":4.6,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143526156","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}
James Z. Hare;Yuchen Liang;Lance M. Kaplan;Venugopal V. Veeravalli
{"title":"Bayesian Two-Sample Hypothesis Testing Using the Uncertain Likelihood Ratio: Improving the Generalized Likelihood Ratio Test","authors":"James Z. Hare;Yuchen Liang;Lance M. Kaplan;Venugopal V. Veeravalli","doi":"10.1109/TSP.2025.3546169","DOIUrl":"10.1109/TSP.2025.3546169","url":null,"abstract":"Two-sample hypothesis testing is a common practice in many fields of science, where the goal is to identify whether a set of observations and a set of training data are drawn from the same distribution. Traditionally, this is achieved using parametric and non-parametric frequentist tests, such as the Generalized Likelihood Ratio (GLR) test. However, these tests are not optimal in a Neyman-Pearson sense, especially when the number of observations and training samples are finite. Therefore, in this work, we study a parametric Bayesian test, called the Uncertain Likelihood Ratio (ULR) test, and compare its performance to the traditional GLR test. We establish that the ULR test is the optimal test for any number of samples when the parameters of the likelihood models are drawn from the true prior distribution. We then study an asymptotic form of the ULR test statistic and compare it against the GLR test statistic. As a byproduct of this analysis, we establish a new asymptotic optimality property for the GLR test when the parameters of the likelihood models are drawn from the Jeffreys prior. Furthermore, we analyze conditions under which the ULR test outperforms the GLR test, and include a numerical study to validate the results.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1410-1425"},"PeriodicalIF":4.6,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143526157","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}
Sihua Wang;Huayan Guo;Xu Zhu;Changchuan Yin;Vincent K. N. Lau
{"title":"Communication-Efficient Distributed Bayesian Federated Learning Over Arbitrary Graphs","authors":"Sihua Wang;Huayan Guo;Xu Zhu;Changchuan Yin;Vincent K. N. Lau","doi":"10.1109/TSP.2025.3546328","DOIUrl":"10.1109/TSP.2025.3546328","url":null,"abstract":"This paper investigates a fully distributed federated learning (FL) problem, in which each device is restricted to only utilize its local dataset and the information received from its adjacent devices that are defined in a communication graph to update the local model weights for minimizing the global loss function. To incorporate the communication graph constraint into the joint posterior distribution, we exploit the fact that the model weights on each device is a function of its local likelihood and local prior and then, the connectivity between adjacent devices is modeled by a Dirac Delta distribution. In this way, the joint distribution can be factorized naturally by a factor graph. Based on the Dirac Delta-based factor graph, we propose a novel distributed approximate Bayesian inference algorithm that combines loopy belief propagation (LBP) and variational Bayesian inference (VBI) for distributed FL. Specifically, VBI is used to approximate the non-Gaussian marginal posterior as a Gaussian distribution in local training process and then, the global training process resembles Gaussian LBP where only the mean and variance are passed among adjacent devices. Furthermore, we propose a new damping factor design according to the communication graph topology to mitigate the potential divergence and achieve consensus convergence. Simulation results verify that the proposed solution achieves faster convergence speed with better performance than baselines.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1351-1366"},"PeriodicalIF":4.6,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143507268","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":"Distributed Adaptive Spatial Filtering With Inexact Local Solvers","authors":"Charles Hovine;Alexander Bertrand","doi":"10.1109/TSP.2025.3546484","DOIUrl":"10.1109/TSP.2025.3546484","url":null,"abstract":"The Distributed Adaptive Signal Fusion (DASF) framework is a meta-algorithm for computing data-driven spatial filters in a distributed sensing platform with limited bandwidth and computational resources, such as a wireless sensor network. The convergence and optimality of the DASF algorithm has been extensively studied under the assumption that an exact, but possibly impractical solver for the local optimization problem at each updating node is available. In this work, we provide convergence and optimality results for the DASF framework when used with an inexact, finite-time solver such as (proximal) gradient descent or Newton's method. We provide sufficient conditions that the solver should satisfy in order to guarantee convergence of the resulting algorithm as well as numerical simulations to validate these theoretical results.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1262-1277"},"PeriodicalIF":4.6,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143507269","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":"Learning Task-Based Trainable Neuromorphic ADCs via Power-Aware Distillation","authors":"Tal Vol;Loai Danial;Nir Shlezinger","doi":"10.1109/TSP.2025.3546458","DOIUrl":"10.1109/TSP.2025.3546458","url":null,"abstract":"The ability to process signals in digital form depends on analog-to-digital converters (ADCs). Traditionally, ADCs are designed to ensure that the digital representation closely matches the analog signal. However, recent studies have shown that significant power and memory savings can be achieved through <italic>task-based acquisition</i>, where the acquisition process is tailored to the downstream processing task. An emerging technology for task-based acquisition involves the use of memristors, which are considered key enablers for neuromorphic computing. Memristors can implement ADCs with tunable mappings, allowing adaptation to specific system tasks or power constraints. In this work, we study task-based acquisition for a generic classification task using memristive ADCs. We consider the unique characteristics of this such neuromorphic ADCs, including their power consumption and noisy read-write behavior, and propose a physically compliant model based on resistive successive approximation register ADCs integrated with memristor components, enabling the adjustment of quantization regions. To optimize performance, we introduce a data-driven algorithm that jointly tunes task-based memristive ADCs alongside both digital and analog processing. Our design addresses the inherent stochasticity of memristors through power-aware distillation, complemented by a specialized learning algorithm that adapts to their unique analog-to-digital mapping. The proposed approach is shown to enhance accuracy by up to 27% and reduce power consumption by up to 66% compared to uniform ADCs. Even under noisy conditions, our method achieves substantial gains, with accuracy improvements of up to 19% and power reductions of up to 57%. These results highlight the effectiveness of our power-aware neuromorphic ADCs in improving system performance across diverse tasks.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1246-1261"},"PeriodicalIF":4.6,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143507278","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":"Event-Triggered State Estimation Through Confidence Level","authors":"Wei Liu","doi":"10.1109/TSP.2025.3543721","DOIUrl":"10.1109/TSP.2025.3543721","url":null,"abstract":"This paper considers the state estimation problem for discrete-time linear systems under event-triggered scheme. In order to improve performance, a novel event-triggered scheme based on confidence level is proposed using the chi-square distribution and mild regularity assumption. In terms of the novel event-triggered scheme, a minimum mean squared error (MMSE) state estimator is proposed using some results presented in this paper. Two algorithms for communication rate estimation of the proposed MMSE state estimator are developed where the first algorithm is based on information with one-step delay, and the second algorithm is based on information with two-step delay. The performance and effectiveness of the proposed MMSE state estimator and the two communication rate estimation algorithms are illustrated using a target tracking scenario.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1337-1350"},"PeriodicalIF":4.6,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143495420","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}