Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning 事件

Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning arXiv:2605.15236v2 Announce Type: replace-cross Abstract: In the coded caching, the server uses the cached information at the users to serve multiple users in parallel with a single coded multi-casting message or packet, that is, a merged packet, and thus mitigates the peak network congestion. In order to deliver the timely messages to the users in the deadline-driven applications like the v