English
Related papers

Related papers: Variational Information Bottleneck for Unsupervise…

200 papers

Generative adversarial networks (GANs) can implicitly learn rich distributions over images, audio, and data which are hard to model with an explicit likelihood. We present a practical Bayesian formulation for unsupervised and…

Machine Learning · Statistics 2017-11-09 Yunus Saatchi , Andrew Gordon Wilson

Information bottleneck (IB) principle [1] has become an important element in information-theoretic analysis of deep models. Many state-of-the-art generative models of both Variational Autoencoder (VAE) [2; 3] and Generative Adversarial…

Computer Vision and Pattern Recognition · Computer Science 2019-12-06 Slava Voloshynovskiy , Mouad Kondah , Shideh Rezaeifar , Olga Taran , Taras Holotyak , Danilo Jimenez Rezende

This paper presents a new model called infinite mixtures of multivariate Gaussian processes, which can be used to learn vector-valued functions and applied to multitask learning. As an extension of the single multivariate Gaussian process,…

Machine Learning · Computer Science 2013-07-29 Shiliang Sun

Generative adversarial networks (GANs) have given us a great tool to fit implicit generative models to data. Implicit distributions are ones we can sample from easily, and take derivatives of samples with respect to model parameters. These…

Machine Learning · Statistics 2017-02-28 Ferenc Huszár

Finite mixture models, typically Gaussian mixtures, are well known and widely used as model-based clustering. In practical situations, there are many non-Gaussian data that are heavy-tailed and/or asymmetric. Normal inverse Gaussian (NIG)…

Machine Learning · Statistics 2020-09-15 Takashi Takekawa

Variable selection in cluster analysis is important yet challenging. It can be achieved by regularization methods, which realize a trade-off between the clustering accuracy and the number of selected variables by using a lasso-type penalty.…

Methodology · Statistics 2016-12-23 Marbac Matthieu , Sedki Mohammed

Linear mixed models are widely used for clustered data, but their reliance on parametric forms limits flexibility in complex and high-dimensional settings. In contrast, gradient boosting methods achieve high predictive accuracy through…

Machine Learning · Statistics 2025-11-04 Mitchell L. Prevett , Francis K. C. Hui , Zhi Yang Tho , A. H. Welsh , Anton H. Westveld

Mixtures of linear mixed models (MLMMs) are useful for clustering grouped data and can be estimated by likelihood maximization through the EM algorithm. The conventional approach to determining a suitable number of components is to compare…

Applications · Statistics 2014-05-26 Siew Li Tan , David J. Nott

We propose a Bayesian nonparametric mixture model for prediction- and information extraction tasks with an efficient inference scheme. It models categorical-valued time series that exhibit dynamics from multiple underlying patterns (e.g.…

Machine Learning · Statistics 2017-06-21 Jan Reubold , Thorsten Strufe , Ulf Brefeld

Gaussian Mixture Models are one of the most studied and mature models in unsupervised learning. However, outliers are often present in the data and could influence the cluster estimation. In this paper, we study a new model that assumes…

Machine Learning · Statistics 2020-03-24 Sida Liu , Adrian Barbu

Auto-encoding generative adversarial networks (GANs) combine the standard GAN algorithm, which discriminates between real and model-generated data, with a reconstruction loss given by an auto-encoder. Such models aim to prevent mode…

Machine Learning · Statistics 2017-10-24 Mihaela Rosca , Balaji Lakshminarayanan , David Warde-Farley , Shakir Mohamed

While supervised deep learning has achieved great success in a range of applications, relatively little work has studied the discovery of knowledge from unlabeled data. In this paper, we propose an unsupervised deep learning framework to…

Computer Vision and Pattern Recognition · Computer Science 2020-09-14 Jinghua Wang , Jianmin Jiang

In this paper we present a novel methodology to perform Bayesian model selection in linear models with heavy-tailed distributions. We consider a finite mixture of distributions to model a latent variable where each component of the mixture…

Methodology · Statistics 2017-08-21 Flávio B Gonçalves , Marcos O. Prates , Victor H. Lachos

We present a latent variable model for classification that provides a novel probabilistic interpretation of neural network softmax classifiers. We derive a variational objective to train the model, analogous to the evidence lower bound…

Machine Learning · Computer Science 2024-01-10 Shehzaad Dhuliawala , Mrinmaya Sachan , Carl Allen

We introduce a framework for Bayesian experimental design (BED) with implicit models, where the data-generating distribution is intractable but sampling from it is still possible. In order to find optimal experimental designs for such…

Machine Learning · Statistics 2021-05-11 Steven Kleinegesse , Michael U. Gutmann

We present a generative modeling approach based on the variational inference framework for likelihood-free simulation-based inference. The method leverages latent variables within variational autoencoders to efficiently estimate complex…

Machine Learning · Computer Science 2025-10-20 Mayank Nautiyal , Andrey Shternshis , Andreas Hellander , Prashant Singh

A general framework for dealing with both linear regression and clustering problems is described. It includes Gaussian clusterwise linear regression analysis with random covariates and cluster analysis via Gaussian mixture models with…

Methodology · Statistics 2015-10-13 Giuliano Galimberti , Annamaria Manisi , Gabriele Soffritti

Adversarial learning methods have been proposed for a wide range of applications, but the training of adversarial models can be notoriously unstable. Effectively balancing the performance of the generator and discriminator is critical,…

Machine Learning · Computer Science 2020-08-26 Xue Bin Peng , Angjoo Kanazawa , Sam Toyer , Pieter Abbeel , Sergey Levine

We propose a unified information-geometric framework that formalizes understanding in learning as a trade-off between informativeness and geometric simplicity. An encoder phi is evaluated by U(phi) = I(phi(X); Y) - beta * C(phi), where…

Machine Learning · Computer Science 2025-11-05 Ronald Katende

The use of a finite mixture of normal distributions in model-based clustering allows to capture non-Gaussian data clusters. However, identifying the clusters from the normal components is challenging and in general either achieved by…

Methodology · Statistics 2016-06-21 Gertraud Malsiner-Walli , Sylvia Frühwirth-Schnatter , Bettina Grün
‹ Prev 1 3 4 5 6 7 10 Next ›