Update training section wording
Browse files
README.md
CHANGED
|
@@ -136,9 +136,7 @@ For 8-bit inputs (256 total):
|
|
| 136 |
|
| 137 |
The parametric construction was derived algebraically, not discovered through training.
|
| 138 |
|
| 139 |
-
Evolutionary search was attempted (as with parity) but consistently plateaued at 247/256 (96.5%) accuracy across multiple seeds.
|
| 140 |
-
|
| 141 |
-
This finding reinforces that the algebraic insight is essential—MOD-3 networks cannot be found by naive search alone.
|
| 142 |
|
| 143 |
## Comparison to Parity
|
| 144 |
|
|
@@ -157,7 +155,7 @@ This finding reinforces that the algebraic insight is essential—MOD-3 networks
|
|
| 157 |
- **Binary inputs**: Expects {0, 1}, not continuous values
|
| 158 |
- **No noise margin**: Heaviside threshold at exactly 0
|
| 159 |
- **Not differentiable**: Cannot be fine-tuned with gradient descent
|
| 160 |
-
- **Training gap**:
|
| 161 |
|
| 162 |
## Files
|
| 163 |
|
|
|
|
| 136 |
|
| 137 |
The parametric construction was derived algebraically, not discovered through training.
|
| 138 |
|
| 139 |
+
Evolutionary search was attempted (as with parity) but consistently plateaued at 247/256 (96.5%) accuracy across multiple seeds. We were unable to discover the (1,1,-2) weight pattern through training, so we used algebraic construction instead.
|
|
|
|
|
|
|
| 140 |
|
| 141 |
## Comparison to Parity
|
| 142 |
|
|
|
|
| 155 |
- **Binary inputs**: Expects {0, 1}, not continuous values
|
| 156 |
- **No noise margin**: Heaviside threshold at exactly 0
|
| 157 |
- **Not differentiable**: Cannot be fine-tuned with gradient descent
|
| 158 |
+
- **Training gap**: Our evolutionary search achieved only 96.5%; we used algebraic construction instead
|
| 159 |
|
| 160 |
## Files
|
| 161 |
|