Conditional Variational Inference Overview

• Conditional Variational Inference is a framework of methods that approximate conditional posteriors by explicitly conditioning variational distributions on observed data or neighboring latent variables.
• It is applied in diverse settings such as CVAE-based dynamic PET and kilonova analyses, multinomial probit models, and hierarchical Bayesian nonparametrics.
• These techniques enhance computational efficiency and model accuracy through amortized inference and structured variational families, though they may trade off exactness for speed.

Searching arXiv for the cited papers and closely related CVI terminology to ground the article. Conditional variational inference is not a single universally standardized algorithmic object. In current usage, the phrase denotes variational methods in which the approximation targets a conditional distribution and explicitly conditions either the variational law, the generative model, or both on observed variables. The literature covered here contains two distinct but related meanings. In one meaning, conditional variational inference refers to amortized conditional posterior estimation with conditional latent-variable models such as conditional variational autoencoders (CVAEs), where the goal is to approximate distributions such as $p(\mathbf{x}\mid \mathbf{y})$ or $p(x\mid c)$ by sampling a latent variable and decoding conditionally on the observation (Liu et al., 2023, Saha et al., 17 May 2026). In another meaning, “CVI” is an established acronym for “Conjugate-Computation Variational Inference,” a specific method for partly non-conjugate probabilistic models; that algorithm is not the same as conditional variational inference, and several papers explicitly warn against conflating the two usages (Khan et al., 2017, Kim et al., 15 Jul 2025).

1. Terminological scope and competing uses of “CVI”

The most immediate source of confusion is terminological. The paper "Conjugate-Computation Variational Inference : Converting Variational Inference in Non-Conjugate Models to Inferences in Conjugate Models" (Khan et al., 2017) defines CVI as Conjugate-Computation Variational Inference, not conditional variational inference. Its subject is variational inference in models containing both conjugate and non-conjugate terms, using stochastic mirror descent in mean-parameter space together with conjugate updates (Khan et al., 2017).

By contrast, several later papers use language that is conditional in a different sense. The dynamic PET paper formulates posterior estimation as approximation of the conditional posterior $p(\mathbf{x}\mid \mathbf{y})$ with a CVAE and describes the trained decoder as an amortized conditional sampler (Liu et al., 2023). The kilonova paper likewise treats the target as a conditional distribution over physical parameters given a light curve and uses a CVAE for rapid parameter inference (Saha et al., 17 May 2026). The multinomial probit paper uses “conditional variational inference” to mean an amortized neural approximation to the conditional posterior of latent utilities given the observed choice and covariates, $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$ (Kim et al., 15 Jul 2025). CATVI uses “conditional” to describe a structured variational family in which some variational factors remain conditional on adjacent latent variables rather than being fully mean-field (Liu et al., 2020).

These usages are related by a common idea: the variational approximation is enriched by preserving or learning dependence on observed variables or neighboring latent variables. A plausible implication is that “conditional variational inference” is best understood as a family of design patterns rather than a single canonical algorithm. The specific mechanism can be amortized latent-variable modeling, structured variational factorization, or a conditional approximation to a latent posterior.

2. Core probabilistic idea: approximating conditional posteriors

Across the cited works, the central target is a conditional posterior rather than a marginal latent distribution. In dynamic PET, the hidden variables are kinetic parameters

$\mathbf{x}=\{DVR,k_2,R_1\},$

the observed variable is the measured time-activity curve $\mathbf{y}$, and the target posterior is

$$p(\mathbf{x}\mid \mathbf{y}) \propto p(\mathbf{y}\mid \mathbf{x})\,p(\mathbf{x}).$$

The paper emphasizes that the inverse map from $\mathbf{y}$ to $\mathbf{x}$ is ambiguous because the forward process loses information, so posterior estimation is preferred to deterministic regression (Liu et al., 2023).

The kilonova work uses analogous notation. Let $x$ denote the physical parameter vector and $p(x\mid c)$0 the observed light-curve features. The learned object is a conditional generative model for $p(x\mid c)$1 given $p(x\mid c)$2, mediated by a latent variable $p(x\mid c)$3, written as

$p(x\mid c)$4

or, in the simpler CVAE variant reconstructed in the paper,

$p(x\mid c)$5

The paper’s deployed model is therefore best interpreted as amortized approximate posterior inference for $p(x\mid c)$6 (Saha et al., 17 May 2026).

