Log In Sign Up

Dense Associative Memory for Pattern Recognition

by   Dmitry Krotov, et al.
Princeton University
Institute for Advanced Study

A model of associative memory is studied, which stores and reliably retrieves many more patterns than the number of neurons in the network. We propose a simple duality between this dense associative memory and neural networks commonly used in deep learning. On the associative memory side of this duality, a family of models that smoothly interpolates between two limiting cases can be constructed. One limit is referred to as the feature-matching mode of pattern recognition, and the other one as the prototype regime. On the deep learning side of the duality, this family corresponds to feedforward neural networks with one hidden layer and various activation functions, which transmit the activities of the visible neurons to the hidden layer. This family of activation functions includes logistics, rectified linear units, and rectified polynomials of higher degrees. The proposed duality makes it possible to apply energy-based intuition from associative memory to analyze computational properties of neural networks with unusual activation functions - the higher rectified polynomials which until now have not been used in deep learning. The utility of the dense memories is illustrated for two test cases: the logical gate XOR and the recognition of handwritten digits from the MNIST data set.


Improving Randomized Learning of Feedforward Neural Networks by Appropriate Generation of Random Parameters

In this work, a method of random parameters generation for randomized le...

The SWAG Algorithm; a Mathematical Approach that Outperforms Traditional Deep Learning. Theory and Implementation

The performance of artificial neural networks (ANNs) is influenced by we...

Lifted Neural Networks

We describe a novel family of models of multi- layer feedforward neural ...

Energy-based General Sequential Episodic Memory Networks at the Adiabatic Limit

The General Associative Memory Model (GAMM) has a constant state-dependa...

Universal approximation properties of shallow quadratic neural networks

In this paper we propose a new class of neural network functions which a...

Neural networks with redundant representation: detecting the undetectable

We consider a three-layer Sejnowski machine and show that features learn...

1 Introduction

Pattern recognition and models of associative memory Hopfield

are closely related. Consider image classification as an example of pattern recognition. In this problem, the network is presented with an image and the task is to label the image. In the case of associative memory the network stores a set of memory vectors. In a typical query the network is presented with an incomplete pattern resembling, but not identical to, one of the stored memories and the task is to recover the full memory. Pixel intensities of the image can be combined together with the label of that image into one vector

LeCun_tutorial , which will serve as a memory for the associative memory. Then the image itself can be thought of as a partial memory cue. The task of identifying an appropriate label is a subpart of the associative memory reconstruction. There is a limitation in using this idea to do pattern recognition. The standard model of associative memory works well in the limit when the number of stored patterns is much smaller than the number of neurons Hopfield , or equivalently the number of pixels in an image. In order to do pattern recognition with small error rate one would need to store many more memories than the typical number of pixels in the presented images. This is a serious problem. It can be solved by modifying the standard energy function of associative memory, quadratic in interactions between the neurons, by including in it higher order interactions. By properly designing the energy function (or Hamiltonian) for these models with higher order interactions one can store and reliably retrieve many more memories than the number of neurons in the network.

Deep neural networks have proven to be useful for a broad range of problems in machine learning including image classification, speech recognition, object detection, etc. These models are composed of several layers of neurons, so that the output of one layer serves as the input to the next layer. Each neuron calculates a weighted sum of the inputs and passes the result through a non-linear activation function. Traditionally, deep neural networks used activation functions such as hyperbolic tangents or logistics. Learning the weights in such networks, using a backpropagation algorithm, faced serious problems in the 1980s and 1990s. These issues were largely resolved by introducing unsupervised pre-training, which made it possible to initialize the weights in such a way that the subsequent backpropagation could only gently move boundaries between the classes without destroying the feature detectors

DBN ; Hinton_Salakhutdinov

. More recently, it was realized that the use of rectified linear units (ReLU) instead of the logistic functions speeds up learning and improves generalization

