REVIEW 1 cited by
Minimizing Age of Information with Soft Updates
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but $instantaneously$ in both cases, here updates start taking effect right away but $gradually$ over time. We coin this setting $soft$ $updates$. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of age is proportional to the current age, and in the second model, the rate of decrease of age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and optimum durations of the updates, subject to the constraints on the number of update periods and the total update duration.
Forward citations
Cited by 1 Pith paper
-
A Reinforcement Learning Framework for Optimizing Age-of-Information in RF-powered Communication Systems
For RF-powered multi-source monitoring systems, the age-optimal sampling policy is threshold-based in each process's age, and a deep Q-network can learn it efficiently.
Discussion (0). Continue with ORCID to comment.