New framework for learning-augmented paging achieves robustness of H_k + O(1), closing the gap to the optimal competitive ratio up to an additive constant.
Let Mtotal(ω) denote the total miss probability mass over unrevealed pages
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Optimal Robustness in Learning-Augmented Paging
New framework for learning-augmented paging achieves robustness of H_k + O(1), closing the gap to the optimal competitive ratio up to an additive constant.