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

Kieran Milan

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

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

Artificial intelligence and machine learning · 1 · 1 first-author

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 · 33% Time series and sequential data · 33% Robot manipulation · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian nonparametric model
0.212016
The Forget-me-not Process · NIPS 2016
Machine learning › Time series and sequential data › temporal sequence modeling
online sequence prediction
0.212016
The Forget-me-not Process · NIPS 2016
Robotics › Robot manipulation
task segmentation
0.212016
The Forget-me-not Process · NIPS 2016

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

regret analysis · 0.2bayesian inference · 0.2
YearPublicationVenuePosition
2016 The Forget-me-not Process
abstract
We introduce the Forget-me-not Process, an efficient, non-parametric meta-algorithm for online probabilistic sequence prediction for piecewise stationary, repeating sources. Our method works by taking a Bayesian approach to partition a stream of data into postulated task-specific segments, while simultaneously building a model for each task. We provide regret guarantees with respect to piecewise stationary data sources under the logarithmic loss, and validate the method empirically across a range of sequence prediction and task identification problems.
Kieran Milan, Joel Veness, James Kirkpatrick, Michael H. Bowling, Anna Koop, Demis Hassabis
NIPS1