RAMP: Recognition parametrisation by Amortised Message Passing

• URL: http://arxiv.org/abs/2607.18883v1
• Date: Tue, 21 Jul 2026 09:13:29 GMT
• Title: RAMP: Recognition parametrisation by Amortised Message Passing
• Abstract summary: RAMP is a method that implicitly defines latent structure by learning a flexible, nonlinear, amortised message-passing framework.<n>We show that RAMP enables efficient likelihood-based recovery of latent-variable distributions within expressive nonlinear models acting on complex high-dimensional data.
• Score: 6.969815276025336
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A central aim of unsupervised learning is to uncover latent factors that explain dependencies among observations. Probabilistic models typically achieve this by introducing multiple latent variables linked through a graph of conditional relationships, with distributional parameters and their dependence learnt from data. Learning relies either on distributional choices that allow tractable belief propagation, or on approximations that scale poorly with model size and complexity. We build on the recently developed recognition-parametrised modelling paradigm to propose an alternative approach: RAMP, a method that implicitly defines latent structure by learning a flexible, nonlinear, amortised message-passing framework. We show that RAMP enables efficient likelihood-based recovery of latent-variable distributions within expressive nonlinear models acting on complex high-dimensional data.

Related papers

• Graphical conditional generative modeling for digital twin modeling [7.0264064660746754]
  We introduce a framework for building parsimonious surrogate models from observational data.<n>We identify which candidate inputs influence the full conditional law of a target quantity, rather than only its conditional mean.<n>In control settings, the method identifies not only a transition model, but also the state action, and memory variables needed to make the learned dynamics effectively Markovian.
  arXiv  Detail & Related papers  (2026-06-15T04:56:38Z)
• Structured Nonparametric Variational Inference for Dependent Latent Modeling [11.146941243243248]
  Variational inference (VI) is a core engine of modern AI, enabling scalable learning and uncertainty-aware training of large probabilistic and generative models.<n>We propose Structured Non Variational Inference (SN-VI), a novel framework for modeling complex dependencies among latent variables in posterior approximation.<n> SN-VI preserves intricate latent variable dependencies, providing a flexible and accurate approximation of posterior boundeds with arbitrary shapes.
  arXiv  Detail & Related papers  (2026-06-13T20:29:04Z)
• Joint Model and Data Sparsification via the Marginal Likelihood [53.29070892356214]
  We propose jointly learning individual feature and sample relevancies, enabling simultaneous model and data sparsification.<n>This symmetric pruning of model and data offers a natural extension that preserves conjugacy.<n> Empirical results across diverse regression tasks affirm that a joint ARD approach consistently yields both sparse and robust prediction models.
  arXiv  Detail & Related papers  (2026-05-28T13:26:53Z)
• Nonparametric Data Attribution for Diffusion Models [57.820618036556084]
  Data attribution for generative models seeks to quantify the influence of individual training examples on model outputs.<n>We propose a nonparametric attribution method that operates entirely on data, measuring influence via patch-level similarity between generated and training images.
  arXiv  Detail & Related papers  (2025-10-16T03:37:16Z)
• Induced Covariance for Causal Discovery in Linear Sparse Structures [55.2480439325792]
  Causal models seek to unravel the cause-effect relationships among variables from observed data. This paper introduces a novel causal discovery algorithm designed for settings in which variables exhibit linearly sparse relationships.
  arXiv  Detail & Related papers  (2024-10-02T04:01:38Z)
• Graph-based Unsupervised Disentangled Representation Learning via Multimodal Large Language Models [42.17166746027585]
  We introduce a bidirectional weighted graph-based framework to learn factorized attributes and their interrelations within complex data. Specifically, we propose a $beta$-VAE based module to extract factors as the initial nodes of the graph. By integrating these complementary modules, our model successfully achieves fine-grained, practical and unsupervised disentanglement.
  arXiv  Detail & Related papers  (2024-07-26T15:32:21Z)
• Parameter Estimation in DAGs from Incomplete Data via Optimal Transport [24.740382124473975]
  We develop a theoretical framework and support it with extensive empirical evidence demonstrating the robustness and versatility of our approach. We show that not only can our method effectively recover the ground-truth parameters but it also performs comparably or better than competing baselines on downstream applications.
  arXiv  Detail & Related papers  (2023-05-25T10:54:36Z)
• Variable Importance Matching for Causal Inference [73.25504313552516]
  We describe a general framework called Model-to-Match that achieves these goals. Model-to-Match uses variable importance measurements to construct a distance metric. We operationalize the Model-to-Match framework with LASSO.
  arXiv  Detail & Related papers  (2023-02-23T00:43:03Z)
• Latent Variable Representation for Reinforcement Learning [131.03944557979725]
  It remains unclear theoretically and empirically how latent variable models may facilitate learning, planning, and exploration to improve the sample efficiency of model-based reinforcement learning. We provide a representation view of the latent variable models for state-action value functions, which allows both tractable variational learning algorithm and effective implementation of the optimism/pessimism principle. In particular, we propose a computationally efficient planning algorithm with UCB exploration by incorporating kernel embeddings of latent variable models.
  arXiv  Detail & Related papers  (2022-12-17T00:26:31Z)
• Amortised Inference in Structured Generative Models with Explaining Away [16.92791301062903]
  We extend the output of amortised variational inference to incorporate structured factors over multiple variables. We show that appropriately parameterised factors can be combined efficiently with variational message passing in elaborate graphical structures. We then fit the structured model to high-dimensional neural spiking time-series from the hippocampus of freely moving rodents.
  arXiv  Detail & Related papers  (2022-09-12T12:52:15Z)
• MINIMALIST: Mutual INformatIon Maximization for Amortized Likelihood Inference from Sampled Trajectories [61.3299263929289]
  Simulation-based inference enables learning the parameters of a model even when its likelihood cannot be computed in practice. One class of methods uses data simulated with different parameters to infer an amortized estimator for the likelihood-to-evidence ratio. We show that this approach can be formulated in terms of mutual information between model parameters and simulated data.
  arXiv  Detail & Related papers  (2021-06-03T12:59:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.