PulseAugur
中
实时 10:39:01
English(EN) No-Regret Mixing of LRU and LFU with Optimal Switching Cost

新的H-MC缓存策略为LRU/LFU提供了改进的悔恨保证

作者 PulseAugur 编辑部 · [1 个来源] ·

研究人员开发了一种名为H-MC的新缓存策略，旨在改进现有的LRU和LFU等方法。与可能在某些请求序列中遭受线性悔恨的LeCar和Cacheus等先前策略不同，H-MC旨在实现亚线性悔恨。这是通过使用基于Hedge的虚拟LRU和LFU缓存混合来实现的，该方法在保持最优悔恨保证的同时最大限度地减少了切换成本。 AI

影响 这项研究可能导致依赖缓存的系统中更高效的数据检索，并可能影响需要频繁访问大型数据集的AI模型训练和推理。

排序理由 该条目是一篇学术论文，详细介绍了一种新的缓存策略算法。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新的H-MC缓存策略为LRU/LFU提供了改进的悔恨保证

本文如何被排名

Signal score
4 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该条目是一篇学术论文，详细介绍了一种新的缓存策略算法。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Standard
On-topic for AI-industry coverage; kept in the public index.
Story freshness
Same-day
Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Younes Ben Mazziane, Xinying Zou ·

    LRU与LFU的无悔混合及最优切换成本

    arXiv:2609.07566v1 Announce Type: new Abstract: 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…

相关实体

相关话题