Sparse Predictive Hierarchies fail to match backprop learning in chess

A study evaluating Sparse Predictive Hierarchies (SPH) and non-backpropagation learning for chess failed to achieve competitive results. The SPH model, despite its larger parameter count and extreme sparsity, significantly underperformed a smaller, standard convolutional neural network trained with backpropagation. Researchers concluded that the ~99% sparsity and local learning rules hindered the propagation of crucial tactical information and global dependencies necessary for complex tasks like chess. AI

IMPACT Highlights limitations of non-backpropagation learning and extreme sparsity for complex, globally dependent tasks.

RANK_REASON Research paper detailing an empirical study on a novel AI architecture. [lever_c_demoted from research: ic=1 ai=1.0]

Read on r/MachineLearning →

• AOgmaNeo
• chess
• Leela Chess Zero
• Non-Backprop Learning
• Ogma
• Sparse Predictive Hierarchies

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →