pith. sign in

arxiv: 2501.17473 · v2 · pith:W3VPILABnew · submitted 2025-01-29 · 💻 cs.IT · cs.SY· eess.SY· math.IT

Remote State Estimation over a Wearing Channel: Information Freshness vs. Channel Aging

Jiping Luo , George Stamatakis , Osvaldo Simeone , Nikolaos Pappas This is my paper

Pith reviewed 2026-05-23 05:22 UTC · model grok-4.3

classification 💻 cs.IT cs.SYeess.SYmath.IT
keywords remote state estimationwearing channelinformation freshnesschannel agingsemi-Markov decision processmonotonic policystructure-aware optimization
0
0 comments X

The pith

The optimal policy for remote estimation over a wearing channel is monotonic in its state variables.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper addresses the tradeoff in remote state estimation of a linear Gaussian system where the communication channel degrades with each transmission. The sensor must choose to send a fresh measurement, restore the channel at the cost of downtime, or stay silent, and the goal is to time these actions optimally. The authors formulate the problem as a semi-Markov decision process and prove that the optimal policy possesses monotonicity properties, which in turn support structure-aware computational methods. A reader would care because the approach turns an otherwise intractable timing problem into one that can be solved by exploiting its natural ordering.

Core claim

Remote estimation of a linear Gaussian process over a channel that wears out with use is modeled as a semi-Markov decision process; the optimal policy for choosing transmission, restoration, or silence is shown to be monotonic, enabling structure-aware solution algorithms.

What carries the argument

Semi-Markov decision process (SMDP) whose value function and policy are proved monotonic in the joint state of estimation error and channel quality.

If this is right

  • The monotonicity allows replacement of exhaustive search by threshold-based or ordered search algorithms.
  • The policy can be computed once and then deployed by simple state comparisons at each decision epoch.
  • Restoration intervals become longer as channel age increases, while transmission intervals shorten as estimation error grows.
  • The same SMDP structure directly yields performance bounds on estimation error versus channel lifetime.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The monotonicity result may extend to other Markovian degradation processes beyond the linear-Gaussian case examined here.
  • Similar structure could appear in problems that trade measurement freshness against energy or hardware lifetime.
  • One could test the policy by embedding the derived thresholds in a real wireless testbed and measuring long-term estimation MSE against channel replacement cost.

Load-bearing premise

The combined state of channel degradation and linear Gaussian dynamics admits a finite or tractable discrete representation.

What would settle it

A concrete counter-example or numerical instance in which the computed optimal policy violates monotonicity with respect to estimation error or channel age.

Figures

Figures reproduced from arXiv: 2501.17473 by George Stamatakis, Jiping Luo, Nikolaos Pappas, Osvaldo Simeone.

