Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Towards Optimal Robustness in Learning-Augmented Paging
Peng Chen, Hailiang Zhao, Xueyan Tang +2
Learning-augmented paging has been extensively studied in recent years. A key advantage over naive ML-based approaches is \emph{bounded robustness}, which guarantees worst-case per…
cs.DS2025
Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
Peng Chen, Hailiang Zhao, Jiaji Zhang +3
The online caching problem aims to minimize cache misses when serving a sequence of requests under a limited cache size. While naive learning-augmented caching algorithms achieve i…