Unsupervised representation learning with recognition-parametrised probabilistic models
Not on the map. Why?
Abstract (arXiv)
We introduce a new approach to probabilistic unsupervised learning based on the recognition-parametrised model (RPM): a normalised semi-parametric hypothesis class for joint distributions over observed and latent variables. Under the key assumption that observations are conditionally independent given latents, the RPM combines parametric prior and observation-conditioned latent distributions with non-parametric observation marginals. This approach leads to a flexible learnt recognition model capturing latent dependence between observations, without the need for an explicit, parametric generative model. The RPM admits exact maximum-likelihood learning for discrete latents, even for powerful neural-network-based recognition. We develop effective approximations applicable in the continuous-latent case. Experiments demonstrate the effectiveness of the RPM on high-dimensional data, learning image classification from weak indirect supervision; direct image-level latent Dirichlet allocation; and recognition-parametrised Gaussian process factor analysis (RP-GPFA) applied to multi-factorial spatiotemporal datasets. The RPM provides a powerful framework to discover meaningful latent structure underlying observational data, a function critical to both animal and artificial intelligence.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 16 of its 44 references that are in the map. First posted on arXiv 13 Sep 2022.
Builds on
16 of 44 references.
References · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2017Neural Discrete Representation Learningcited by 4,712
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2021Variational Diffusion Modelscited by 1,153
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2015Importance Weighted Autoencoderscited by 456
- 2018Unity: A General Platform for Intelligent Agentscited by 236
- 2016Composing graphical models with neural networks for structured representations and fast inferencecited by 113
- 2017Filtering Variational Objectivescited by 91
- 2019The Thermodynamic Variational Objectivecited by 26
4 more
- 2020Sparse Gaussian Process Variational Autoencoderscited by 21
- 2019A neurally plausible model learns successor representations in partially observable environmentscited by 12
- 2018Flexible and accurate inference and learning for deep generative modelscited by 9
- 2020Amortised Learning by Wake-Sleepcited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 2.
5 papers.
- 2026Understanding Self-Supervised Learning via Latent Distribution Matchingcited by 4
- 2025Maximum Likelihood Learning of Latent Dynamics Without Reconstructioncited by 3
- 2025Probabilistic Variational Contrastive Learningcited by 2
- 2023Prediction under Latent Subgroup Shifts with High-Dimensional Observationscited by 0
- 2026RAMP: Recognition parametrisation by Amortised Message Passingcited by 0
- 2026RAMP: Recognition parametrisation by Amortised Message Passing21 Jul 2026
- 2026Understanding Self-Supervised Learning via Latent Distribution Matching5 May 2026
- 2025Probabilistic Variational Contrastive Learning11 Jun 2025
- 2025Maximum Likelihood Learning of Latent Dynamics Without Reconstruction29 May 2025
- 2023Prediction under Latent Subgroup Shifts with High-Dimensional Observations23 Jun 2023