Metraipolis › archive › dc_b079d6dede96

Minimizing Age of Incorrect Information in Pull-Based Remote Estimation of a Markov Source — arXiv:2610.22265

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22265
License (as archived)
CC0-1.0
Archived
2026-10-16T10:25:33.233Z
SHA-256 of the archived text
ae81abcb2dfe885761484c927a8a84ddec276b4153e284051772cd0047daf110
Stable URL of this page
https://metraipolis.com/documento/dc_b079d6dede96

How to cite

Minimizing Age of Incorrect Information in Pull-Based Remote Estimation of a Markov Source — arXiv:2610.22265 — arXiv (en), https://arxiv.org/abs/2610.22265 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b079d6dede96 (Metraipolis archive dc_b079d6dede96, sha256 ae81abcb2dfe885761484c927a8a84ddec276b4153e284051772cd0047daf110)
BibTeX
@misc{dcb079d6dede96,
  title = {Minimizing Age of Incorrect Information in Pull-Based Remote Estimation of a Markov Source — arXiv:2610.22265},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22265},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b079d6dede96; sha256 ae81abcb2dfe885761484c927a8a84ddec276b4153e284051772cd0047daf110},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22265. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we consider a discrete-time pull-based remote estimation system involving an information source and a remote monitor where the information source is a finite-state irreducible discrete-time Markov chain (DTMC) process. In this system, the remote monitor sends a pull request towards the source which responds by sampling its process so as to transmit the sampled values towards the monitor through a delay channel, encapsulated in information packets. We consider i) zero delay (ZD) and ii) unit delay (UD) channels, where the packet transmission times are zero and one slot, respectively. For remote estimation, we use the maximum a posteriori (MAP) estimator, and for quantifying its performance, we use the mean age of incorrect information (MAoII) which is a recently proposed freshness and mismatch metric that penalizes an incorrect estimation along with its duration. Our goal is to obtain pull policies so as to minimize MAoII under a long-run sampling rate constraint. For the ZD model, we propose a semi-Markov decision process (SMDP) formulation of the problem, which allows us to find the optimum observation-dependent pull policy. On the other hand, the UD channel prevents the monitor from possessing perfect information on the actual AoII process at any given time, and the SMDP formulation of the ZD channel cannot readily be used for the UD model. For the system with the UD channel, we first provide a numerical algorithm to calculate the MAoII and the average sampling rate for a given observation-dependent pull policy. For the optimization of the underlying remote estimation system, we use the joint distribution of the age and source processes to be obtained from the history of all observations, termed as belief. Subsequently, we propose a belief-dependent policy obtained via the belief-MDP formulation and a constrained deep reinforcement learning (CDRL) algorithm.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.NI, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Networking and Internet Architecture (cs.NI); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.22265 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:48:32.660Z dalla pagina https://arxiv.org/list/cs.NI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).