ByPE-VAE: Bayesian Pseudocoresets in VAEs

• The paper introduces ByPE-VAE, which replaces a full-data mixture prior with a learned pseudocoreset prior to reduce computational cost while maintaining high performance.
• ByPE-VAE employs an alternating training procedure that dynamically updates both VAE parameters and pseudocoreset elements using efficient gradient-based KL minimization.
• Empirical results on datasets like MNIST, CIFAR-10, and CelebA demonstrate that ByPE-VAE improves density estimation, latent clustering, and training efficiency compared to traditional VAE variants.

ByPE-VAE (Bayesian Pseudocoresets Exemplar Variational Autoencoder) is a deep generative modeling framework that extends the standard variational autoencoder (VAE) architecture by introducing a data-dependent mixture prior based on a small, learned pseudocoreset, rather than the full dataset. By dynamically optimizing both the pseudocoreset elements and their mixture weights to closely match the ideal full-data-based mixture prior in Kullback-Leibler (KL) divergence, ByPE-VAE combines the expressive power of exemplar-based priors with significant computational efficiency and implicit regularization against overfitting. The approach demonstrates improvements across density estimation, unsupervised representation learning, and generative data augmentation tasks compared to traditional VAE variants and other advanced prior formulations (Ai et al., 2021).

1. Model Formulation and Theoretical Foundations

Given a sample $x$ from a dataset $X$ and latent variable $z\in\mathbb{R}^{d_z}$, the standard VAE maximizes the evidence lower bound (ELBO):

$$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$

where $p_0(z)$ is typically the standard normal prior.

Exemplar VAE [Norouzi et al. 2020] replaces the standard normal prior with a data-dependent mixture:

$$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$

where each $r_\phi(z|x_n)$ is a Gaussian whose mean and variance are produced by a learned network.

ByPE-VAE introduces a further innovation: it replaces the sum over all data points (computationally prohibitive for large $N$) by a mixture over a learned, weighted pseudocoreset $U = \{u_m\}_{m=1}^M$ ($M \ll N$) with nonnegative weights $X$0 ($X$1):

$X$2

This pseudocoreset mixture prior is trained to minimize $X$3—i.e., to approximate the full data-dependent mixture.

The explicit ELBO optimized in ByPE-VAE is (dropping additive constants):

$X$4

2. Pseudocoreset Construction and KL Minimization

The pseudocoreset $X$5 is chosen to minimize the KL divergence between the pseudocoreset mixture prior and the (intractable) full-data mixture prior:

$X$6

The KL divergence admits a gradient representation via covariances under the $X$7 posterior:

• Gradient w.r.t. pseudocoreset points $X$8:

$X$9

• Gradient w.r.t. weights $z\in\mathbb{R}^{d_z}$0:

$z\in\mathbb{R}^{d_z}$1

Specializing to Gaussian $z\in\mathbb{R}^{d_z}$2, the gradients are efficiently computed by backpropagation through the generator network for means.

In practice, stochastic gradients are formed by sampling $z\in\mathbb{R}^{d_z}$3 and minibatches from $z\in\mathbb{R}^{d_z}$4, enabling scalable KL minimization even for moderate $z\in\mathbb{R}^{d_z}$5 and large $z\in\mathbb{R}^{d_z}$6.

3. Alternating Training Procedure

ByPE-VAE employs a two-step alternating optimization:

1. VAE Parameter Step: With $z\in\mathbb{R}^{d_z}$7 fixed, update encoder and decoder parameters $z\in\mathbb{R}^{d_z}$8 by maximizing the ELBO above over minibatches.
2. Pseudocoreset Step: Every $z\in\mathbb{R}^{d_z}$9 epochs (empirically, $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$0 suffices), update both the pseudocoreset points and weights using stochastic estimates of the KL gradients as described.

The initialization starts by uniformly sampling $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$1 pseudopoints from $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$2, with equal weights ($$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$3). Pseudocoreset updates are projected to maintain nonnegativity and preserve the total weight constraint. Overall complexity is dominated by the VAE step (which is amortized for small $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$4) and by the coreset step when $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$5 is small.

4. Experimental Evaluation and Results

ByPE-VAE is evaluated on density estimation, representation learning, and generative data augmentation over several standard datasets: Dynamic MNIST, Fashion MNIST, CIFAR-10, and CelebA. Architectures involve both MLP and CNN backbones, with latent dimension $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$6 and $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$7 (or $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$8 for CelebA).

Key empirical findings include:

