Timezone: »

 
Poster
Boosted Density Estimation Remastered
Zac Cranko · Richard Nock

Tue Jun 11 06:30 PM -- 09:00 PM (PDT) @ Pacific Ballroom #161
in Posters Tue »
There has recently been a steady increase in the number iterative approaches to density estimation. However, an accompanying burst of formal convergence guarantees has not followed; all results pay the price of heavy assumptions which are often unrealistic or hard to check. The \emph{Generative Adversarial Network (GAN)} literature --- seemingly orthogonal to the aforementioned pursuit --- has had the side effect of a renewed interest in variational divergence minimisation (notably $f$-GAN). We show how to combine this latter approach and the classical boosting theory in supervised learning to get the first density estimation algorithm that provably achieves geometric convergence under very weak assumptions. We do so by a trick allowing to combine \textit{classifiers} as the sufficient statistics of an exponential family. Our analysis includes an improved variational characterisation of $f$-GAN.
Keywords: Bayesian Methods · Generative Adversarial Networks · Information Theory and Estimation · Optimization - Others · Statistical Learning Theory

Author Information

Zac Cranko (ANU)
Richard Nock (Data61, The Australian National University and the University of Sydney)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors