Probabilistic machine learning and artificial intelligence
Z Ghahramani - Nature, 2015 - nature.com
How can a machine learn from experience? Probabilistic modelling provides a framework
for understanding what learning is, and has therefore emerged as one of the principal …
for understanding what learning is, and has therefore emerged as one of the principal …
Evidential deep learning to quantify classification uncertainty
Deterministic neural nets have been shown to learn effective predictors on a wide range of
machine learning problems. However, as the standard approach is to train the network to …
machine learning problems. However, as the standard approach is to train the network to …
Decomposition of uncertainty in Bayesian deep learning for efficient and risk-sensitive learning
Bayesian neural networks with latent variables are scalable and flexible probabilistic
models: they account for uncertainty in the estimation of the network weights and, by making …
models: they account for uncertainty in the estimation of the network weights and, by making …
[HTML][HTML] A review on Gaussian process latent variable models
P Li, S Chen - CAAI Transactions on Intelligence Technology, 2016 - Elsevier
Abstract Gaussian Process Latent Variable Model (GPLVM), as a flexible bayesian non-
parametric modeling method, has been extensively studied and applied in many learning …
parametric modeling method, has been extensively studied and applied in many learning …
Probabilistic backpropagation for scalable learning of bayesian neural networks
JM Hernández-Lobato… - … conference on machine …, 2015 - proceedings.mlr.press
Large multilayer neural networks trained with backpropagation have recently achieved state-
of-the-art results in a wide range of problems. However, using backprop for neural net …
of-the-art results in a wide range of problems. However, using backprop for neural net …
Predictive entropy search for efficient global optimization of black-box functions
We propose a novel information-theoretic approach for Bayesian optimization called
Predictive Entropy Search (PES). At each iteration, PES selects the next evaluation point that …
Predictive Entropy Search (PES). At each iteration, PES selects the next evaluation point that …
A nonnegative latent factor model for large-scale sparse matrices in recommender systems via alternating direction method
Nonnegative matrix factorization (NMF)-based models possess fine representativeness of a
target matrix, which is critically important in collaborative filtering (CF)-based recommender …
target matrix, which is critically important in collaborative filtering (CF)-based recommender …
Predictive entropy search for multi-objective bayesian optimization
D Hernández-Lobato… - International …, 2016 - proceedings.mlr.press
We present\small PESMO, a Bayesian method for identifying the Pareto set of multi-objective
optimization problems, when the functions are expensive to evaluate.\small PESMO …
optimization problems, when the functions are expensive to evaluate.\small PESMO …
Generative adversarial active learning
We propose a new active learning by query synthesis approach using Generative
Adversarial Networks (GAN). Different from regular active learning, the resulting algorithm …
Adversarial Networks (GAN). Different from regular active learning, the resulting algorithm …
Algorithms of unconstrained non-negative latent factor analysis for recommender systems
Non-negativity is vital for a latent factor (LF)-based model to preserve the important feature
of a high-dimensional and sparse (HiDS) matrix in recommender systems, ie, none of its …
of a high-dimensional and sparse (HiDS) matrix in recommender systems, ie, none of its …