Representation Learning in a Decomposed Encoder Design for Bio-inspired Hebbian Learning
Achref Jaziri, Sina Ditzel, Iuliia Pliushch, Visvanathan Ramesh
TL;DR
The paper tackles learning robust representations under biologically plausible, local Hebbian rules by introducing a decomposed encoder design with multiple invariant operators. It trains parallel encoders via a bio-inspired contrastive predictive coding framework (CLAPP or HingeCPC) and evaluates them with a downstream linear classifier, using datasets such as GTSRB, STL10, and CODEBRIM (with video experiments in the appendix). Key findings show that carefully chosen invariants (e.g., LBP, RG normalization, DTCWT) substantially improve robustness and close the gap to backpropagation, often outperforming non-decomposed baselines, and achieving competitive multi-target performance on CODEBRIM. The work highlights the importance of integrating domain knowledge and inductive biases with local learning rules to obtain transparent, generalizable representations suitable for real-world tasks.
Abstract
Modern data-driven machine learning system designs exploit inductive biases in architectural structure, invariance and equivariance requirements, task-specific loss functions, and computational optimization tools. Previous works have illustrated that human-specified quasi-invariant filters can serve as a powerful inductive bias in the early layers of the encoder, enhancing robustness and transparency in learned classifiers. This paper explores this further within the context of representation learning with bio-inspired Hebbian learning rules. We propose a modular framework trained with a bio-inspired variant of contrastive predictive coding, comprising parallel encoders that leverage different invariant visual descriptors as inductive biases. We evaluate the representation learning capacity of our system in classification scenarios using diverse image datasets (GTSRB, STL10, CODEBRIM) and video datasets (UCF101). Our findings indicate that this form of inductive bias significantly improves the robustness of learned representations and narrows the performance gap between models using local Hebbian plasticity rules and those using backpropagation, while also achieving superior performance compared to non-decomposed encoders.