The multinomial probit formulation is different in target but similar in structure. There the latent variables are utility vectors $p(x\mid c)$7, the observations are $p(x\mid c)$8, and the central object is the conditional posterior

$p(x\mid c)$9

which is approximated by a shared amortized variational family

$p(\mathbf{x}\mid \mathbf{y})$0

The conditioning is explicit on the observed choice and covariates, and the structural parameters are estimated jointly with the variational approximation (Kim et al., 15 Jul 2025).

CATVI generalizes the same conditional logic to hierarchical Bayesian nonparametric models. Instead of a fully factorized variational family, it uses

$p(\mathbf{x}\mid \mathbf{y})$1

so the middle-layer random measures remain conditionally coupled to their parent and child variables (Liu et al., 2020).

3. CVAE-based conditional variational inference

In the CVAE-based line of work, the defining move is to introduce a latent variable that captures variability remaining after conditioning on the observation. In dynamic PET, the paper motivates $p(\mathbf{x}\mid \mathbf{y})$2 as capturing “the loss of information in the forward process,” with prior

$p(\mathbf{x}\mid \mathbf{y})$3

encoder

$p(\mathbf{x}\mid \mathbf{y})$4

and decoder

$p(\mathbf{x}\mid \mathbf{y})$5

The trained decoder is interpreted as representing the posterior $p(\mathbf{x}\mid \mathbf{y})$6 by pushing forward latent samples through a $p(\mathbf{x}\mid \mathbf{y})$7-dependent deterministic map (Liu et al., 2023).

The corresponding conditional ELBO is written as

$p(\mathbf{x}\mid \mathbf{y})$8

and implemented as

$p(\mathbf{x}\mid \mathbf{y})$9

The encoder and decoder are simple multilayer perceptrons with three fully connected layers each, the latent dimension is $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$0, and inference consists of fixing $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$1, sampling $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$2, and decoding repeatedly to obtain an empirical approximate posterior (Liu et al., 2023).

The kilonova paper follows the same CVAE pattern. Its encoder maps $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$3 to a Gaussian latent distribution,

$$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$4

with two-dimensional latent variable $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$5. The decoder defines $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$6, and the reconstructed training loss is the familiar decomposition

$$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$7

where the reconstruction term corresponds to MSE on the four-dimensional parameter vector (Saha et al., 17 May 2026).

Both papers use the reparameterization trick,

$$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$8

or the equivalent $$q_{\boldsymbol{\xi}}(\boldsymbol{u}_i\mid \boldsymbol{y}_i,X_i)$$9, to enable gradient-based optimization through stochastic latent samples (Liu et al., 2023, Saha et al., 17 May 2026). In both cases, uncertainty is represented implicitly by latent sampling rather than by an explicitly flexible closed-form posterior density.

A recurring interpretation in this line of work is that the decoder acts as an amortized conditional sampler. This suggests a transport view of conditional variational inference: a simple latent prior is pushed through a condition-dependent nonlinear map to induce an implicit distribution on the target variable.

4. Conditional variational approximations beyond CVAEs

Conditional variational inference also appears outside the CVAE framework. The multinomial probit paper is the clearest example. Its latent utility model is

$\mathbf{x}=\{DVR,k_2,R_1\},$0

and the observed choice is determined by the argmax of utilities (Kim et al., 15 Jul 2025). Direct posterior inference is difficult because conditioning on the observed choice produces high-dimensional truncated Gaussian distributions. The proposed remedy is to approximate the conditional posterior of utilities by a neural Gaussian encoder: $\mathbf{x}=\{DVR,k_2,R_1\},$1

Its objective is the negative ELBO

$\mathbf{x}=\{DVR,k_2,R_1\},$2

with an identified version computed in differenced utility space (Kim et al., 15 Jul 2025). The method’s distinctive ingredients are a full correlated Gaussian variational family, an $\mathbf{x}=\{DVR,k_2,R_1\},$3 covariance parameterization to guarantee positive definiteness, trace-normalized covariance regularization for identification, and straight-through estimation with Gumbel-Softmax to handle the argmax choice map without truncated Gaussian sampling (Kim et al., 15 Jul 2025).

CATVI provides a different non-amortized conditional construction. Its key variational factor

$\mathbf{x}=\{DVR,k_2,R_1\},$4

restores dependence between group-level random measures, the top-level random measure, and local assignments. The paper shows that the optimal conditional factor is exactly

$\mathbf{x}=\{DVR,k_2,R_1\},$5

