arXiv Statistics ML
A Computable Measure of Suboptimality for Entropy-Regularised Variational Objectives
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Sep 14
A Generalized Tangent Approximation based Variational Inference Framework for Strongly Super-Gaussian Likelihoods
The paper introduces a new variational inference framework that uses tangent transformations to handle strongly super‑Gaussian likelihoods across a wide range of probability models. By constructing tangent minorants of the log‑likelihood through convex duality, the method achieves conjugacy with Gaussian priors, enabling tractable inference where traditional approaches struggle. The authors provide algorithmic convergence guarantees and near‑parametric risk bounds, and demonstrate superior scalability and accuracy on both simulated and real‑world datasets compared to existing variational algorithms.
arXiv Machine Learning
Jun 25
An Analysis of Posterior Collapse, Parameterization and Initialization in Variational Deep Gaussian Processes
arXiv:2606. 25882v1 Announce Type: new Abstract: DGPs are probabilistic models with remarkable prediction performance that concatenate GPs across several layers.
arXiv Machine Learning
Jun 9
Large-scale empirical tuning and comparison of default optimizers for variational inference
arXiv:2606. 07841v1 Announce Type: cross Abstract: Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization.
arXiv Machine Learning
Jul 28
PYPM-GGD: Pitman-Yor Process Mixture with Generalized Gaussian Density using ADAM
arXiv:2607. 24583v1 Announce Type: new Abstract: Large scale Bayesian nonparametrics (BNP) learner such as Stochastic Variational Inference (SVI) can handle datasets with large class number and large training size at fractional cost.
arXiv Machine Learning
Jul 7
Non-asymptotic Convergence of Stochastic Gradient Descent in Score-based Generative Models
arXiv:2607. 04775v1 Announce Type: cross Abstract: Score-based Generative Models (SGMs) have achieved impressive performance in data generation across a wide range of applications.
arXiv AI
Jun 16
Variance Reduction for Non-Log-Concave Sampling with Applications to Inverse Problems
arXiv:2606. 16257v1 Announce Type: cross Abstract: Sampling from high-dimensional, non-log-concave distributions with unnormalized densities is a fundamental challenge in machine learning, particularly when the exact gradient of the potential is unavailable and must be approximated via stochastic gradients that exhibit high variance under a fixed budget of gradient computations per iteration.