High-Dimensional Inference with the generalized Hopfield Model: Principal Component Analysis and Corrections
Simona Cocco (LPS), Remi Monasson (LPTENS), Vitor Sessak (LPTENS)

TL;DR
This paper explores how the Hopfield model can be used for high-dimensional inference of binary variable interactions, connecting maximum likelihood estimation with PCA, and providing corrections and criteria for effective pattern inference.
Contribution
It extends the Hopfield model to include both attractive and repulsive patterns, offering a geometrical criterion for pattern selection and analyzing sample size requirements for accurate inference.
Findings
Maximum likelihood inference relates to PCA when pattern amplitudes are small.
Derived first-order corrections to patterns using statistical mechanics techniques.
Provided a criterion for selecting the number of patterns based on sampling noise.
Abstract
We consider the problem of inferring the interactions between a set of N binary variables from the knowledge of their frequencies and pairwise correlations. The inference framework is based on the Hopfield model, a special case of the Ising model where the interaction matrix is defined through a set of patterns in the variable space, and is of rank much smaller than N. We show that Maximum Lik elihood inference is deeply related to Principal Component Analysis when the amp litude of the pattern components, xi, is negligible compared to N^1/2. Using techniques from statistical mechanics, we calculate the corrections to the patterns to the first order in xi/N^1/2. We stress that it is important to generalize the Hopfield model and include both attractive and repulsive patterns, to correctly infer networks with sparse and strong interactions. We present a simple geometrical criterion to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
