稀疏编码神经网络 | Baeldung中文网

1. Overview

In this tutorial, we’ll provide a quick introduction to the sparse coding neural networks concept.

Sparse coding, in simple words, is a machine learning approach in which a dictionary of basis functions is learned and then used to represent input as a linear combination of a minimal number of these basis functions.

Moreover, sparse coding seeks a compact, efficient data representation, which may be utilized for tasks such as denoising, compression, and classification.

2. Sparse Coding

In the case of sparse coding, the data is first translated into a high-dimensional feature space, where the basis functions are then employed to represent the data as a linear combination of a limited number of these basis functions.

Subject to a sparsity constraint that promotes the coefficients to be zero or nearly zero, the coefficients of linear combinations are selected to reduce the reconstruction error between the original data and the representation. So, with most of the coefficients being zero or almost zero, this sparsity constraint pushes the final representation to be a linear combination of the basis functions.

In this way, sparse coding, as previously noted, seeks to discover a usable sparse representation of any given data. Then, a sparse code will be used to encode data:

To learn the sparse representation, the sparse coding requires input data
This is incredibly helpful since you can utilize unsupervised learning to apply it straight to any data
Without sacrificing any information, it will automatically find the representation

Sparse coding techniques aim to meet the following two constraints simultaneously:

It’ll try to learn how to create a useful sparse representation as a vector $\mathbf{h}$ for a given data $\mathbf{X}$ (as a vector) using an encoder matrix $\mathbf{D}$
It’ll try to reconstruct the data $\mathbf{X}$ using a decoder matrix $\mathbf{D}$ for each representation is given as a vector $\mathbf{h}$

2.1. Mathematical Background of Sparse Coding

We assume our data $\mathbf{X}$ satisfies the following equation:

(1) $\begin{equation*} \mathbf{X} \approx \sum_{i=1}^n h_i \mathbf{d}_i=h\mathbf{D} \end{equation*}$

Sparse learning: a process that aims to train the input data and $\mathbf{x}^j, j \in\{1, \cdots, m\}$ to generate a dictionary of basis functions $\mathbf{D}$
Sparse encoding: a process that aims to learn the sparse code h using the test data $\mathbf{X}$ and the generated dictionary ( $\mathbf{D}$ )

The general form of the target function to optimize the dictionary learning process may be mathematically represented as follows:

(2) $\begin{equation*} \begin{array}{r} \min _D \frac{1}{N} \sum_{k=1}^N \min _{h_k} \frac{1}{2}\left\|x_k-D h_k\right\|_2^2+\lambda\left\|h_k\right\|_1 \\ \text { subject to }\left\|D_i\right\|_2^2 \leq C \forall i=1, \ldots, N \end{array} \end{equation*}$

In the previous equation, $\mathbf{C}$ is a constant; $\mathbf{N}$ denotes the dimensionality of data; and $\mathbf{x_k}$ means the k-given vector of the data. Furthermore, $\mathbf{h_k}$ is the sparse representation of $\mathbf{x_k}$ ; $\mathbf{D}$ is the decoder matrix (dictionary); and the coefficient of sparsity is $\mathbf{\lambda}$ .

The min expression in the general form gives the impression that we are attempting to nest two optimization issues. We can think of this as two separate optimization issues fighting to get the optimal compromise:

Outer minimization: the procedure that deals with the left side of the sum process while attempting to adjust $\mathbf{D}$ to reduce the input’s loss during the reconstruction process
Inner minimization: the procedure that attempts to increase sparsity by lowering the $\mathbf{L1-norm}$ of the sparse representation h. Said, we are trying to solve a problem (in this case, reconstruction) while utilizing the fewest resources feasible to store our data

The following algorithm performs sparse coding by iteratively updating the coefficients for each sample in the dataset, using the residuals from the previous iteration to update the coefficients for the current iteration. The sparsity constraint is enforced by setting the coefficients to zero or close to zero if they fall below a certain threshold.

algorithm SparseCodingLearningProcess(X, N, D):
    // INPUT
    //    X = the dataset with N samples and D features
    //    K = dictionary size
    //    λ = sparsity constraint
    //    max_iter = maximum number of iterations
    // OUTPUT
    //    D = the dictionary of basis functions

    // Initialize the dictionary of basis functions
    D <- a random K x D matrix

    while there is an x in X:
        r <- x

        while i < max_iter:
            while there is d in D:
                D` <- apply Eq.(2)

        D_x <- D`

    return D

3. Sparse Coding Neural Networks

From a biological perspective, sparse code follows the more all-encompassing idea of neural code. Consider the case when you have $\mathbf{N}$ binary neurons. So, basically:

The neural networks will get some inputs and deliver outputs
Some neurons in the neural network will be frequently activated while others won’t be activated at all to calculate the outputs
The average activity ratio refers to the number of activations on some data, whereas the neural code is the observation of those activations for a specific input
Neural coding is the process of instructing your neurons to produce a reliable neural code

Now that we know what a neural code is, we can speculate on what it may be like. Then, data will be encoded using a sparse code while taking into consideration the following scenarios:

No neurons are even activated
One neuron alone is activated
Half of the neurons are active
Neurons in half of the brain activate

The figure next shows an example of how a dense neural network graph is transformed into a sparse neural network graph:

dense vs sparse graph

4. Applications of Sparse Coding

Brain imaging, natural language processing, and image and sound processing all use sparse coding. Also, sparse coding has been employed in leading-edge systems in several areas and has shown to be very successful at capturing the structure of complicated data.

Resources for the implementation of sparse coding are available in several Python modules. A well-known toolkit called Scikit-learn offers a light coding module with methods for creating a dictionary of basis functions and sparsely combining these basis functions to encode data.

5. Conclusion

In short, sparse coding is a powerful machine learning technique that allows us to find compact, efficient representations of complex data. It has been widely applied to various applications such as brain imaging, natural language processing, and image and sound processing and achieved promising results.

Persistence

REST

Security