which is a structurally conditional variational move rather than a learned amortized one (Liu et al., 2020). The corresponding objective is a nonparametric evidence lower bound satisfying

$\mathbf{x}=\{DVR,k_2,R_1\},$6

A nearby but distinct methodology appears in "Gradient-free variational learning with conditional mixture networks" (Heins et al., 2024). That paper is not about the specific CVI algorithm and is described instead as a conditionally conjugate CAVI method. Its relevance lies in the fact that the approximate posterior is structured rather than fully mean-field,

$\mathbf{x}=\{DVR,k_2,R_1\},$7

and Pólya–Gamma augmentation restores conjugacy for multinomial logistic blocks, enabling analytic coordinate-ascent updates (Heins et al., 2024). A plausible implication is that conditional variational structure and conditional conjugacy are often complementary rather than competing ideas.

5. Objectives, architectures, and optimization mechanisms

The concrete implementations differ, but their objectives share a recognizable template: a reconstruction or likelihood-matching term plus a regularizer that ties the variational distribution to a prior or structural model.

The table below summarizes the main instantiations discussed in the cited papers.

Setting	Conditional target	Main variational mechanism
Dynamic PET (Liu et al., 2023)	$\mathbf{x}=\{DVR,k_2,R_1\},$8	CVAE with Gaussian latent prior and MSE + KL loss
Kilonova inference (Saha et al., 17 May 2026)	$\mathbf{x}=\{DVR,k_2,R_1\},$9	CVAE with Gaussian latent space and MSE-based reconstruction
Multinomial probit (Kim et al., 15 Jul 2025)	$\mathbf{y}$0	Amortized neural Gaussian encoder with analytic Gaussian KL
HBNP topic models (Liu et al., 2020)	Structured posterior over $\mathbf{y}$1	Conditional variational factorization and adaptive truncation
Conditional mixture networks (Heins et al., 2024)	Structured posterior over local latents and parameters	Conditionallly conjugate CAVI with Pólya–Gamma augmentation

In the CVAE papers, the optimization is standard stochastic gradient training with the reparameterization trick (Liu et al., 2023, Saha et al., 17 May 2026). In the multinomial probit paper, the encoder is amortized but the structural parameters are also learned jointly, with minibatch stochastic optimization, ADAM, GPU-based parallelism, and annealed Gumbel temperature (Kim et al., 15 Jul 2025). In CATVI, Monte Carlo Gibbs sampling of local assignments is embedded inside stochastic variational updates of global factors, and adaptive truncation expands posterior dimension when sampled assignments enter the residual component $\mathbf{y}$2 (Liu et al., 2020). In the conditional mixture network paper, coordinate ascent replaces gradient-based ELBO optimization once augmentation furnishes conditionally conjugate Gaussian blocks (Heins et al., 2024).

One substantive difference concerns what receives a full posterior approximation. The PET and kilonova CVAE papers approximate conditional posteriors over target parameters and deploy the decoder as a sampler (Liu et al., 2023, Saha et al., 17 May 2026). The multinomial probit paper approximates the posterior of latent utilities but returns point estimates for structural parameters $\mathbf{y}$3, with uncertainty quantification delegated to bootstrap rather than being native to the objective (Kim et al., 15 Jul 2025). CATVI approximates a structured posterior process but still factorizes some components, so it is not a full posterior coupling (Liu et al., 2020).

6. Empirical roles, benefits, and limitations

The empirical motivation is almost always computational. In dynamic PET, MCMC is treated as an unbiased asymptotic reference posterior, but it is expensive. For the single-voxel SRTM setting, PyMC-based MCMC takes about 10 minutes to infer 90,000 samples, whereas the trained CVAE can infer 90,000 samples in about 30 seconds; the paper emphasizes that MCMC must be rerun for each new $\mathbf{y}$4, while the CVAE amortizes this cost across all future test examples once training is complete (Liu et al., 2023).

The kilonova paper makes the same amortization argument. Training completes in about $\mathbf{y}$5 hour on CPU only, generating 1000 physical-parameter samples across models and filters takes about $\mathbf{y}$6 ms, and the abstract states that the total time from training to parameter inference is under $\mathbf{y}$7 h (Saha et al., 17 May 2026).