ReLU_Nair ; ReLU_Glorot ; ReLU_Krizhevsky . Rectified linear functions are usually interpreted as firing rates of biological neurons. These rates are equal to zero if the input is below a certain threshold and linearly grow with the input if it is above the threshold. To mimic biology the output should be small or zero if the input is below the threshold, but it is much less clear what the behavior of the activation function should be for inputs exceeding the threshold. Should it grow linearly, sub-linearly, or faster than linearly? How does this choice affect the computational properties of the neural network? Are there other functions that would work even better than the rectified linear units? These questions to the best of our knowledge remain open.

This paper examines these questions through the lens of associative memory. We start by discussing a family of models of associative memory with large capacity. These models use higher order (higher than quadratic) interactions between the neurons in the energy function. The associative memory description is then mapped onto a neural network with one hidden layer and an unusual activation function, related to the Hamiltonian. We show that by varying the power of interaction vertex in the energy function (or equivalently by changing the activation function of the neural network) one can force the model to learn representations of the data either in terms of features or in terms of prototypes.

2 Associative memory with large capacity

The standard model of associative memory Hopfield uses a system of binary neurons, with values . A configuration of all the neurons is denoted by a vector . The model stores memories, denoted by

, which for the moment are also assumed to be binary. The model is defined by an energy function, which is given by


and a dynamical update rule that decreases the energy at every update. The basic problem is the following: when presented with a new pattern the network should respond with a stored memory which most closely resembles the input.

There has been a large amount of work in the community of statistical physicists investigating the capacity of this model, which is the maximal number of memories that the network can store and reliably retrieve. It has been demonstrated Hopfield ; Amit ; McEliece that in case of random memories this maximal value is of the order of . If one tries to store more patterns, several neighboring memories in the configuration space will merge together producing a ground state of the Hamiltonian (1), which has nothing to do with any of the stored memories. By modifying the Hamiltonian (1) in a way that removes second order correlations between the stored memories, it is possible Kanter to improve the capacity to .

The mathematical reason why the model (1) gets confused when many memories are stored is that several memories produce contributions to the energy which are of the same order. In other words the energy decreases too slowly as the pattern approaches a memory in the configuration space. In order to take care of this problem, consider a modification of the standard energy


In this formula is some smooth function (summation over index is assumed). The computational capabilities of the model will be illustrated for two cases. First, when ( is an integer number), which is referred to as a polynomial energy function. Second, when is a rectified polynomial energy function


In the case of the polynomial function with the network reduces to the standard model of associative memory Hopfield . If each term in (2) becomes sharper compared to the case, thus more memories can be packed into the same configuration space before cross-talk intervenes.

Having defined the energy function one can derive an iterative update rule that leads to decrease of the energy. We use asynchronous updates flipping one unit at a time. The update rule is:


The argument of the sign function is the difference of two energies. One, for the configuration with all but the -th units clumped to their current states and the -th unit in the “off” state. The other one for a similar configuration, but with the -th unit in the “on” state. This rule means that the system updates a unit, given the states of the rest of the network, in such a way that the energy of the entire configuration decreases. For the case of polynomial energy function a very similar family of models was considered in Chen ; Psaltis ; Baldi ; Gardner ; Abbott ; Horn . The update rule in those models was based on the induced magnetic fields, however, and not on the difference of energies. The two are slightly different due to the presence of self-coupling terms. Throughout this paper we use energy-based update rules.

How many memories can model (4) store and reliably retrieve? Consider the case of random patterns, so that each element of the memories is equal to

with equal probability. Imagine that the system is initialized in a state equal to one of the memories (pattern number

). One can derive a stability criterion, i.e. the upper bound on the number of memories such that the network stays in that initial state. Define the energy difference between the initial state and the state with spin flipped

where the polynomial energy function is used. This quantity has a mean , which comes from the term with

