Hi everyone,
I wanted to share an empirical study testing whether biologically inspired architectures with local learning rules, specifically Sparse Predictive Hierarchies (SPH) based on Ogma's whitepapers (AOgmaNeo) can handle complex policy/value prediction tasks without end-to-end backpropagation.
Chess was chosen as the testbed because it requires both local pattern recognition and long-range spatial dependencies.
GitHub Repo: https://github.com/P1X3R/sparse-chess
Control Group Repo: https://github.com/P1X3R/sparse-chess-control-group
1. Motivation & Core Hypothesis
Standard deep learning models (ResNets, Transformers) rely on global backpropagation. I wanted to test if extreme weight/activation sparsity (~99%) combined with local prediction updates could enable scalable, compute-efficient policy/value prediction on modest hardware.
2.…