Sparse sign-consistent Johnson–Lindenstrauss matrices: Compression with neuroscience-based constraints: Fig. 1.

An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform

(2013) Nir Ailon et al.   ACM Transactions on Algorithms

Compressed Sensing, Sparsity, and Dimensionality in Neuronal Information Processing and Data Analysis

(2012) Surya Ganguli et al.   Annual Review of Neuroscience

The Hippocampus as a Stable Memory Allocator for Cortex

(2012) Leslie G. Valiant   NEURAL COMPUTATION

New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property

(2011) Felix Krahmer et al.   SIAM JOURNAL ON MATHEMATICAL ANALYSIS

A variant of the Johnson–Lindenstrauss lemma for circulant matrices

(2010) Jan Vybíral   JOURNAL OF FUNCTIONAL ANALYSIS

Stimulus-dependent suppression of chaos in recurrent neural networks

(2010) Kanaka Rajan et al.   PHYSICAL REVIEW E

Compressed and Privacy-Sensitive Sparse Regression

(2009) Shuheng Zhou et al.   IEEE TRANSACTIONS ON INFORMATION THEORY

Experience-Induced Neural Circuits That Achieve High Capacity

(2009) Vitaly Feldman et al.   NEURAL COMPUTATION

Perturbed Identity Matrices Have High Rank: Proof and Applications

(2008) NOGA ALON   COMBINATORICS PROBABILITY & COMPUTING

Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes

(2008) Nir Ailon et al.   DISCRETE & COMPUTATIONAL GEOMETRY

Stability and structural constraints of random brain networks with excitatory and inhibitory neural populations

(2008) Richard T. Gray et al.   JOURNAL OF COMPUTATIONAL NEUROSCIENCE