重写系统对决:随机搜索 vs. 等式饱和
Rewrite System Showdown: Stochastic Search vs. EqSat
AI总结:
本文通过五个基准测试比较等式饱和与随机搜索在等式程序优化中的性能,以评估e-graphs的实际效果。
摘要:
等式饱和已成为等式程序优化的主导范式。然而,尽管存在多种解决同一问题的方法,其中最著名的是随机搜索,但从未有过严格的比较。在本文中,我们通过五个基准测试将等式饱和与随机搜索进行比较,以回答以下问题:e-graphs 真的好吗?
英文摘要:
Equality saturation has become a dominant paradigm for equational program optimization. However, it has never been rigorously compared to another approach to the same problem, even though several exist, the most notable being stochastic search. In this paper, we compare equality saturation to stochastic search over five benchmarks to answer the question: are e-graphs actually good?
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。