Learning Selective Merge Policies for Deadline-Constrained Coded Caching via Deep Reinforcement Learning
arXiv 2605.15236•2c059b701e5372af494f4063a902008a539072e144e34915a99085d71b395b3f
CSIGaussian mixtureKatona two-roundMPR channelsMarkov sourcesMonadPrismQuantRandom Linear Network CodingSolanaactuation error analysisarXivblockchain broadcastingcoded cachingdeep reinforcement learninggraph attentiongroup testingmulti-packet receptionpeer-Turbopeer-to-peer broadcastingproximal policy optimizationquantizationrate-distortionreal-time reconstructionstatistical searchtransform coding
Paper metadata
- arXiv ID
- 2605.15236
- Version
- Not specified by this published record
- Category
- Mathematics — Information Theory (math.IT)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 2c059b701e5372af494f4063a902008a539072e144e34915a99085d71b395b3f
- Enrichment time
- 2026-05-18T08:51:42Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.