SmoothE Wins the ASPLOS 2025 Best Paper Award
ASPLOS 2025 Best Paper Award plaque.

SmoothE Wins the ASPLOS 2025 Best Paper Award

SmoothE: Differentiable E-Graph Extration wins the Best Paper Award at the 2025 ACM International Conference on Architectural Support for Programming Languages and Operating Systems!

We are thrilled to receive the Best Paper Award at the ACM International Conference on Architectural Support for Programming Languages and Operating Systems 2025 for our work on SmoothE: Differentiable E-Graph Extration . E-Graphs have gained increased popularity, but current e-graph extraction methods often face unfavorable scalability-quality trade-offs and only support simple linear cost functions. In this work, we propose SmoothE, a differentiable e-graph extraction algorithm designed to handle complex cost models and optimized for GPU acceleration. This work was done by Yaohui Cai, Kaixin Yang, Chenhui Deng, and Zhiru Zhang, also in collaboration with Cunxi Yu from the University of Maryland, College Park.

Congrats to all the authors!

Read the paper.