mlsanityData to 14 Oct 2026

Joint Age-State Belief is All You Need: Minimizing AoII via Pull-Based Remote Estimation

arXiv 2411.07179 ↗First posted 11 Nov 2024cs.IT cs.LG cs.NIcited by 0

Not on the map. Why?

Abstract (arXiv)

Age of incorrect information (AoII) is a recently proposed freshness and mismatch metric that penalizes an incorrect estimation along with its duration. Therefore, keeping track of AoII requires the knowledge of both the source and estimation processes. In this paper, we consider a time-slotted pull-based remote estimation system under a sampling rate constraint where the information source is a general discrete-time Markov chain (DTMC) process. Moreover, packet transmission times from the source to the monitor are non-zero which disallows the monitor to have perfect information on the actual AoII process at any time. Hence, for this pull-based system, we propose the monitor to maintain a sufficient statistic called em belief which stands for the joint distribution of the age and source processes to be obtained from the history of all observations. Using belief, we first propose a maximum a posteriori (MAP) estimator to be used at the monitor as opposed to existing martingale estimators in the literature. Second, we obtain the optimality equations from the belief-MDP (Markov decision process) formulation. Finally, we propose two belief-dependent policies one of which is based on deep reinforcement learning, and the other one is a threshold-based policy based on the instantaneous expected AoII.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 29 references that are in the map. First posted on arXiv 11 Nov 2024.

Builds on

11 of 29 references.

References · 11

  1. 2017A Brief Survey of Deep Reinforcement Learningcited by 483
  2. 2022Semantics-Empowered Communication: A Tutorial-cum-Surveycited by 8
  3. 2020Partially Observable Minimum-Age Scheduling: The Greedy Policycited by 5
  4. 2021Indexability and Rollout Policy for Multi-State Partially Observable Restless Banditscited by 2
  5. 2020Age-of-Information-based Scheduling in Multiuser Uplinks with Stochastic Arrivals: A POMDP Approachcited by 1
  6. 2023Status Updating under Partial Battery Knowledge in Energy Harvesting IoT Networkscited by 1
  7. 2023Query-Based Sampling of Heterogeneous CTMCs: Modeling and Optimization with Binary Freshnesscited by 1
  8. 2023Collaborative Optimization of the Age of Information under Partial Observabilitycited by 1
  9. 2024Modeling AoII in Push- and Pull-Based Sampling of Continuous Time Markov Chainscited by 1
  10. 2024AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraintscited by 1
  11. 2024Multi-Threshold AoII-Optimum Sampling Policies for CTMC Information Sourcescited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025On the Role of Age and Semantics of Information in Remote Estimation of Markov Sources ↗
  2. 2025Equidistant-Sample or Wait-and-Sample to Minimize Age Under Sampling Constraint? ↗
  3. 2026Age of Incorrect Information for Generic Discrete-Time Markov Sources ↗
  4. 2025Which Sensor to Observe? Timely Tracking of a Joint Markov Source with Model Predictive Control ↗
  5. 2024The Best Time for an Update: Risk-Sensitive Minimization of Age-Based Metrics
  6. 2026Joint Freshness and Age-Dispersion Control over Finite-State Markov Wireless Channels ↗
  7. 2024Semantic-Aware Remote Estimation of Multiple Markov Sources Under Constraints
  8. 2025Jointly Optimal Policies for Remote Estimation of Autoregressive Markov Processes over Time-Correlated Fading Channel ↗