Stabilizing the Kumaraswamy Distribution
Not on the map. Why?
Abstract (arXiv)
Large-scale latent variable models require expressive continuous distributions that support efficient sampling and low-variance differentiation, achievable through the reparameterization trick. The Kumaraswamy (KS) distribution is both expressive and supports the reparameterization trick with a simple closed-form inverse CDF. Yet, its adoption remains limited. We identify and resolve numerical instabilities in the inverse CDF and log-pdf, exposing issues in libraries like PyTorch and TensorFlow. We then introduce simple and scalable latent variable models based on the KS, improving exploration-exploitation trade-offs in contextual multi-armed bandits and enhancing uncertainty quantification for link prediction with graph neural networks. Our results support the stabilized KS distribution as a core component in scalable variational models for bounded latent variables.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 37 references that are in the map. First posted on arXiv 1 Oct 2024.
Builds on
18 of 37 references.
References · 18
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2016Variational Graph Auto-Encoderscited by 1,382
- 2015Importance Weighted Autoencoderscited by 456
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2017Concrete Dropoutcited by 227
- 2015Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challengescited by 114
- 2018Implicit Reparameterization Gradientscited by 85
- 2021A Review on Graph Neural Network Methods in Financial Applicationscited by 78
- 2017Scalable Generalized Linear Bandits: Online Computation and Hashingcited by 64
- 2016Stick-Breaking Variational Autoencoderscited by 44
- 2019The continuous Bernoulli: fixing a pervasive error in variational autoencoderscited by 41
6 more
- 2022Langevin Monte Carlo for Contextual Banditscited by 22
- 2018PG-TS: Improved Thompson Sampling for Logistic Contextual Banditscited by 19
- 2017Variational inference for the multi-armed contextual banditcited by 15
- 2023VITS : Variational Inference Thompson Sampling for contextual banditscited by 6
- 2024Graph Structure Learning with Interpretable Bayesian Neural Networkscited by 4
- 2019A New Distribution on the Simplex with Auto-Encoding Applicationscited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.