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

Russell Coleman

dblp:259/1026 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—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
Reinforcement learning · 61% Probabilistic and Bayesian machine learning · 30% Trustworthy machine learning · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.412020
Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences · ICML 2020
Machine learning › Reinforcement learning › reward learning
bayesian reward learning
0.412020
Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences · ICML 2020
Machine learning › Reinforcement learning
imitation learning
0.412020
Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences · ICML 2020

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

self-supervised feature encoding · 0.4preference learning · 0.4bayesian inference · 0.4
YearPublicationVenuePosition
2020 Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences
abstract
Bayesian reward learning from demonstrations enables rigorous safety and uncertainty analysis when performing imitation learning. However, Bayesian reward learning methods are typically computationally intractable for complex control problems. We propose Bayesian Reward Extrapolation (Bayesian REX), a highly efficient Bayesian reward learning algorithm that scales to high-dimensional imitation learning problems by pre-training a low-dimensional feature encoding via self-supervised tasks and then leveraging preferences over demonstrations to perform fast Bayesian inference. Bayesian REX can learn to play Atari games from demonstrations, without access to the game score and can generate 100,000 samples from the posterior over reward functions in only 5 minutes on a personal laptop. Bayesian REX also results in imitation learning performance that is competitive with or better than state-of-the-art methods that only learn point estimates of the reward function. Finally, Bayesian REX enables efficient high-confidence policy evaluation without having access to samples of the reward function. These high-confidence performance bounds can be used to rank the performance and risk of a variety of evaluation policies and provide a way to detect reward hacking behaviors.
Daniel S. Brown, Russell Coleman, Ravi Srinivasan, Scott Niekum
ICML2