The multinomial probit results emphasize scale in both sample size and number of alternatives. The proposed method calibrates MNP parameters with 20 alternatives and one million observations in approximately 28 minutes, roughly 36 times faster and more accurate than the existing benchmarks in recovering model parameters (Kim et al., 15 Jul 2025). Its main computational gain comes from eliminating truncated Gaussian sampling altogether by replacing exact conditioning on the argmax event with unconstrained Gaussian encoder samples and differentiable surrogate decoding (Kim et al., 15 Jul 2025).

CATVI’s empirical claim is that conditional structure and adaptive truncation improve fit in hierarchical Bayesian nonparametric models. On arXiv, NYT, and Wiki, CATVI applied to HDP and $\mathbf{y}$8DP yields lower perplexity than OVI, MOVI, SMVI, and Gibbs sampling, and the number of topics rises from the initial value and then stabilizes (Liu et al., 2020).

These gains are paired with recurrent caveats. The PET paper notes that the variational family is restricted by a Gaussian latent prior and a diagonal Gaussian encoder posterior, the decoder is trained with MSE rather than a richer explicit conditional density, the latent dimension $\mathbf{y}$9 is an empirical choice, training and testing both use the same forward/noise model, and experiments are limited to low-dimensional posterior estimation for a single region or voxel (Liu et al., 2023). The kilonova paper similarly identifies sparse and discrete training grids, a two-dimensional latent bottleneck, and lack of guaranteed calibrated posteriors as limiting factors (Saha et al., 17 May 2026). The multinomial probit paper notes approximation error from the Gaussian variational family, possible bias from the Gumbel-Softmax relaxation and straight-through mismatch, point estimation rather than full posterior inference for structural parameters, and potential amortization gap (Kim et al., 15 Jul 2025). CATVI explicitly states that estimation of the number of topics is not consistent (Liu et al., 2020).

A plausible implication is that conditional variational inference systematically exchanges some form of exactness for reuse: the posterior approximation cost is paid in optimization or training, then reused across observations or throughout a hierarchy.

7. Relationship to conjugate-computation CVI and broader variational inference

Because the acronym CVI is overloaded, the distinction from conjugate-computation CVI is essential. The 2017 CVI paper considers models decomposable as

$$p(\mathbf{x}\mid \mathbf{y}) \propto p(\mathbf{y}\mid \mathbf{x})\,p(\mathbf{x}).$$0

with an exponential-family variational approximation

$$p(\mathbf{x}\mid \mathbf{y}) \propto p(\mathbf{y}\mid \mathbf{x})\,p(\mathbf{x}).$$1

Its core update accumulates stochastic gradients of the expected non-conjugate log-term in mean-parameter space and combines them with conjugate natural parameters through

$$p(\mathbf{x}\mid \mathbf{y}) \propto p(\mathbf{y}\mid \mathbf{x})\,p(\mathbf{x}).$$2

so that each step can be interpreted as inference in a conjugate model (Khan et al., 2017).

This algorithm is methodologically different from the conditional approaches above. The dynamic PET and kilonova papers are standard CVAE constructions for supervised conditional generation or inverse inference, not mirror-descent CVI (Liu et al., 2023, Saha et al., 17 May 2026). The multinomial probit paper states explicitly that “CVI” there does not mean the conjugate-computation framework from the broader variational literature; instead it means a conditional variational approximation to the posterior of latent utilities (Kim et al., 15 Jul 2025). CATVI likewise uses “conditional” in a model-specific sense of conditioning variational laws of middle-layer random measures on neighboring latent variables, not in the sense of the Khan and Lin algorithm (Liu et al., 2020). The conditional mixture network paper is related to CVI-style conjugacy exploitation but is described as CAVI rather than the specific CVI algorithm (Heins et al., 2024).

The broader methodological connection is still clear. All these methods enlarge or restructure the variational family to better align with posterior dependence while maintaining tractability. In some cases, tractability comes from amortized neural sampling (Liu et al., 2023, Saha et al., 17 May 2026); in others, from structured conditional Gaussian families and differentiable relaxations (Kim et al., 15 Jul 2025); in others, from exact conditional factors and adaptive truncation (Liu et al., 2020); and in others, from conditional conjugacy restored through augmentation (Heins et al., 2024).

Taken together, the literature supports a precise but plural definition: conditional variational inference is a class of variational strategies in which the approximation is explicitly conditional—on observations, on neighboring latent variables, or on both—and is designed to represent ambiguity, residual uncertainty, or hierarchical dependence that would be lost under deterministic inversion or fully factorized mean-field approximations.