• Density Estimation: On Dynamic MNIST, Fashion MNIST, and CIFAR-10, ByPE-VAE achieves the best test negative log-likelihood (NLL), outperforming VAE+Gaussian, VAE+VampPrior, and Exemplar VAE mixtures.
• Training Efficiency: ByPE-VAE reduces training time per epoch by approximately $$L(\theta,\phi; x) = \mathbb{E}_{q_\phi(z|x)}[\log p_\theta(x|z)] - \mathrm{KL}(q_\phi(z|x)\,\|\,p_0(z)),$$9 relative to Exemplar VAE—13.2 s vs. 35.5 s (Dynamic MNIST, $p_0(z)$0 vs. $p_0(z)$1 components).
• Latent Representations: t-SNE visualization of MNIST embeddings reveals tighter clusters and improved inter-class separation. kNN classification accuracy (on learned codes) is consistently higher under ByPE-VAE for all $p_0(z)$2.
• Data Augmentation: Discriminative test error on permutation-invariant MNIST with augmented samples: ByPE-VAE achieves $p_0(z)$3 (posterior sampling), $p_0(z)$4 (prior) vs. $p_0(z)$5 for Exemplar.
• Ablation Analyses: Performance remains stable as pseudocoreset update interval $p_0(z)$6 increases up to 50; ByPE-VAE outperforms Exemplar variants with equal coreset size.

Empirical Comparisons

Method	Dyn MNIST (NLL)	Fash MNIST (NLL)	CIFAR-10 (NLL)	Training Time/Epoch (Dyn MNIST, s)
VAE+Gauss prior	24.41	21.43	72.21	—
VAE+VampPrior	23.65	20.87	71.97	13.0
VAE+Exemplar	23.83	21.00	72.55	35.5
ByPE-VAE	23.61	20.85	71.91	13.2

This demonstrates that ByPE-VAE matches or exceeds benchmarks on both data efficiency and sample quality (Ai et al., 2021).

5. Analysis of Computational and Statistical Properties

Computational Efficiency: ByPE-VAE's computational savings result from replacing a full sum over $p_0(z)$7 exemplars in the prior with a sum over $p_0(z)$8 learned pseudopoints. Because pseudocoreset updates are amortized (run every $p_0(z)$9 epochs), the additional cost is negligible relative to the overall VAE training cycle.

Regularization and Overfitting Avoidance: Pseudocoreset construction acts as an implicit regularizer. Only a small set of points and their weights are used to assemble the mixture prior, mitigating risks of overfitting or memorization associated with full-dataset-dependent priors.

Optimization and Sensitivity: The KL-based pseudocoreset adaptation is sensitive to hyperparameters $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$0, $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$1, and $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$2, as well as initialization; if $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$3 is too small or initialization is poor, the coreset may underfit the true data distribution.

6. Limitations and Possible Extensions

While ByPE-VAE achieves substantial improvements, limitations remain:

• Coreset Update Overhead: The requisite stochastic updates for pseudocoreset points and weights still incur nontrivial cost (proportional to positive integers $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$4, $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$5, $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$6).
• Hyperparameter Sensitivity: Careful selection of $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$7, $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$8, and learning rates $$p_\phi(z|X) = \frac{1}{N}\sum_{n=1}^N r_\phi(z|x_n),$$9 is necessary to avoid degraded performance.
• Potential Underfitting: If the coreset size $r_\phi(z|x_n)$0 is too small, the induced prior may not adequately match the full-data mixture, especially for complex data or highly multi-modal latent structures.

Proposed extensions and areas for future work include:

• Amortized pseudocoresets: replacing static pseudopoints with a generative model of $r_\phi(z|x_n)$1.
• Hierarchical pseudocoreset priors: employing clusters within clusters to further enhance prior expressiveness.
• Application to advanced likelihood models: incorporating pseudocoresets into normalizing flow architectures.
• Dynamic coreset adjustment: growing or pruning $r_\phi(z|x_n)$2 dynamically during training to maintain model flexibility.

A plausible implication is that pseudocoresets could be adapted for other Bayesian deep learning settings that benefit from expressive, computationally efficient data-dependent priors.

7. Context and Broader Impact in Variational Learning

ByPE-VAE demonstrates that judiciously optimizing a lightweight, learnable pseudocoreset can enable practical approximation of highly flexible, data-dependent mixture priors, expanding the toolkit available for expressive probabilistic modeling without incurring prohibitive costs. Its success highlights the tradeoff between model complexity, inference tractability, and regularization—a central concern for variational learning frameworks. The methodology is broadly applicable across density estimation, unsupervised embedding, and generative modeling, and serves as a foundation for ongoing research into scalable, highly expressive Bayesian generative models (Ai et al., 2021).