Dynamic Dropout: Leveraging Conway's Game of Life for Neural Networks Regularization
David Freire-Obreg\'on, Jos\'e Salas-C\'aceres, Modesto Castrill\'on-Santana

TL;DR
This paper introduces a novel regularization method for neural networks that replaces traditional dropout with Conway's Game of Life, enabling dynamic, pattern-driven deactivation of units to improve generalization.
Contribution
The paper proposes using Conway's Game of Life for dynamic neural network regularization, offering an interpretable and adaptable alternative to static dropout.
Findings
Achieves comparable performance to dropout on CIFAR-10
Visualizes evolving spatial patterns in network units
Enhances deeper neural architectures' performance
Abstract
Regularization techniques play a crucial role in preventing overfitting and improving the generalization performance of neural networks. Dropout, a widely used regularization technique, randomly deactivates units during training to introduce redundancy and prevent co-adaptation among neurons. Despite its effectiveness, dropout has limitations, such as its static nature and lack of interpretability. In this paper, we propose a novel approach to regularization by substituting dropout with Conway's Game of Life (GoL), a cellular automata with simple rules that govern the evolution of a grid of cells. We introduce dynamic unit deactivation during training by representing neural network units as cells in a GoL grid and applying the game's rules to deactivate units. This approach allows for the emergence of spatial patterns that adapt to the training data, potentially enhancing the network's…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
