5 papers
E-Graphs as a Persistent Compiler Abstraction
Jules Merckx, Alexandre Lopoukhine, Samuel Coward +3
Recent algorithmic advances have made equality saturation an appealing technique for program optimization, avoiding the phase-ordering problem by separating the discovery of equiva…
Déjà Q: Open-Ended Evolution of Diverse, Learnable and Verifiable Problems
Willem Röpke, Samuel Coward, Andrei Lupu +3
Recent advances in reasoning models have yielded impressive results in mathematics and coding. However, most approaches rely on static datasets, which have been suggested to encour…
eqsat: An Equality Saturation Dialect for Non-destructive Rewriting
Jules Merckx, Alexandre Lopoukhine, Samuel Coward +3
With recent algorithmic improvements and easy-to-use libraries, equality saturation is being picked up for hardware design, program synthesis, theorem proving, program optimization…
BALROG: Benchmarking Agentic LLM and VLM Reasoning On Games
Davide Paglieri, BartÅomiej CupiaÅ, Samuel Coward +10
Large Language Models (LLMs) and Vision Language Models (VLMs) possess extensive knowledge and exhibit promising reasoning abilities, however, they still struggle to perform well i…
ReducedLUT: Table Decomposition with "Don't Care" Conditions
Oliver Cassidy, Marta Andronic, Samuel Coward +1
Lookup tables (LUTs) are frequently used to efficiently store arrays of precomputed values for complex mathematical computations. When used in the context of neural networks, these…