Storage of correlated patterns in a perceptron
arXiv:cond-mat/9505093 · doi:10.1088/0305-4470/28/16/005
Abstract
We calculate the storage capacity of a perceptron for correlated gaussian patterns. We find that the storage capacity can be less than 2 if similar patterns are mapped onto different outputs and vice versa. As long as the patterns are in general position we obtain, in contrast to previous works, that in agreement with Cover's theorem. Numerical simulations confirm the results.
9 pages LaTeX ioplppt style, figures included using epsf
Cited by in corpus (11)
- Classification and Geometry of General Perceptual Manifolds
- Linear Readout of Object Manifolds
- Counting the learnable functions of structured data
- Gaussian Universality of Perceptrons with Random Labels
- Linear Classification of Neural Manifolds with Correlated Variability
- Generalization from correlated sets of patterns in the perceptron
- Training a perceptron by a bit sequence: Storage capacity
- Optimal generalisation and learning transition in extensive-width shallow neural networks near interpolation
- Statistical mechanics of extensive-width Bayesian neural networks near interpolation
- Statistical physics of deep learning: Optimal learning of a multi-layer perceptron near interpolation
- Critical properties of the SAT/UNSAT transitions in the classification problem of structured data