all AI news
MCTS-GEB: Monte Carlo Tree Search is a Good E-graph Builder. (arXiv:2303.04651v2 [cs.AI] UPDATED)
cs.LG updates on arXiv.org arxiv.org
Rewrite systems [6, 10, 12] have been widely employing equality saturation
[9], which is an optimisation methodology that uses a saturated e-graph to
represent all possible sequences of rewrite simultaneously, and then extracts
the optimal one. As such, optimal results can be achieved by avoiding the
phase-ordering problem. However, we observe that when the e-graph is not
saturated, it cannot represent all possible rewrite opportunities and therefore
the phase-ordering problem is re-introduced during the construction phase of
the e-graph. To …
arxiv construction equality good graph methodology observe optimisation search systems tree