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

Mert Demirer

dblp:241/7271 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—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 · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › continuous control
continuous action space
0.412019
Semi-Parametric Efficient Policy Learning with Continuous Actions · NeurIPS 2019
Machine learning › Reinforcement learning
off-policy evaluation
0.412019
Semi-Parametric Efficient Policy Learning with Continuous Actions · NeurIPS 2019
Machine learning › Reinforcement learning › off-policy reinforcement learning
off-policy policy optimization
0.412019
Semi-Parametric Efficient Policy Learning with Continuous Actions · NeurIPS 2019
Machine learning › Reinforcement learning
policy learning
0.412019
Semi-Parametric Efficient Policy Learning with Continuous Actions · NeurIPS 2019
Mathematical optimization › statistical estimation › semiparametric estimation
doubly robust estimation
0.412019
Semi-Parametric Efficient Policy Learning with Continuous Actions · NeurIPS 2019
Mathematical optimization › statistical estimation › semiparametric estimation
semiparametric efficiency
0.412019
Semi-Parametric Efficient Policy Learning with Continuous Actions · NeurIPS 2019

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

semiparametric statistics · 0.8policy gradient · 0.8doubly robust estimation · 0.8
YearPublicationVenuePosition
2019 Semi-Parametric Efficient Policy Learning with Continuous Actions
abstract
We consider off-policy evaluation and optimization with continuous action spaces. We focus on observational data where the data collection policy is unknown and needs to be estimated from data. We take a semi-parametric approach where the value function takes a known parametric form in the treatment, but we are agnostic on how it depends on the observed contexts. We propose a doubly robust off-policy estimate for this setting and show that off-policy optimization based on this doubly robust estimate is robust to estimation errors of the policy function or the regression model. We also show that the variance of our off-policy estimate achieves the semi-parametric efficiency bound. Our results also apply if the model does not satisfy our semi-parametric form but rather we measure regret in terms of the best projection of the true value function to this functional space. Our work extends prior approaches of policy optimization from observational data that only considered discrete actions. We provide an experimental evaluation of our method in a synthetic data example motivated by optimal personalized pricing.
Victor Chernozhukov, Mert Demirer, Greg Lewis, Vasilis Syrgkanis
NeurIPS2