🚀NEW LABGetting Started with Claude AgentsStart lab
Reasoning

Boolformer

First page
Boolformer
Paper summary

The first Transformer trained to perform end-to-end symbolic regression of Boolean functions.

Ask this paper

Key points
01

End-to-end symbolic regression: Directly predicts compact Boolean formulas from input-output examples, skipping the typical search-over-programs loop of symbolic regression.

02

Handles complex functions: Produces compact formulas for complex Boolean functions that traditional symbolic-regression methods struggle to compress.

03

Gene regulatory networks: Applied to modeling the dynamics of gene regulatory networks, providing a concrete real-world application beyond synthetic benchmarks.

04

Transformer-as-symbolic-learner: Extends the "Transformer as symbolic regression engine" line started by earlier work on equation discovery, covering the discrete-logic case.

Every Monday
Get next week’s papers.
Subscribe on Substack