Modeling Structured Data Learning with Restricted Boltzmann Machines in the Teacher-Student Setting
Not on the map. Why?
Abstract (arXiv)
Restricted Boltzmann machines (RBM) are generative models capable to learn data with a rich underlying structure. We study the teacher-student setting where a student RBM learns structured data generated by a teacher RBM. The amount of structure in the data is controlled by adjusting the number of hidden units of the teacher and the correlations in the rows of the weights, a.k.a. patterns. In the absence of correlations, we validate the conjecture that the performance is independent of the number of teacher patters and hidden units of the student RBMs, and we argue that the teacher-student setting can be used as a toy model for studying the lottery ticket hypothesis. Beyond this regime, we find that the critical amount of data required to learn the teacher patterns decreases with both their number and correlations. In both regimes, we find that, even with a relatively large dataset, it becomes impossible to learn the teacher patterns if the inference temperature used for regularization is kept too low. In our framework, the student can learn teacher patterns one-to-one or many-to-one, generalizing previous findings about the teacher-student setting with two hidden units to any arbitrary finite number of hidden units.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 42 of its 89 references that are in the map. First posted on arXiv 21 Oct 2024.
Builds on
42 of 89 references.
References · 42
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2016Dense Associative Memory for Pattern Recognitioncited by 230
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 146
- 2020Optimal Regularization Can Mitigate Double Descentcited by 107
- 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 97
30 more
- 2015Optimal whitening and decorrelationcited by 93
- 2018Decorrelated Batch Normalizationcited by 83
- 2020A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descentcited by 69
- 2021Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedcited by 67
- 2020Phase diagram for two-layer ReLU neural networks at infinite-width limitcited by 65
- 2020Asymptotics of Ridge (less) Regression under General Source Conditioncited by 61
- 2021Learning Gaussian Mixtures with Generalised Linear Models: Precise Asymptotics in High-dimensionscited by 52
- 2020Multiple Descent: Design Your Own Generalization Curvecited by 44
- 2021Embedding Principle of Loss Landscape of Deep Neural Networkscited by 36
- 2020Restricted Boltzmann Machine, recent advances and mean-field theorycited by 31
- 2019Batch Normalization is a Cause of Adversarial Vulnerabilitycited by 28
- 2023Improved Discretization Analysis for Underdamped Langevin Monte Carlocited by 26
- 2017Phase Diagram of Restricted Boltzmann Machines and Generalised Hopfield Networks with Arbitrary Priorscited by 25
- 2018Thermodynamics of Restricted Boltzmann Machines and related learning dynamicscited by 25
- 2016Emergence of Compositional Representations in Restricted Boltzmann Machinescited by 23
- 2016Phase transitions in Restricted Boltzmann Machines with generic priorscited by 20
- 2019Minimal model of permutation symmetry in unsupervised learningcited by 13
- 2021On the interplay between data structure and loss function in classification problemscited by 12
- 2024Cascade of phase transitions in the training of Energy-based modelscited by 12
- 2016Statistical mechanics of unsupervised feature learning in a restricted Boltzmann machine with binary synapsescited by 10
- 2013Modeling Documents with Deep Boltzmann Machinescited by 9
- 2021Stochastic Whitening Batch Normalizationcited by 9
- 2024Fast training and sampling of Restricted Boltzmann Machinescited by 8
- 2020The Quenching-Activation Behavior of the Gradient Descent Dynamics for Two-layer Neural Network Modelscited by 7
- 2023Hopfield model with planted patterns: a teacher-student self-supervised learning modelcited by 7
- 2016Unsupervised feature learning from finite data by message passing: discontinuous versus continuous phase transitioncited by 6
- 2014From Dyson to Hopfield: Processing on hierarchical networkscited by 5
- 2024Dense Hopfield Networks in the Teacher-Student Settingcited by 4
- 2017Role of zero synapses in unsupervised feature learningcited by 3
- 2022Effect of Batch Normalization on Noise Resistant Property of Deep Learning Modelscited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2024The effect of priors on Learning with Restricted Boltzmann Machinescited by 3
- 2025Saddle Hierarchy in Dense Associative Memorycited by 1
- 2025Saddle Hierarchy in Dense Associative Memory26 Aug 2025
- 2024The effect of priors on Learning with Restricted Boltzmann Machines3 Dec 2024