We lifted 2 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| mariaref/nonlinearshallowae | canonical | 0 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| test | Not yet run | mariaref/nonlinearshallowae/train_autoencoder.py pointer only (licence: NONE) · get_code("69e9284c4f5bf028") |
| test | Not yet run | mariaref/nonlinearshallowae/truncated_vanilla_SGD.py pointer only (licence: NONE) · get_code("492ecc42d8371fd4") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Autoencoders are the simplest neural network for unsupervised learning, and thus an ideal framework for studying feature learning. While a detailed understanding of the dynamics of linear autoencoders has recently been obtained, the study of non-linear autoencoders has been hindered by the technical difficulty of handling training data with non-trivial correlations - a fundamental prerequisite for feature extraction. Here, we study the dynamics of feature learning in non-linear, shallow autoencoders. We derive a set of asymptotically exact equations that describe the generalisation dynamics of autoencoders trained with stochastic gradient descent (SGD) in the limit of high-dimensional inputs. These equations reveal that autoencoders learn the leading principal components of their inputs sequentially. An analysis of the long-time dynamics explains the failure of sigmoidal autoencoders to learn with tied weights, and highlights the importance of training the bias in ReLU autoencoders. Building on previous results for linear networks, we analyse a modification of the vanilla SGD algorithm which allows learning of the exact principal components. Finally, we show that our equations accurately describe the generalisation dynamics of non-linear autoencoders on realistic datasets such as CIFAR10.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.02115")
get_code_for_paper("2201.02115")
have("2201.02115")
Connect an agent — have() is free.