CL-DIAG: Diagnosing canonicalization leakage in supervised learning under group symmetry
-
Updated
Mar 20, 2026 - Python
CL-DIAG: Diagnosing canonicalization leakage in supervised learning under group symmetry
First machine-verified formalization of the natural proofs barrier (Razborov-Rudich 1997) in Lean 4. Zero sorry obligations.
Exact minimal integer-weight threshold circuits for every 4-input Boolean function (65,536 tables, 222 NPN classes): free-weight optima, capped Pareto frontiers, constructive forms, price of decomposability - all machine-verified.
Código del TFG de Ingeniería Informática / Code for the Computer Science Bacherlor's Thesis
Add a description, image, and links to the circuit-complexity topic page so that developers can more easily learn about it.
To associate your repository with the circuit-complexity topic, visit your repo's landing page and select "manage topics."