cs.CVOct 25, 2026

Spatially-Aware Self-Organizing Graph Autoencoders via Localized Hebbian Learning

Authors: Robin Koç, Hazal Moğultay Özcan, Fatoş T. Yarman Vural

Organizations: Computer Engineering Department, Middle East Technical University, Ankara, Türkiye

Abstract

Traditional autoencoders rely on static network architectures to learn latent representations. Recently we suggested a dynamic architecture inspired by Hebbian plasticity, enabling topological self-organization among convolutional feature maps (R. Koç et al., Proceedings of the SIU, 2026). Early implementations of this paradigm infer relationships among feature maps using global average pooling and model their interactions through scalar-valued connections. This approach falls short to fully exploit the underlying spatial information, embedded in input images. Furthermore, abrupt transitions between different loss functions and training dynamics can introduce representation shocks, leading to unstable feature learning. In this paper, we introduce a Spatially-Aware Self-Organizing Graph Autoencoder (S-LooM) to address these structural bottlenecks. By using spatial cross-correlation, and spatial kernels, S-LooM establishes dynamic connections among feature maps. We replace static scalar message passing of autoencoders with learnable spatial kernels and eliminate high-frequency deconvolutional artifacts observed in decoders using nearest-neighbor upsampling. Via a soft-blending training curriculum, the latent topology aligns smoothly during training. Our experiments show that S-LooM yields a more stable topology, compared to the state of the art dynamic architectures. Meaning, the graph structure that emerge has more resistance to feature entanglement and noise. It forms functional communities responsible for visual attributes, such as illumination, shape and texture even under high connection densities.

Figures & tables

Explore similar work

CardsList
  1. From Token Lists to Graph Motifs: Weisfeiler-Lehman Analysis of Sparse Autoencoder Features

    May 7, 2026Ruben Fernandez-Boullon, Pablo Magariños-Docampo, Javier Perez-RoblesTransformer InterpretabilitySparse Autoencoders

  2. When Trees Are Not Enough: Learning Mixed-Topology Feature Graphs with Adaptive Graph Sparse Autoencoders

    Sep 28, 2026Xiaozuo Shen, Yifei Cai, Tian Tan +3Sparse AutoencodersMechanistic Interpretability

  3. Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding

    Aug 19, 2026Aleksandar Tomčić, Miloš Savić, Miloš RadovanovićGraph Neural NetworksDynamic Graph Learning