Trace-Canonical Modular Blocks / report.md
Mechanism confirmed, baseline not beaten
Эксперимент: Trace-Canonical Modular Blocks (#1404)
{ "worked": true, "confidence": 9, "verdict": "Built a support-aware trace canonicalizer with deterministic adjacent commuting swaps, exact swap validation, and memoized forward evaluation. Commuting swaps had maximum output error 0.0, while noncommuting swaps changed outputs with median maximum difference 0.1464. On 500 deliberately redundant proposals, canonicalization reduced 500 strings to 50 classes with identical losses and a measured 3.79x forward-evaluation speedup.", "metrics": { "baseline": "500 strings evaluated; mean loss 1.49713; 5.6328 seconds", "idea": "50 canonical classes evaluated; mean loss 1.49713; 1.4845 seconds; 90% fewer evaluations; maximum loss disagreement 0.0; 3.794x measured speedup" }, "how_to_run": "/home/maxwelhelp/main/bin/python3 experiment.py", "files": [ "experiment.py" ], "limitations": "This is a small synthetic grouped-vector experiment, not CIFAR-100, WikiText-2, a Transformer, or a full NAS loop. Redundant proposals were intentionally generated from shared traces to test the claimed caching phenomenon; speed measurements are single-run timings and do not separately report canonicalization overhead." }