, and a variance (in the limit of large


The -th bit becomes unstable when the magnitude of the fluctuation exceeds the energy gap and the sign of the fluctuation is opposite to the sign of the energy gap. Thus the probability that the state of a single neuron is unstable (in the limit when both and are large, so that the noise is effectively gaussian) is equal to

Requiring that this probability is less than a small value, say , one can find the upper limit on the number of patterns that the network can store


where is a numerical constant, which depends on the (arbitrary) threshold . The case corresponds to the standard model of associative memory and gives the well known result . For the perfect recovery of a memory () one obtains


For higher powers the capacity rapidly grows with in a non-linear way, allowing the network to store and reliably retrieve many more patterns than the number of neurons that it has, in accord111The -dependent coefficient in (6) depends on the exact form of the Hamiltonian and the update rule. References Baldi ; Gardner ; Abbott do not allow repeated indices in the products over neurons in the energy function, therefore obtain a different coefficient. In Horn the Hamiltonian coincides with ours, but the update rule is different, which, however, results in exactly the same coefficient as in (6). with Baldi ; Gardner ; Abbott ; Horn . This non-linear scaling relationship between the capacity and the size of the network is the phenomenon that we exploit.

We study a family of models of this kind as a function of . At small many terms contribute to the sum over in (2) approximately equally. In the limit the dominant contribution to the sum comes from a single memory, which has the largest overlap with the input. It turns out that optimal computation occurs in the intermediate range.

3 The case of XOR

The case of XOR is elementary, yet instructive. It is presented here for three reasons. First, it illustrates the construction (2) in this simplest case. Second, it shows that as increases, the computational capabilities of the network also increase. Third, it provides the simplest example of a situation in which the number of memories is larger than the number of neurons, yet the network works reliably.

The problem is the following: given two inputs and produce an output such that the truth table

-1 -1 -1
-1  1  1
 1 -1  1
 1  1 -1

is satisfied. We will treat this task as an associative memory problem and will simply embed the four examples of the input-output triplets in the memory. Therefore the network has identical units: two of which will be used for the inputs and one for the output, and memories , which are the four lines of the truth table. Thus, the energy (2) is equal to


where the energy function is chosen to be a polynomial of degree

. For odd

, energy (7) is an odd function of each of its arguments, . For even , it is an even function. For it is equal to zero. Thus, if evaluated on the corners of the cube , it reduces to


where coefficients denote numerical constants.

In order to solve the XOR problem one can present to the network an “incomplete pattern” of inputs and let the output adjust to minimize the energy of the three-spin configuration, while holding the inputs fixed. The network clearly cannot solve this problem for and , since the energy does not depend on the spin configuration. The case

is the standard model of associative memory. It can also be thought of as a linear perceptron, and the inability to solve this problem represents the well known statement

Minsky_Papert that linear perceptrons cannot compute XOR without hidden neurons. The case of odd provides an interesting solution. Given two inputs, and , one can choose the output that minimizes the energy. This leads to the update rule

Thus, in this simple case the network is capable of solving the problem for higher odd values of , while it cannot do so for and . In case of rectified polynomials, a similar construction solves the problem for any . The network works well in spite of the fact that .

4 An example of a pattern recognition problem, the case of MNIST

The MNIST data set is a collection of handwritten digits, which has 60000 training examples and 10000 test images. The goal is to classify the digits into 10 classes. The visible neurons, one for each pixel, are combined together with 10 classification neurons in one vector that defines the state of the network. The visible part of this vector is treated as an “incomplete” pattern and the associative memory is allowed to calculate a completion of that pattern, which is the label of the image.

Dense associative memory (2) is a recurrent network in which every neuron can be updated multiple times. For the purposes of digit classification, however, this model will be used in a very limited capacity, allowing it to perform only one update of the classification neurons. The network is initialized in the state when the visible units are clamped to the intensities of a given image and the classification neurons are in the off state (see Fig.1A). The network is allowed to make one update of the classification neurons, while keeping the visible units clamped, to produce the output . The update rule is similar to (4) except that the sign is replaced by the continuous function


where parameter regulates the slope of . The proposed digit class is given by the number of a classification neuron producing the maximal output. Throughout this section the rectified polynomials (3) are used as functions . To learn effective memories for use in pattern classification,

Figure 1: (A) The network has visible neurons and classification neurons. The visible units are clamped to intensities of pixels (which is mapped on the segment ), while the classification neurons are initialized in the state and then updated once to the state

. (B) Behavior of the error on the test set as training progresses. Each curve corresponds to a different combination of hyperparameters from the optimal window, which was determined on the validation set. The arrows show the first time when the error falls below a

threshold. All models have memories (hidden units).

an objective function is defined (see Appendix A in Supplemental), which penalizes the discrepancy between the output

and the target output. This objective function is then minimized using a backpropagation algorithm. The learning starts with random memories drawn from a Gaussian distribution. The backpropagation algorithm then finds a collection of

memories , which minimize the classification error on the training set. The memories are normalized to stay within the range, absorbing their overall scale into the definition of the parameter .

The performance of the proposed classification framework is studied as a function of the power . The next section shows that a rectified polynomial of power in the energy function is equivalent to the rectified polynomial of power used as an activation function in a feedforward neural network with one hidden layer of neurons. Currently, the most common choice of activation functions for training deep neural networks is the ReLU, which in our language corresponds to for the energy function. Although not currently used to train deep networks, the case would correspond to a rectified parabola as an activation function. We start by comparing the performances of the dense memories in these two cases.

The performance of the network depends on and on the remaining hyperparameters, thus the hyperparameters should be optimized for each value of . In order to test the variability of performances for various choices of hyperparameters at a given , a window of hyperparameters for which the network works well on the validation set (see the Appendix A in Supplemental) was determined. Then many networks were trained for various choices of the hyperparameters from this window to evaluate the performance on the test set. The test errors as training progresses are shown in Fig.1B. While there is substantial variability among these samples, on average the cluster of trajectories for achieves better results on the test set than that for . These error rates should be compared with error rates for backpropagation alone without the use of generative pretraining, various kinds of regularizations (for example dropout) or adversarial training, all of which could be added to our construction if necessary. In this class of models the best published results are all222Although there are better results on pixel permutation invariant task, see for example dropout ; dropconnect ; adversarial ; ladder . in the range Platt , see also controls in dropout ; dropconnect . This agrees with our results for . The case does slightly better than that as is clear from Fig.1B, with all the samples performing better than .

Higher rectified polynomials are also faster in training compared to ReLU. For the case, the error crosses the

threshold for the first time during training in the range of 179-312 epochs. For the

case, this happens earlier on average, between 158-262 epochs. For higher powers

this speed-up is larger. This is not a huge effect for a small dataset such as MNIST. However, this speed-up might be very helpful for training large networks on large datasets, such as ImageNet. A similar effect was reported earlier for the transition between saturating units, such as logistics or hyperbolic tangents, to ReLU

ReLU_Krizhevsky . In our family of models that result corresponds to moving from to .

Feature to prototype transition

How does the computation performed by the neural network change as varies? There are two extreme classes of theories of pattern recognition: feature-matching and formation of a prototype. According to the former, an input is decomposed into a set of features, which are compared with those stored in the memory. The subset of the stored features activated by the presented input is then interpreted as an object. One object has many features; features can also appear in more than one object. The prototype theory provides an alternative approach, in which objects are recognized as a whole.

Figure 2: We show 25 randomly selected memories (feature detectors) for four networks, which use rectified polynomials of degrees as the energy function. The magnitude of a memory element corresponding to each pixel is plotted in the location of that pixel, the color bar explains the color code. The histograms at the bottom are explained in the text. The error rates refer to the particular four samples used in this figure. RU stands for recognition unit.

The prototypes do not necessarily match the object exactly, but rather are blurred abstract representations which include all the features that an object has. We argue that the computational models proposed here describe feature-matching mode of pattern recognition for small and the prototype regime for large . This can be anticipated from the sharpness of contributions that each memory makes to the total energy (2). For large the function peaks much more sharply around each memory compared to the case of small . Thus, at large all the information about a digit must be written in only one memory, while at small this information can be distributed among several memories. In the case of intermediate some learned memories behave like features while others behave like prototypes. These two classes of memories work together to model the data in an efficient way.

The feature to prototype transition is clearly seen in memories shown in Fig.2. For or each memory does not look like a digit, but resembles a pattern of activity that might be useful for recognizing several different digits. For many of the memories can be recognized as digits, which are surrounded by white margins representing elements of memories having approximately zero values. These margins describe the variability of thicknesses of lines of different training examples and mathematically mean that the energy (2) does not depend on whether the corresponding pixel is on or off. For most of the memories represent prototypes of whole digits or large portions of digits, with a small admixture of feature memories that do not resemble any digit.

The feature to prototype transition can be visualized by showing the feature detectors in situations when there is a natural ordering of pixels. Such ordering exists in images, for example. In general situations, however, there is no preferred permutation of visible neurons that would reveal this structure (e.g. in the case of genomic data). It is therefore useful to develop a measure that permits a distinction to be made between features and prototypes in the absence of such visual space. Towards the end of training most of the recognition connections are approximately equal to . One can choose an arbitrary cutoff, and count the number of recognition connections that are in the “on” state () for each memory. The distribution function of this number is shown on the left histogram in Fig.2. Intuitively, this quantity corresponds to the number of different digit classes that a particular memory votes for. At small , most of the memories vote for three to five different digit classes, a behavior characteristic of features. As increases, each memory specializes and votes for only a single class. In the case , for example, more than of memories vote for only one class, a behavior characteristic of prototypes. A second way to see the feature to prototype transition is to look at the number of memories which make large contributions to the classification decision (right histogram in Fig.2). For each test image one can find the memory that makes the largest contribution to the energy gap, which is the sum over in (9). Then one can count the number of memories that contribute to the gap by more than 0.9 of this largest contribution. For small , there are many memories that satisfy this criterion and the distribution function has a long tail. In this regime several memories are cooperating with each other to make a classification decision. For , however, more than 8000 of 10000 test images do not have a single other memory that would make a contribution comparable with the largest one. This result is not sensitive to the arbitrary choice () of the cutoff. Interestingly, the performance remains competitive even for very large (see Fig.2) in spite of the fact that these networks are doing a very different kind of computation compared with that at small .

5 Relationship to a neural network with one hidden layer

In this section we derive a simple duality between the dense associative memory and a feedforward neural network with one layer of hidden neurons. In other words, we show that the same computational model has two very different descriptions: one in terms of associative memory,

Figure 3: On the left a feedforward neural network with one layer of hidden neurons. The states of the visible units are transformed to the hidden neurons using a non-linear function , the states of the hidden units are transformed to the output layer using a non-linear function . On the right the model of dense associative memory with one step update (9). The two models are equivalent.

the other one in terms of a network with one layer of hidden units. Using this correspondence one can transform the family of dense memories, constructed for different values of power , to the language of models used in deep learning. The resulting neural networks are guaranteed to inherit computational properties of the dense memories such as the feature to prototype transition.

The construction is very similar to (9), except that the classification neurons are initialized in the state when all of them are equal to , see Fig.3. In the limit one can expand the function in (9) so that the dominant contribution comes from the term linear in . Then


where the parameter is set to (summation over the visible index is assumed). Thus, the model of associative memory with one step update is equivalent to a conventional feedforward neural network with one hidden layer provided that the activation function from the visible layer to the hidden layer is equal to the derivative of the energy function


The visible part of each memory serves as an incoming weight to the hidden layer, and the recognition part of the memory serves as an outgoing weight from the hidden layer. The expansion used in (10) is justified by a condition , which is satisfied for most common problems, and is simply a statement that labels contain far less information than the data itself.

From the point of view of associative memory, the dominant contribution shaping the basins of attraction comes from the low energy states. Therefore mathematically it is determined by the asymptotics of the activation function , or the energy function , at . Thus different activation functions having similar asymptotics at should fall into the same universality class and should have similar computational properties. In the table below we list some common activation

activation function energy function
, at
logistic function , at
ReLU , at

functions used in models of deep learning, their associative memory counterparts and the power which determines the asymptotic behavior of the energy function at .The results of section 4 suggest that for not too large the speed of learning should improve as increases. This is consistent with the previous observation that ReLU are faster in training than hyperbolic tangents and logistics ReLU_Nair ; ReLU_Glorot ; ReLU_Krizhevsky . The last row of the table corresponds to rectified polynomials of higher degrees. To the best of our knowledge these activation functions have not been used in neural networks. Our results suggest that for some problems these higher power activation functions should have even better computational properties than the rectified liner units.

6 Discussion and conclusions

What is the relationship between the capacity of the dense associative memory, calculated in section 2, and the neural network with one step update that is used for digit classification? Consider the limit of very large in (9), so that the hyperbolic tangent is approximately equal to the sign function, as in (4). In the limit of sufficiently large the network is operating in the prototype regime. The presented image places the initial state of the network close to a local minimum of energy, which corresponds to one of the prototypes. In most cases the one step update of the classification neurons is sufficient to bring this initial state to the nearest local minimum, thus completing the memory recovery. This is true, however, only if the stored patterns are stable and have basins of attraction around them of at least the size of one neuron flip, which is exactly (in the case of random patterns) the condition given by (6). For correlated patterns the maximal number of stored memories might be different from (6), however it still rapidly increases with increase of . The associative memory with one step update (or the feedforward neural network) is exactly equivalent to the full associative memory with multiple updates in this limit. The calculation with random patterns thus theoretically justifies the expectation of a good performance in the prototype regime.

To summarize, this paper contains three main results. First, it is shown how to use the general framework of associative memory for pattern recognition. Second, a family of models is constructed that can learn representations of the data in terms of features or in terms of prototypes, and that smoothly interpolates between these two extreme regimes by varying the power of interaction vertex. Third, there exists a simple duality between a one step update version of the associative memory model and a feedforward neural network with one layer of hidden units and an unusual activation function. This duality makes it possible to propose a class of activation functions that encourages the network to learn representations of the data with various proportions of features and prototypes. These activation functions can be used in models of deep learning and should be more effective than the standard choices. They allow the networks to train faster. We have also observed an improvement of generalization ability in networks trained with the rectified parabola activation function compared to the ReLU for the case of MNIST. While these ideas were illustrated using the simplest architecture of the neural network with one layer of hidden units, the proposed activation functions can also be used in multilayer architectures. We did not study various regularizations (weight decay, dropout, etc), which can be added to our construction. The performance of the model supplemented with these regularizations, as well as performance on other common benchmarks, will be reported elsewhere.

Appendix A. Details of experiments with MNIST.

The networks were trained using stochastic gradient descent with minibatches of a relatively large size, 100 digits of each class, 1000 digits in total. Training was done for 3000 epochs. Initial weights were generated from a Gaussian distribution

. Momentum () was used to smooth out oscillations of gradients coming from the individual minibatches. The learning rate was decreasing with time according to


where is the number of epoch. Typical values are . The weights (memories) were updated after each minibatch according to


where is the number of update, is an index which unites the visible and the classification units. The proposed update in (13) is normalized so that the largest update of the weights for each hidden unit (memory) is equal to . This normalization is equivalent to using different learning rates for each individual memory. It prevents the network from getting stuck on a plateau. All weights were constrained to stay within the range. Therefore, if after an update some weights exceeded , they were truncated to make them equal to (and similarly for ). The slope of the function in (9) is controlled by the effective temperature , which is measured in “neurons” or “pixels”. For large the temperature can be kept constant throughout the entire training (). For small we found useful to start at a high temperature , and then linearly decrease it to the final value during the first 200 epochs (, ). The temperature stays constant after that. All the models have memories (hidden units).

The MNIST dataset contains 60000 training examples, which were randomly split into 50000 training cases and 10000 validation cases. For each hyperparameter a window of values was selected, such that the error on the validation set after 3000 epochs is less than a certain threshold. After that the entire set of 60000 examples was used to train the network (for 3000 epochs) for various values of the hyperparameters from this optimal window to evaluate the performance on the test set. The validation set was not used for early stopping.

The objective function is given by


where is the target output ( for the wrong classes and for the correct class). The case corresponds to the standard quadratic error. For large powers the function is small for and rapidly grows for . Therefore, higher values of emphasize training examples which produce largest discrepancy with the target output more strongly compared to those examples which are already sufficiently close to the target output. Such emphasis encourages the network to concentrate on correcting mistakes and moving the decision boundary farther away from the barely correct examples rather than on fitting better and better the training examples which have already been easily and correctly classified. Although much of what we discuss is valid for arbitrary value of , including , we found that higher values of reduce overfitting and improve generalization at least in the limit of large . For small , we used . For , larger values of worked better. We also tried cross-entropy objective function together with softmax output units. The results were worse and are not presented here.

The training can be done both in the associative memory description and in the neural network description. The two are related by the duality of section 5. Below we give the explicit expressions for the update rule (13) for these two methods.

Consider a minibatch of size . In the associative memory framework one can define two matrices and (index runs over the training examples of the minibatch, greek indices run over classification neurons, index runs over visible neurons, indices unite all the neurons, visible and classification).

The update rule (9) can then be rewritten as

where is the rectified polynomial of power , and summation over index is assumed. The derivative of the objective function (14) is given by

The indices and

can be united in one tensor product index, so that the two sums can be efficiently calculated using matrix-matrix multiplication.

While this way of training the network is most closely related to the theoretical calculations presented in the main text, it is computationally inefficient. The second dimension of the matrices and is times larger than the size of the minibatch. This can become problematic if the classification problem involves many classes. For this reason it is computationally easier to train the dense memory in the dual description, which is more closely related to the conventional methods used in deep learning. In this framework, the minibatch matrix has elements. The update rule is

where is a rectified polynomial of power333One should remember that the energy function of power is dual to the activation function of power . Here, for the sake of notations, we describe the training procedure for general . , and summation over the visible index is assumed. The derivatives of the objective function (14) are given by

where summation over the visible index is assumed. These expressions are very similar to the conventional derivatives used in networks with rectified linear activation functions, but they use power activation functions instead. The minibatch training can be efficiently implemented on GPU.

Appendix B. Capacity of Dense associative memory.

In section 2 of the main text a theoretical calculation of the capacity for model (4) was presented in the case of power energy functions. In section 5 an intuitive argument (based on the low energy states of the Hamiltonian) was given arguing that the capacities of the models with power energy functions and rectified polynomial energy functions should be very similar. In this appendix we compare the theoretical results of section 2 with numerical simulations and numerically validate the intuitive argument about low energy states.

A random set of binary memory vectors was generated in the model with neurons. A collection of random initial configurations of binary spins were evolved according to (4) until convergence. The quality of memory recovery was measured by the overlap between the final configuration of spins and the closest memory, . If the recovery is perfect, this quantity is equal to ; if some of the spins failed to match a memory vector, this quantity is smaller than . In Fig. 4 the histograms of the overlaps are shown for in case of power and rectified polynomial energy functions. For the number of memories () places the model above the capacity (according to (6), for and for ). Thus, the model is unable to reconstract the memories. For , the number of memories is below the capacity (), thus the distribution sharply peaks at perfect recovery. For all samples converge to one of the memories. Qualitatively, this behavior is demonstrated by both power models and rectified models.

Figure 4: The histograms of overlaps for models with with power energy functions (left) and rectified polynomial energy functions (right). Each histogram has 10000 samples in it.

A family of models with and was studied. For each combination of and a set of binary memory vectors was generated to make a model of associative memory. After that 1000 random binary initial conditions were evolved according to (4) until convergence. is the number of memories when half (500) of these samples perfectly converge to one of the memories. In Fig. 5 the dependence of is shown for the power and the rectified models with . The solid curve is given by Eq.(6). The results of numerical simulations for the case of power activation functions are consistent with the theoretical calculation (6). The results for the rectified polynomials are a little bit above the theoretical curve, but show similar non-linear behavior.

Figure 5: Scaling behavior of the capacity vs. the number of neurons for with power and rectified polynomial energy functions. Solid curve is the theoretical result (6).


We thank B. Chazelle, D. Huse, A. Levine, M. Mitchell, R. Monasson, L. Peliti, D. Raskovalov, B. Xue, and all the members of the Simons Center for Systems Biology at IAS for useful discussions. We especially thank Y. Roudi for pointing out the reference Baldi to us. The work of DK is supported by Charles L. Brown membership at IAS.


  • (1) Hopfield, J.J., 1982. Neural networks and physical systems with emergent collective computational abilities. Proceedings of the national academy of sciences, 79(8), pp.2554-2558.
  • (2) LeCun, Y., Chopra, S., Hadsell, R., Ranzato, M. and Huang, F., 2006. A tutorial on energy-based learning. Predicting structured data, 1, p.0.
  • (3) Hinton, G.E., Osindero, S. and Teh, Y.W., 2006. A fast learning algorithm for deep belief nets. Neural computation, 18(7), pp.1527-1554.
  • (4) Hinton, G.E. and Salakhutdinov, R.R., 2006. Reducing the dimensionality of data with neural networks. Science, 313(5786), pp.504-507.
  • (5)

    Nair, V. and Hinton, G.E., 2010. Rectified linear units improve restricted boltzmann machines. In Proceedings of the 27th International Conference on Machine Learning (ICML-10) (pp. 807-814).

  • (6)

    Glorot, X., Bordes, A. and Bengio, Y., 2011. Deep sparse rectifier neural networks. In International Conference on Artificial Intelligence and Statistics (pp. 315-323).

  • (7)

    Krizhevsky, A., Sutskever, I. and Hinton, G.E., 2012. ImageNet classification with deep convolutional neural networks. In Advances in neural information processing systems (pp. 1097-1105).

  • (8) Amit, D.J., Gutfreund, H. and Sompolinsky, H., 1985. Storing infinite numbers of patterns in a spin-glass model of neural networks. Physical Review Letters, 55(14), p.1530.
  • (9) McEliece, R.J., Posner, E.C., Rodemich, E.R. and Venkatesh, S.S., 1987. The capacity of the Hopfield associative memory. Information Theory, IEEE Transactions on, 33(4), pp.461-482.
  • (10) Kanter, I. and Sompolinsky, H., 1987. Associative recall of memory without errors. Physical Review A, 35(1), p.380.
  • (11) Chen, H.H., Lee, Y.C., Sun, G.Z., Lee, H.Y., Maxwell, T. and Giles, C.L., 1986. High order correlation model for associative memory. In Neural Networks for Computing (Vol. 151, No. 1, pp. 86-99). AIP Publishing.
  • (12) Psaltis, D. and Park, C.H., 1986. Nonlinear discriminant functions and associative memories. In Neural networks for computing (Vol. 151, No. 1, pp. 370-375). AIP Publishing.
  • (13) Baldi, P. and Venkatesh, S.S., 1987. Number of stable points for spin-glasses and neural networks of higher orders. Physical Review Letters, 58(9), p.913.
  • (14) Gardner, E., 1987. Multiconnected neural network models. Journal of Physics A: Mathematical and General, 20(11), p.3453.
  • (15) Abbott, L.F. and Arian, Y., 1987. Storage capacity of generalized networks. Physical Review A, 36(10), p.5091.
  • (16) Horn, D. and Usher, M., 1988. Capacities of multiconnected memory models. Journal de Physique, 49(3), pp.389-395.
  • (17) Minsky, M. and Papert, S., 1969. Perceptron: an introduction to computational geometry. The MIT Press, Cambridge, expanded edition, 19(88), p.2.
  • (18) Simard, P.Y., Steinkraus, D. and Platt, J.C., 2003, August. Best practices for convolutional neural networks applied to visual document analysis. In null (p. 958). IEEE.
  • (19) Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I. and Salakhutdinov, R., 2014. Dropout: A simple way to prevent neural networks from overfitting. The Journal of Machine Learning Research, 15(1), pp.1929-1958.
  • (20) Wan, L., Zeiler, M., Zhang, S., LeCun, Y. and Fergus, R., 2013. Regularization of neural networks using dropconnect. In Proceedings of the 30th International Conference on Machine Learning (ICML-13) (pp. 1058-1066).
  • (21) Goodfellow, I.J., Shlens, J. and Szegedy, C., 2014. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572.
  • (22)

    Rasmus, A., Berglund, M., Honkala, M., Valpola, H. and Raiko, T., 2015. Semi-supervised learning with ladder networks. In Advances in Neural Information Processing Systems (pp. 3546-3554).