The paper introduces improvements to the VampPrior, a prior used in deep latent variable models. By decoupling prior and posterior covariances and replacing fixed uniform mixture weights with a Dirichlet process, the authors achieve higher model evidence and better non‑parametric clustering. Applying the enhanced prior to the single‑cell Variational Inference framework improves integration and clustering across multiple atlases while maintaining a continuous latent space.
arXiv:2607. 08254v1 Announce Type: new Abstract: Quantifying variability in a target population relative to a reference population is central to many scientific and clinical problems (e.
arXiv:2606. 19643v1 Announce Type: cross Abstract: Motivated by the privacy, sensitivity and sharing limitations of health data, we present a comprehensive pipeline for inference of Bayesian mixture models within a federated learning setting, i.
The paper introduces a scalable variational inference framework for latent field models with non‑Gaussian likelihoods. It mirrors the sparse nearest‑neighbor autoregressive structure of the Gaussian process prior in the variational family, employs normalizing‑flow conditionals for expressiveness, and amortizes all variational parameters through a single shared neural conditioner. The method achieves polylogarithmic per‑iteration complexity via doubly stochastic optimization with reduced ancestor sets.
arXiv:2603.03188v3 Announce Type: replace-cross Abstract: Density-based clustering is a well-established framework that defines clusters through topological or geometric features of the data-generati...
arXiv:2606. 25882v1 Announce Type: new Abstract: DGPs are probabilistic models with remarkable prediction performance that concatenate GPs across several layers.
arXiv:2609.00773v1 Announce Type: cross Abstract: High-dimensional clustering is challenging when component distributions are both heavy-tailed and directionally asymmetric. We propose a deep skew-$t...
CellMSA introduces a novel single‑cell representation learning framework that leverages a multiple‑sequence‑alignment‑inspired context model. For each target cell, it retrieves relevant cells across batches and related cell types, summarizing cross‑cell patterns into a context‑dependent gene‑pair representation that is fed into a pair‑aware encoder. Pretraining on a massive human single‑cell corpus (≈109 million cells) and subsequent benchmarks demonstrate consistent performance gains over existing methods.
The paper introduces a lightweight, observation-conditioned latent energy prior to improve inference for frozen implicit neural representation (INR) decoders when only sparse off‑grid signed distance function (SDF) samples are available. By standardizing latent codes based on a permutation‑invariant encoding of the sparse observations and combining this energy with a validation‑selected L2 prior, the method consistently outperforms baseline L2 and a six‑component Gaussian mixture model prior on both a controlled cell‑nucleus SDF dataset and a MedShapeNet‑derived SDF completion dataset, especially in the sparsest regimes. Ablation studies confirm that the energy term’s contribution is specific to the observed context rather than generic. whyItMatters":"The approach demonstrates that pretrained INR decoders can become more observation‑aware without retraining, improving shape completion accuracy in data‑sparse scenarios."
arXiv:2608.29335v1 Announce Type: new Abstract: Latent generative models typically follow a two-stage pipeline, training a variational autoencoder for reconstruction and then a generative model on th...
arXiv:2512. 04954v3 Announce Type: replace Abstract: We present a novel technique for amortized posterior estimation using Normalizing Flows trained with likelihood-weighted importance sampling.
arXiv:2602. 24201v2 Announce Type: replace Abstract: Estimating density ratios between pairs of intractable data distributions is a core problem in probabilistic modeling, enabling principled comparisons of sample likelihoods under different data-generating processes across conditions.
arXiv:2610.22763v1 Announce Type: new Abstract: Bayesian optimization (BO) over discrete spaces is challenging due to missing gradients and the sparsity of valid solutions. Latent-space BO sidesteps...