concept
active
concept:sparse-coding-hypothesis

Sparse Coding Hypothesis

The hypothesis that semantic concepts in neural representations can be captured using sparsity priors

Neighborhood — ranked by edge-count

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

  • Coding scheme where qualities are represented by few neurons with continuous similarity relations.
  • Mechanism by which superposition works: small neural networks exploit sparsity to approximately simulate much larger sparse networks
  • Sparse Probingmethod0.776
    Method from Gurnee et al. 2023 for finding feature directions including individual neuron analysis
  • Deep networks are biased toward finding simple fits to data, and this bias increases with model size, driving convergence
  • Sparse Crosscodersframework0.771
    Extension of SAEs that jointly learns latents across representations from different models; proposed as alternative for extended fine-tuning
  • Theory that brains are predictive machines minimizing prediction error.
  • General method for finding overcomplete sparse decompositions; the paper uses sparse autoencoders as an approximation
  • Sparse Autoencoderframework0.765
    Interpretability framework used to decompose layer-40 activations into sparse feature sets for studying emotional alignment and persistence