arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.09687cs.DScs.LG
收藏

鲁棒的学习增强字典

Robust Learning-Augmented Dictionaries

University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);York University(约克大学)

Ali Zeynali, Shahin Kamali, Mohammad Hajiesmaili

AI总结:

提出了首个学习增强字典数据结构RobustSL,通过预测元素访问频率增强跳表,在保持最优一致性的同时确保对抗预测下的最优鲁棒性,并在合成与真实数据集上表现优于替代方案。

摘要:

我们提出了首个实现字典的学习增强数据结构,具有最优的一致性和鲁棒性。我们的数据结构名为RobustSL,是一种通过预测数据序列中元素访问频率来增强的跳表。在适当的预测下,RobustSL具有最优一致性(实现静态最优性)。同时,即使预测是对抗性生成的,它也保持每个操作的对数运行时间,确保最优鲁棒性。因此,RobustSL具备Lin、Luo和Woodruff(ICML 2022)以及Cao等人(arXiv 2023)近期学习增强数据结构的所有优势,同时提供了以往工作所缺乏的鲁棒性保证。数值实验表明,RobustSL在使用合成和真实数据集时均优于替代数据结构。

英文摘要:

We present the first learning-augmented data structure for implementing dictionaries with optimal consistency and robustness. Our data structure, named RobustSL, is a skip list augmented by predictions of access frequencies of elements in a data sequence. With proper predictions, RobustSL has optimal consistency (achieves static optimality). At the same time, it maintains a logarithmic running time for each operation, ensuring optimal robustness, even if predictions are generated adversarially. Therefore, RobustSL has all the advantages of the recent learning-augmented data structures of Lin, Luo, and Woodruff (ICML 2022) and Cao et al. (arXiv 2023), while providing robustness guarantees that are absent in the previous work. Numerical experiments show that RobustSL outperforms alternative data structures using both synthetic and real datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