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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tom Nickson

dblp:183/7034 · DBLP profile ↗
← Back
2ranked-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 · 2

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 · 87% Efficient and distributed learning · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.312017
GPflow: A Gaussian Process Library using TensorFlow · J. Mach. Learn. Res. 2017
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.312017
GPflow: A Gaussian Process Library using TensorFlow · J. Mach. Learn. Res. 2017
Machine learning › Efficient and distributed learning › hardware acceleration
GPU acceleration
0.112017
GPflow: A Gaussian Process Library using TensorFlow · J. Mach. Learn. Res. 2017

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

variational inference · 0.3automatic differentiation · 0.3
YearPublicationVenuePosition
2017 GPflow: A Gaussian Process Library using TensorFlow
abstract
GPflow is a Gaussian process library that uses TensorFlow for its core computations and Python for its front end. The distinguishing features of GPflow are that it uses variational inference as the primary approximation method, provides concise code through the use of automatic differentiation, has been engineered with a particular emphasis on software testing and is able to exploit GPU hardware.
Alexander G. de G. Matthews, Mark van der Wilk, Tom Nickson, Keisuke Fujii 0002, Alexis Boukouvalas, Pablo León-Villagrá, Zoubin Ghahramani, James Hensman
J. Mach. Learn. Res.3
2016 Latent Point Process Allocation
abstract
We introduce a probabilistic model for the factorisation of continuous Poisson process rate functions. Our model can be thought of as a topic model for Poisson point processes in which each point is assigned to one of a set of latent rate functions that are shared across multiple outputs. We show that the model brings a means of incorporating structure in point process inference beyond the state-of-the-art. We derive an efficient variational inference scheme for the model based on sparse Gaussian processes that scales linearly in the number of data points. Finally, we demonstrate, using examples from spatial and temporal statistics, how the model can be used for discovering hidden structure with greater precision than standard frequentist approaches.
Chris M. Lloyd, Tom Gunter, Michael A. Osborne, Stephen J. Roberts, Tom Nickson
AISTATS5