Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Josiah Yan

dblp:180/5445 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
approximate inference
0.312017
A Unifying Framework for Gaussian Process Pseudo-Point Approximations using Power Expectation Propagation · J. Mach. Learn. Res. 2017
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
expectation propagation
0.312017
A Unifying Framework for Gaussian Process Pseudo-Point Approximations using Power Expectation Propagation · J. Mach. Learn. Res. 2017
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.312017
A Unifying Framework for Gaussian Process Pseudo-Point Approximations using Power Expectation Propagation · J. Mach. Learn. Res. 2017

Methods — techniques the papers use, named apart from their topics

variational inference · 0.3power expectation propagation · 0.3
YearPublicationVenuePosition
2017 A Unifying Framework for Gaussian Process Pseudo-Point Approximations using Power Expectation Propagation
abstract
Gaussian processes (GPs) are flexible distributions over functions that enable high-level assumptions about unknown functions to be encoded in a parsimonious, flexible and general way. Although elegant, the application of GPs is limited by computational and analytical intractabilities that arise when data are sufficiently numerous or when employing non-Gaussian models. Consequently, a wealth of GP approximation schemes have been developed over the last 15 years to address these key limitations. Many of these schemes employ a small set of pseudo data points to summarise the actual data. In this paper we develop a new pseudo-point approximation framework using Power Expectation Propagation (Power EP) that unifies a large number of these pseudo-point approximations. Unlike much of the previous venerable work in this area, the new framework is built on standard methods for approximate inference (variational free- energy, EP and Power EP methods) rather than employing approximations to the probabilistic generative model itself. In this way all of the approximation is performed at `inference time' rather than at `modelling time', resolving awkward philosophical and empirical questions that trouble previous approaches. Crucially, we demonstrate that the new framework includes new pseudo-point approximation methods that outperform current approaches on regression and classification tasks.
Thang D. Bui, Josiah Yan, Richard E. Turner
J. Mach. Learn. Res.2