IEEE journal on selected areas in information theory最新文献

{"title":"Age-Aware Stochastic Hybrid Systems: Stability, Solutions, and Applications","authors":"Ali Maatouk;Mohamad Assaad;Anthony Ephremides","doi":"10.1109/JSAIT.2023.3337203","DOIUrl":"https://doi.org/10.1109/JSAIT.2023.3337203","url":null,"abstract":"In this paper, we analyze status update systems modeled through the Stochastic Hybrid Systems (SHSs) tool. Contrary to previous works, we allow the system’s transition dynamics to be polynomial functions of the Age of Information (AoI). This dependence allows us to encapsulate many applications and opens the door for more sophisticated systems to be studied. However, this same dependence on the AoI engenders technical and analytical difficulties that we address in this paper. Specifically, we first showcase several characteristics of the age processes modeled through the SHSs tool. Then, we provide a framework to establish the Lagrange stability and positive recurrence of these processes. Building on this, we provide an approach to compute the \u0000<inline-formula> <tex-math>$m$ </tex-math></inline-formula>\u0000-th moment of the age processes. Interestingly, this technique allows us to approximate the average age by solving a simple set of linear equations. Equipped with this approach, we also provide a sequential convex approximation method to optimize the average age by calibrating the parameters of the system. Finally, we consider an age-dependent CSMA environment where the back-off duration depends on the instantaneous age. By leveraging our analysis, we contrast its performance to the age-blind CSMA and showcase the age performance gain provided by the former.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"762-783"},"PeriodicalIF":0.0,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139434818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Weighted Age of Information-Based Scheduling for Large Population Games on Networks","authors":"Shubham Aggarwal;Muhammad Aneeq uz Zaman;Melih Bastopcu;Tamer Başar","doi":"10.1109/JSAIT.2023.3334692","DOIUrl":"https://doi.org/10.1109/JSAIT.2023.3334692","url":null,"abstract":"In this paper, we study a multi-agent game between \u0000<inline-formula> <tex-math>$N$ </tex-math></inline-formula>\u0000 agents, which solve a consensus problem, and receive state information through a wireless network, that is controlled by a Base station (BS). Due to a hard-bandwidth constraint, the BS can concurrently connect at most \u0000<inline-formula> <tex-math>$R_{d} &lt; N$ </tex-math></inline-formula>\u0000 agents over the network. This causes an intermittency in the agents’ state information, necessitating state estimation based on each agent’s information history. Under standard assumptions on the information structure, we separate each agent’s estimation and control problems. The BS aims to find the optimum scheduling policy that minimizes a weighted age of information based performance metric, subject to the hard-bandwidth constraint. We first relax the hard constraint to a soft update-rate constraint and compute an optimal policy for the relaxed problem by reformulating it into an MDP. This then inspires a sub-optimal policy for the bandwidth constrained problem, which is shown to approach the optimal policy as \u0000<inline-formula> <tex-math>$N rightarrow infty $ </tex-math></inline-formula>\u0000. Next, we solve the consensus problem using the mean-field game framework. By explicitly constructing the mean-field system, we prove the existence of a unique mean-field equilibrium. Consequently, we show that the equilibrium policies obtained constitute an \u0000<inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>\u0000–Nash equilibrium for the finite-agent system.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"682-697"},"PeriodicalIF":0.0,"publicationDate":"2023-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138678678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Remote Monitoring of Two-State Markov Sources via Random Access Channels: An Information Freshness vs. State Estimation Entropy Perspective","authors":"Giuseppe Cocco;Andrea Munari;Gianluigi Liva","doi":"10.1109/JSAIT.2023.3329121","DOIUrl":"10.1109/JSAIT.2023.3329121","url":null,"abstract":"We study a system in which two-state Markov sources send status updates to a common receiver over a slotted ALOHA random access channel. We characterize the performance of the system in terms of state estimation entropy (SEE), which measures the uncertainty at the receiver about the sources’ state. Two channel access strategies are considered: a reactive policy that depends on the source behaviour and a random one that is independent of it. We prove that the considered policies can be studied using two different hidden Markov models and show through a density evolution analysis that the reactive strategy outperforms the random one in terms of SEE while the opposite is true for age of information. Furthermore, we characterize the probability of error in the state estimation at the receiver, considering a maximum a posteriori and a low-complexity (decode & hold) estimator. Our study provides useful insights on the design trade-offs that emerge when different performance metrics are adopted. Moreover, we show how the source statistics significantly impact the system performance.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"651-666"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135560847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimizing Task-Specific Timeliness With Edge-Assisted Scheduling for Status Update","authors":"Jingzhou Sun;Lehan Wang;Zhaojun Nan;Yuxuan Sun;Sheng Zhou;Zhisheng Niu","doi":"10.1109/JSAIT.2023.3329017","DOIUrl":"10.1109/JSAIT.2023.3329017","url":null,"abstract":"Intelligent real-time applications, such as video surveillance, demand intensive computation to extract status information from raw sensing data. This poses a substantial challenge in orchestrating computation and communication resources to provide fresh status information. In this paper, we consider a scenario where multiple energy-constrained devices served by an edge server. To extract status information, each device can either do the computation locally or offload it to the edge server. A scheduling policy is needed to determine when and where to compute for each device, taking into account communication and computation capabilities, as well as task-specific timeliness requirements. To that end, we first model the timeliness requirements as general penalty functions of Age of Information (AoI). A convex optimization problem is formulated to provide a lower bound of the minimum AoI penalty given system parameters. Using KKT conditions, we proposed a novel scheduling policy which evaluates status update priorities based on communication and computation delays and task-specific timeliness requirements. The proposed policy is applied to an object tracking application and carried out on a large video dataset. Simulation results show that our policy improves tracking accuracy compared with scheduling policies based on video content information.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"624-638"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134981772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Learning Invariant Representations Under General Interventions on the Response","authors":"Kang Du;Yu Xiang","doi":"10.1109/JSAIT.2023.3328651","DOIUrl":"10.1109/JSAIT.2023.3328651","url":null,"abstract":"It has become increasingly common nowadays to collect observations of feature and response pairs from different environments. As a consequence, one has to apply learned predictors to data with a different distribution due to distribution shifts. One principled approach is to adopt the structural causal models to describe training and test models, following the invariance principle which says that the conditional distribution of the response given its predictors remains the same across environments. However, this principle might be violated in practical settings when the response is intervened. A natural question is whether it is still possible to identify other forms of invariance to facilitate prediction in unseen environments. To shed light on this challenging scenario, we focus on linear structural causal models (SCMs) and introduce invariant matching property (IMP), an explicit relation to capture interventions through an additional feature, leading to an alternative form of invariance that enables a unified treatment of general interventions on the response as well as the predictors. We analyze the asymptotic generalization errors of our method under both the discrete and continuous environment settings, where the continuous case is handled by relating it to the semiparametric varying coefficient models. We present algorithms that show competitive performance compared to existing methods over various experimental settings including a COVID dataset.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"808-819"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134887604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Timely Multi-Process Estimation Over Erasure Channels With and Without Feedback: Signal-Independent Policies","authors":"Karim Banawan;Ahmed Arafa;Karim G. Seddik","doi":"10.1109/JSAIT.2023.3329431","DOIUrl":"10.1109/JSAIT.2023.3329431","url":null,"abstract":"We consider a multi-process remote estimation system observing \u0000<inline-formula> <tex-math>$K$ </tex-math></inline-formula>\u0000 independent Ornstein-Uhlenbeck processes. In this system, a shared sensor samples the \u0000<inline-formula> <tex-math>$K$ </tex-math></inline-formula>\u0000 processes in such a way that the long-term average sum mean square error (MSE) is minimized using signal-independent sampling policies, in which sampling instances are chosen independently from the processes’ values. The sensor operates under a total sampling frequency constraint \u0000<inline-formula> <tex-math>$f_{max }$ </tex-math></inline-formula>\u0000. The samples from all processes consume random processing delays in a shared queue and then are transmitted over an erasure channel with probability \u0000<inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>\u0000. We study two variants of the problem: first, when the samples are scheduled according to a Maximum-Age-First (MAF) policy, and the receiver provides an erasure status feedback; and second, when samples are scheduled according to a Round-Robin (RR) policy, when there is no erasure status feedback from the receiver. Aided by optimal structural results, we show that the optimal sampling policy for both settings, under some conditions, is a threshold policy. We characterize the optimal threshold and the corresponding optimal long-term average sum MSE as a function of \u0000<inline-formula> <tex-math>$K$ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$f_{max }$ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>\u0000, and the statistical properties of the observed processes. Our results show that, with an exponentially distributed service rate, the optimal threshold \u0000<inline-formula> <tex-math>$tau ^{ast}$ </tex-math></inline-formula>\u0000 increases as the number of processes \u0000<inline-formula> <tex-math>$K$ </tex-math></inline-formula>\u0000 increases, for both settings. Additionally, we show that the optimal threshold is an increasing function of \u0000<inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>\u0000 in the case of available erasure status feedback, while it exhibits the opposite behavior, i.e., \u0000<inline-formula> <tex-math>$tau ^{ast}$ </tex-math></inline-formula>\u0000 is a decreasing function of \u0000<inline-formula> <tex-math>$epsilon $ </tex-math></inline-formula>\u0000, in the case of absent erasure status feedback.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"607-623"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135362790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Partial Homoscedasticity in Causal Discovery With Linear Models","authors":"Jun Wu;Mathias Drton","doi":"10.1109/JSAIT.2023.3328476","DOIUrl":"10.1109/JSAIT.2023.3328476","url":null,"abstract":"Recursive linear structural equation models and the associated directed acyclic graphs (DAGs) play an important role in causal discovery. The classic identifiability result for this class of models states that when only observational data is available, each DAG can be identified only up to a Markov equivalence class. In contrast, recent work has shown that the DAG can be uniquely identified if the errors in the model are homoscedastic, i.e., all have the same variance. This equal variance assumption yields methods that, if appropriate, are highly scalable and also sheds light on fundamental information-theoretic limits and optimality in causal discovery. In this paper, we fill the gap that exists between the two previously considered cases, which assume the error variances to be either arbitrary or all equal. Specifically, we formulate a framework of partial homoscedasticity, in which the variables are partitioned into blocks and each block shares the same error variance. For any such groupwise equal variances assumption, we characterize when two DAGs give rise to identical Gaussian linear structural equation models. Furthermore, we show how the resulting distributional equivalence classes may be represented using a completed partially directed acyclic graph (CPDAG), and we give an algorithm to efficiently construct this CPDAG. In a simulation study, we demonstrate that greedy search provides an effective way to learn the CPDAG and exploit partial knowledge about homoscedasticity of errors in structural equation models.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"639-650"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10304270","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135360763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Online Energy Minimization Under a Peak Age of Information Constraint","authors":"Kumar Saurav;Rahul Vaze","doi":"10.1109/JSAIT.2023.3329034","DOIUrl":"https://doi.org/10.1109/JSAIT.2023.3329034","url":null,"abstract":"We consider a node where packets of fixed size (inbits) are generated at arbitrary intervals. The node is required to maintain the peak age of information (AoI) at the monitor below a threshold by transmitting potentially a subset of the generated packets. At any time, depending on the packet availability and the current AoI, the node can choose which packet to transmit, and at what transmission speed (in bits per second). Power consumption is a monotonically increasing convex function of the transmission speed. In this paper, for any given time horizon, the objective is to find a causal policy that minimizes the total energy consumption while satisfying the peak AoI constraint. We consider competitive ratio as the performance metric, that is defined as the ratio of the expected cost of a causal policy, and the expected cost of an optimal offline policy that knows the input (packet generation times) in advance. We first derive a lower bound on the competitive ratio of all causal policies, in terms of the system parameters (such as power function, packet size and peak AoI threshold), and then propose a particular policy for which we show that its competitive ratio has similar order of dependence on the system parameters as the derived lower bound.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"579-590"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Statistical Age-of-Information Bounds for Parallel Systems: When Do Independent Channels Make a Difference?","authors":"Markus Fidler;Jaya Prakash Champati;Joerg Widmer;Mahsa Noroozi","doi":"10.1109/JSAIT.2023.3328766","DOIUrl":"10.1109/JSAIT.2023.3328766","url":null,"abstract":"This paper contributes tail bounds of the age-of-information of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless access, or multi-path protocols, just to name a few. Typically, control over each communication channel is limited and random service outages and congestion cause buffering that impairs the age-of-information. The parallel use of independent channels promises a remedy, since outages on one channel may be compensated for by another. Surprisingly, for the well-known case of \u0000<inline-formula> <tex-math>$text{M}mid text{M}mid 1$ </tex-math></inline-formula>\u0000 queues we find the opposite: pooling capacity in one channel performs better than a parallel system with the same total capacity. A generalization is not possible since there are no solutions for other types of parallel queues at hand. In this work, we prove a dual representation of age-of-information in min-plus algebra that connects to queueing models known from the theory of effective bandwidth/capacity and the stochastic network calculus. Exploiting these methods, we derive tail bounds of the age-of-information of \u0000<inline-formula> <tex-math>$text{G}mid text{G}mid 1$ </tex-math></inline-formula>\u0000 queues. Tail bounds of the age-of-information of independent parallel queues follow readily. In addition to parallel classical queues, we investigate Markov channels where, depending on the memory of the channel, we show the true advantage of parallel systems. We continue to investigate this new finding and provide insight into when capacity should be pooled in one channel or when independent parallel channels perform better. We complement our analysis with simulation results and evaluate different update policies, scheduling policies, and the use of heterogeneous channels that is most relevant for latest multi-band networks.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"591-606"},"PeriodicalIF":0.0,"publicationDate":"2023-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10302220","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135262828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Learning Linear Gaussian Polytree Models With Interventions","authors":"Daniele Tramontano;L. Waldmann;M. Drton;Eliana Duarte","doi":"10.1109/JSAIT.2023.3328429","DOIUrl":"https://doi.org/10.1109/JSAIT.2023.3328429","url":null,"abstract":"We present a consistent and highly scalable local approach to learn the causal structure of a linear Gaussian polytree using data from interventional experiments with known intervention targets. Our methods first learn the skeleton of the polytree and then orient its edges. The output is a CPDAG representing the interventional equivalence class of the polytree of the true underlying distribution. The skeleton and orientation recovery procedures we use rely on second order statistics and low-dimensional marginal distributions. We assess the performance of our methods under different scenarios in synthetic data sets and apply our algorithm to learn a polytree in a gene expression interventional data set. Our simulation studies demonstrate that our approach is fast, has good accuracy in terms of structural Hamming distance, and handles problems with thousands of nodes.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"569-578"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134795150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}