Collaborative Optimization of the Age of Information under Partial Observability

• URL: http://arxiv.org/abs/2312.12977v1
• Date: Wed, 20 Dec 2023 12:34:54 GMT
• Title: Collaborative Optimization of the Age of Information under Partial Observability
• Authors: Anam Tahir, Kai Cui, Bastian Alt, Amr Rizk, Heinz Koeppl
• Abstract summary: Age of Information (AoI) is the freshness of sensor and control data at the receiver side. We devise a decentralized AoI-minimizing transmission policy for a number of sensor agents sharing capacity-limited, non-FIFO duplex channels. We also leverage mean-field control approximations and reinforcement learning to derive scalable and optimal solutions.
• Score: 34.43476648472727
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The significance of the freshness of sensor and control data at the receiver side, often referred to as Age of Information (AoI), is fundamentally constrained by contention for limited network resources. Evidently, network congestion is detrimental for AoI, where this congestion is partly self-induced by the sensor transmission process in addition to the contention from other transmitting sensors. In this work, we devise a decentralized AoI-minimizing transmission policy for a number of sensor agents sharing capacity-limited, non-FIFO duplex channels that introduce random delays in communication with a common receiver. By implementing the same policy, however with no explicit inter-agent communication, the agents minimize the expected AoI in this partially observable system. We cater to the partial observability due to random channel delays by designing a bootstrap particle filter that independently maintains a belief over the AoI of each agent. We also leverage mean-field control approximations and reinforcement learning to derive scalable and optimal solutions for minimizing the expected AoI collaboratively.

Related papers

• Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks [59.43433767253956]
  We consider the problem of privately estimating the mean of vectors distributed across different nodes of an unreliable wireless network. In a semi-decentralized setup, nodes can collaborate with their neighbors to compute a local consensus, which they relay to a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the data sharing among nodes.
  arXiv  Detail & Related papers  (2024-06-06T06:12:15Z)
• Cooperative Probabilistic Trajectory Forecasting under Occlusion [110.4960878651584]
  Occlusion-aware planning often requires communicating the information of the occluded object to the ego agent for safe navigation. In this paper, we design an end-to-end network that cooperatively estimates the current states of occluded pedestrian in the reference frame of ego agent. We show that the uncertainty-aware trajectory prediction of occluded pedestrian by the ego agent is almost similar to the ground truth trajectory assuming no occlusion.
  arXiv  Detail & Related papers  (2023-12-06T05:36:52Z)
• Compressed Regression over Adaptive Networks [58.79251288443156]
  We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem. We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
  arXiv  Detail & Related papers  (2023-04-07T13:41:08Z)
• Over-the-Air Federated Learning with Privacy Protection via Correlated Additive Perturbations [57.20885629270732]
  We consider privacy aspects of wireless federated learning with Over-the-Air (OtA) transmission of gradient updates from multiple users/agents to an edge server. Traditional perturbation-based methods provide privacy protection while sacrificing the training accuracy. In this work, we aim at minimizing privacy leakage to the adversary and the degradation of model accuracy at the edge server.
  arXiv  Detail & Related papers  (2022-10-05T13:13:35Z)
• Cooperative Actor-Critic via TD Error Aggregation [12.211031907519827]
  We introduce a decentralized actor-critic algorithm with TD error aggregation that does not violate privacy issues. We provide a convergence analysis under diminishing step size to verify that the agents maximize the team-average objective function.
  arXiv  Detail & Related papers  (2022-07-25T21:10:39Z)
• Federated Learning with Correlated Data: Taming the Tail for Age-Optimal Industrial IoT [55.62157530259969]
  We study a sensor's transmit power minimization subject to the peak-AoI requirement and a probabilistic constraint on queuing latency. We propose a local-model selection approach which accounts for correlation among the sensor's training data. Numerical results show the tradeoff between the transmit power, peak AoI, and delay's tail distribution.
  arXiv  Detail & Related papers  (2021-08-17T08:38:31Z)
• Wireless Federated Learning with Limited Communication and Differential Privacy [21.328507360172203]
  This paper investigates the role of dimensionality reduction in efficient communication and differential privacy (DP) of the local datasets at the remote users for over-the-air computation (AirComp)-based federated learning (FL) model.
  arXiv  Detail & Related papers  (2021-06-01T15:23:12Z)
• Gaussian Process Based Message Filtering for Robust Multi-Agent Cooperation in the Presence of Adversarial Communication [5.161531917413708]
  We consider the problem of providing robustness to adversarial communication in multi-agent systems. We propose a communication architecture based on Graph Neural Networks (GNNs) We show that our filtering method is able to reduce the impact that non-cooperative agents cause.
  arXiv  Detail & Related papers  (2020-12-01T14:21:58Z)
• Distributed Inference with Sparse and Quantized Communication [7.155594644943642]
  We consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state. We develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just $1$ bit to encode its belief on each hypothesis.
  arXiv  Detail & Related papers  (2020-04-02T23:08:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.