paper-with-me

Papers

Variational Polya Tree

2025-10-26 · Lu Xu, Tsai Hor Chan, Kwok Fai Lam, Lequan Yu, Guosheng Yin arxiv

Density estimation is essential for generative modeling, particularly with the rise of modern neural networks. While existing methods capture complex data distributions, they often lack interpretability and uncertainty quantification. Bayesian nonparametric methods, especially the \polya tree, offer a robust framework that addresses these issues by accurately capturing function behavior over small intervals. Traditional techniques like Markov chain Monte Carlo (MCMC) face high computational complexity and scalability limitations, hindering the use of Bayesian nonparametric methods in deep learning. To tackle this, we introduce the variational \polya tree (VPT) model, which employs stochastic variational inference to compute posterior distributions. This model provides a flexible, nonparametric Bayesian prior that captures latent densities and works well with stochastic gradient optimization. We also leverage the joint distribution likelihood for a more precise variational posterior approximation than traditional mean-field methods. We evaluate the model performance on both real data and images, and demonstrate its competitiveness with other state-of-the-art deep density estimation methods. We also explore its ability in enhancing interpretability and uncertainty quantification. Code is available at https://github.com/howardchanth/var-polya-tree.

📄 PDF Abstract BibTeX arXiv:2510.22651

Code (0)

등록된 구현이 없습니다.

Tasks

Density Estimation

Similar Papers 제목 키워드 기반

Efficient Gaussian Process Classification Using Polya-Gamma Data Augmentation

2018-02-18 · Florian Wenzel, Theo Galy-Fajou, Christan Donner, Marius Kloft 외

We propose a scalable stochastic variational approach to GP classification building on Polya-Gamma data augmentation and inducing points. Unlike former approaches, we obtain closed-form updates based on natural gradients…

ClassificationData AugmentationGeneral Classification

Momentum-based gradient descent methods for Lie groups

2024-04-14 · Cédric M. Campos, David Martín de Diego, José Torrente

Polyak's Heavy Ball (PHB; Polyak, 1964), a.k.a. Classical Momentum, and Nesterov's Accelerated Gradient (NAG; Nesterov, 1983) are well know examples of momentum-descent methods for optimization. While the latter outperfo…

Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization

2020-12-21 · Zhuoran Yang, Yufeng Zhang, Yongxin Chen, Zhaoran Wang

We consider the optimization problem of minimizing a functional defined over a family of probability distributions, where the objective functional is assumed to possess a variational form. Such a distributional optimizat…

Generative Adversarial NetworkVariational Inference

A Discrete Variational Derivation of Accelerated Methods in Optimization

2021-06-04 · Cédric M. Campos, Alejandro Mahillo, David Martín de Diego

Many of the new developments in machine learning are connected with gradient-based optimization methods. Recently, these methods have been studied using a variational perspective. This has opened up the possibility of in…

Variational Bayesian inference for CP tensor completion with side information

2022-06-24 · Stanislav Budzinskiy, Nikolai Zamarashkin

We propose a message passing algorithm, based on variational Bayesian inference, for low-rank tensor completion with automatic rank determination in the canonical polyadic format when additional side information (SI) is …

Bayesian Inference