mlsanityData to 14 Oct 2026

Sparse, Geometric Autoencoder Models of V1

arXiv 2302.11162 ↗First posted 22 Feb 2023cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The classical sparse coding model represents visual stimuli as a linear combination of a handful of learned basis functions that are Gabor-like when trained on natural image data. However, the Gabor-like filters learned by classical sparse coding far overpredict well-tuned simple cell receptive field (SCRF) profiles. A number of subsequent models have either discarded the sparse dictionary learning framework entirely or have yet to take advantage of the surge in unrolled, neural dictionary learning architectures. A key missing theme of these updates is a stronger notion of structured sparsity. We propose an autoencoder architecture whose latent representations are implicitly, locally organized for spectral clustering, which begets artificial neurons better matched to observed primate data. The weighted-ℓ1 (WL) constraint in the autoencoder objective function maintains core ideas of the sparse coding framework, yet also offers a promising path to describe the differentiation of receptive fields in terms of a discriminative hierarchy in future work.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 13 references that are in the map. First posted on arXiv 22 Feb 2023.

Builds on

3 of 13 references.

References · 3

  1. 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
  2. 2013Discriminative Recurrent Sparse Auto-Encoderscited by 5
  3. 2021Weighed l1 on the simplex: Compressive sensing meets localitycited by 2

Built on by

Not cited yet.