Figure 1
Figure 1. Figure 1: The remote estimation system with a wearing channel. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An illustration of different timelines and the evolution of the age processes, where ‘I’, ‘T’, and ‘R’ stand for idle, transmit, and renewal actions, [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: State transitions induced by the transmit-always policy [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The threshold structure of the optimal policy [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The structure of the optimal policy under different values of [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Counterexamples on the monotonicity of optimal policies when [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
read the original abstract

We study the remote estimation of a linear Gaussian system over a channel that wears out over time and with every use. The sensor can either transmit a fresh measurement in the current time slot, restore the channel quality at the cost of downtime, or remain silent. Frequent transmissions yield accurate estimates but incur significant wear on the channel. Renewing the channel too often improves channel conditions but results in poor estimation quality. What is the optimal timing to transmit measurements and restore the channel? This problem is formulated as a semi-Markov decision process (SMDP). We establish monotonicity properties of the optimal policy and propose structure-aware solution methods.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper studies remote estimation of a linear Gaussian system over a channel that degrades with time and use. The sensor chooses among transmitting a fresh measurement, restoring channel quality (with downtime), or remaining silent. The problem is cast as a semi-Markov decision process (SMDP); monotonicity properties of the optimal policy are claimed, and structure-aware solution methods are proposed.

Significance. If the SMDP formulation is valid and the monotonicity results hold with a tractable state representation, the work would provide a structured approach to balancing information freshness against channel aging in remote estimation, with potential applicability to wireless sensor networks. The structure-aware methods could reduce computational burden relative to unstructured MDP solvers.

major comments (2)
  1. [Abstract] Abstract and formulation section: the SMDP claim and monotonicity proofs rest on the joint state (estimation error covariance from the Riccati recursion plus channel age) admitting a finite or stochastically ordered representation. The linear-Gaussian dynamics produce a continuous covariance trajectory; without an explicit discretization step, continuous-state extension, or proof that the required submodularity/stochastic dominance still holds, standard SMDP monotonicity arguments do not apply directly.
  2. [Abstract] Abstract: no derivations, proofs, or numerical validation are supplied for the monotonicity properties or the structure-aware algorithms. The central claims therefore cannot be assessed for correctness beyond the high-level statement.
minor comments (2)
  1. [Abstract] The abstract uses the term 'wearing channel' without a precise mathematical definition of the degradation process (e.g., whether age is discrete or continuous, how 'use' increments wear).
  2. Notation for the action set (transmit, restore, silent) and the semi-Markov transition kernel should be introduced explicitly in the problem formulation.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on the manuscript. We address the major comments point by point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract and formulation section: the SMDP claim and monotonicity proofs rest on the joint state (estimation error covariance from the Riccati recursion plus channel age) admitting a finite or stochastically ordered representation. The linear-Gaussian dynamics produce a continuous covariance trajectory; without an explicit discretization step, continuous-state extension, or proof that the required submodularity/stochastic dominance still holds, standard SMDP monotonicity arguments do not apply directly.

    Authors: We agree that the continuous trajectory of the error covariance under the Riccati recursion creates a technical obstacle for directly invoking standard discrete-state SMDP monotonicity results. The current manuscript does not contain an explicit discretization procedure or a self-contained proof that submodularity and stochastic dominance are preserved in the continuous setting. In the revision we will either introduce a finite discretization of the covariance component that preserves the required ordering properties or supply a direct argument establishing monotonicity for the continuous-state SMDP. revision: yes

  2. Referee: [Abstract] Abstract: no derivations, proofs, or numerical validation are supplied for the monotonicity properties or the structure-aware algorithms. The central claims therefore cannot be assessed for correctness beyond the high-level statement.

    Authors: The referee correctly observes that the abstract states the monotonicity results and structure-aware methods at a high level only. The manuscript as reviewed does not include the detailed derivations, proofs, or numerical experiments needed to verify these claims. We will expand the revised version with complete proofs of the monotonicity properties together with numerical validation of the structure-aware solution methods. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper formulates the remote estimation problem over a wearing channel as an SMDP and states that monotonicity properties of the optimal policy are established, with structure-aware solution methods proposed. No equations, parameter fits, self-citations, or ansatzes are visible in the provided text that would reduce any claimed prediction or result to an input by construction. The derivation chain relies on standard SMDP modeling of the combined estimation error and channel state, which is presented as an independent application rather than a self-referential loop or renamed empirical pattern. This is the most common honest finding for papers whose central claims rest on formulation and proof techniques without visible reduction to fitted quantities or author-overlapping citations.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on two domain assumptions stated in the abstract: the system is linear Gaussian and the channel degrades with time and use. No free parameters or invented entities are identifiable from the abstract.

axioms (2)
  • domain assumption The remote estimation system is linear Gaussian.
    Explicitly stated in the abstract as the system under study.
  • domain assumption The channel wears out over time and with every use.
    Core modeling premise that defines the tradeoff and enables the SMDP formulation.

pith-pipeline@v0.9.0 · 5647 in / 1076 out tokens · 39867 ms · 2026-05-23T05:22:51.514382+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages

  1. [1]

    Wireless network design for control systems: A survey,

    P. Park, S. Coleri Ergen, C. Fischione, C. Lu, and K. H. Johansson, “Wireless network design for control systems: A survey,” IEEE Com- mun. Surveys Tuts., vol. 20, no. 2, pp. 978–1013, 2018

    work page 2018

  2. [2]

    Foundations of control and estimation over lossy networks,

    L. Schenato, B. Sinopoli, M. Franceschetti, K. Poolla, and S. S. Sastry, “Foundations of control and estimation over lossy networks,” Proc. IEEE, vol. 95, no. 1, pp. 163–187, 2007

    work page 2007

  3. [3]

    Optimal estimation in networked control systems subject to random delay and packet drop,

    L. Schenato, “Optimal estimation in networked control systems subject to random delay and packet drop,” IEEE Trans. Autom. Control, vol. 53, no. 5, pp. 1311–1317, 2008

    work page 2008

  4. [4]

    Sensor data scheduling for optimal state estimation with communication energy constraint,

    L. Shi, P. Cheng, and J. Chen, “Sensor data scheduling for optimal state estimation with communication energy constraint,” Automatica, vol. 47, no. 8, pp. 1693–1698, 2011

    work page 2011

  5. [5]

    Sensor scheduling in variance based event triggered estimation with packet drops,

    A. S. Leong, S. Dey, and D. E. Quevedo, “Sensor scheduling in variance based event triggered estimation with packet drops,”IEEE Trans. Autom. Control, vol. 62, no. 4, pp. 1880–1895, 2017

    work page 2017

  6. [6]

    Learning optimal scheduling policy for remote state estimation under uncertain channel condition,

    S. Wu, X. Ren, Q.-S. Jia, K. H. Johansson, and L. Shi, “Learning optimal scheduling policy for remote state estimation under uncertain channel condition,” IEEE Trans. Control Netw. Syst., vol. 7, no. 2, pp. 579–591, 2020

    work page 2020

  7. [7]

    Stability of kalman filtering with markovian packet losses,

    M. Huang and S. Dey, “Stability of kalman filtering with markovian packet losses,” Automatica, vol. 43, no. 4, pp. 598–607, 2007

    work page 2007

  8. [8]

    Remote state estimation with smart sensors over markov fading channels,

    W. Liu, D. E. Quevedo, Y . Li, K. H. Johansson, and B. Vucetic, “Remote state estimation with smart sensors over markov fading channels,” IEEE Trans. Autom. Control, vol. 67, no. 6, pp. 2743–2757, 2022

    work page 2022

  9. [9]

    Metaplasticity: the plasticity of synaptic plasticity,

    W. C. Abraham and M. F. Bear, “Metaplasticity: the plasticity of synaptic plasticity,” Trends in neurosciences, vol. 19, no. 4, pp. 126–130, 1996

    work page 1996

  10. [10]

    Quantum decoherence,

    M. Schlosshauer, “Quantum decoherence,” Physics Reports , vol. 831, pp. 1–57, 2019

    work page 2019

  11. [11]

    On the throughput of channels that wear out,

    T.-Y . Wu, L. R. Varshney, and V . Y . F. Tan, “On the throughput of channels that wear out,” IEEE Trans. Commun., vol. 67, no. 8, pp. 5311– 5320, 2019

    work page 2019

  12. [12]

    Real-time status: How often should one update?

    S. Kaul, R. Yates, and M. Gruteser, “Real-time status: How often should one update?” in Proc. IEEE Int. Conf. Comput. Commun. , 2012, pp. 2731–2735

    work page 2012

  13. [13]

    Optimal sampling and scheduling for timely status updates in multi-source networks,

    A. M. Bedewy, Y . Sun, S. Kompella, and N. B. Shroff, “Optimal sampling and scheduling for timely status updates in multi-source networks,”IEEE Trans. Inf. Theory, vol. 67, no. 6, pp. 4019–4034, 2021

    work page 2021

  14. [14]

    A whittle index approach to minimizing functions of age of information,

    V . Tripathi and E. Modiano, “A whittle index approach to minimizing functions of age of information,” IEEE/ACM Trans. Netw. , pp. 1–15, 2024

    work page 2024

  15. [15]

    Age of information: An introduction and survey,

    R. D. Yates, Y . Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, “Age of information: An introduction and survey,” IEEE J. Sel. Areas Commun. , vol. 39, no. 5, pp. 1183–1210, 2021

    work page 2021

  16. [16]

    Exploiting data significance in remote estimation of discrete-state markov sources,

    J. Luo and N. Pappas, “Exploiting data significance in remote estimation of discrete-state markov sources,” arXiv:2406.18270, 2024

    work page arXiv 2024

  17. [17]

    On the cost of consecutive estimation error: Significance-aware non-linear aging,

    ——, “On the cost of consecutive estimation error: Significance-aware non-linear aging,” arXiv:2410.03637, 2024

    work page arXiv 2024

  18. [18]

    Optimizing information freshness over a channel that wears out,

    G. J. Stamatakis, O. Simeone, and N. Pappas, “Optimizing information freshness over a channel that wears out,” in Proc. Asilomar Conf. Signals, Syst. Comput. , 2023, pp. 85–89

    work page 2023

  19. [19]

    B. D. O. Anderson and J. B. Moore, Optimal Filtering. Prentice Hall, 1979

    work page 1979

  20. [20]

    M. L. Puterman, Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons, 1994

    work page 1994

  21. [21]

    Hern ´andez-Lerma and J

    O. Hern ´andez-Lerma and J. B. Lasserre, Discrete-time Markov control processes: basic optimality criteria . Springer Science & Business Media, 1996, vol. 30

    work page 1996