论文标题
部分更新：丢失新鲜信息
Partial Updates: Losing Information for Freshness
论文作者
论文摘要
我们考虑了一个信息更新系统，其中源可根据发射器的要求产生更新。发射器进一步处理这些更新，以生成$ partial $ $ $更新$，与原始更新相比，这些信息的信息较小，将发送给接收器。我们研究产生部分更新并找到相应的实价编码长的问题，以最大程度地减少接收器所经历的平均年龄，同时保持原始更新和部分更新之间所需的互信息。这个问题很难。我们放松问题并开发一种基于最小化的迭代算法，该算法为部分更新生成PMF，并为每个更新提供相应的年龄实现的现实价值码字。我们观察到，所达到的平均年龄与原始更新和部分更新之间的相互信息之间存在权衡。
We consider an information updating system where a source produces updates as requested by a transmitter. The transmitter further processes these updates in order to generate $partial$ $updates$, which have smaller information compared to the original updates, to be sent to a receiver. We study the problem of generating partial updates, and finding their corresponding real-valued codeword lengths, in order to minimize the average age experienced by the receiver, while maintaining a desired level of mutual information between the original and partial updates. This problem is NP hard. We relax the problem and develop an alternating minimization based iterative algorithm that generates a pmf for the partial updates, and the corresponding age-optimal real-valued codeword length for each update. We observe that there is a tradeoff between the attained average age and the mutual information between the original and partial updates.
