arXiv (All)
open access
No-Regret Mixing of LRU and LFU with Optimal Switching Cost
Caching systems often rely on simple eviction policies such as Least Recently Used (LRU) and Least Frequently Used (LFU), which perform well in complementary request regimes. Recent policies such as LeCar and Cacheus combine LRU and LFU using ideas from the experts problem in online learning. Specif
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Pooling and Drift in Delayed Bandits#974613
- Cool the Sampler, Not the Learner: Sampling Temperature Moves the Staleness Cliff of Importance-Corrected GRPO#1132154
- Look Before You Select: Rethinking Vocabulary Sparsification in On-Policy Distillation#1128658
- Collaboration and competition on a wiki: The praxis of online social learning to improve academic writing and research in under-graduate students#989191
- Internet Exchanges for Used Books: An Empirical Analysis of Product Cannibalization and Welfare Impact#942826
Record · ID 984479
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive