← Search

Miro Dudik

5 accepted papers

2020

Constrained episodic reinforcement learning in concave-convex and knapsack settings

NeurIPS 2020poster

We propose an algorithm for tabular episodic reinforcement learning with constraints. We provide a modular analysis with strong theoretical guarantees for settings with concave rewards and convex constraints, and for settings with hard constraints (knapsacks). Most of the previous work in constraine…

2019

Reinforcement Learning with Convex Constraints

NeurIPS 2019poster

In standard reinforcement learning (RL), a learning agent seeks to optimize the overall reward. However, many key aspects of a desired behavior are more naturally expressed as constraints. For instance, the designer may want to limit the use of unsafe actions, increase the diversity of trajectories…

2017

A Decomposition of Forecast Error in Prediction Markets

NeurIPS 2017poster

We analyze sources of error in prediction market forecasts in order to bound the difference between a security's price and the ground truth it estimates. We consider cost-function-based prediction markets in which an automated market maker adjusts security prices according to the history of trade. W…

Cited by 11SourcePDFScholar
2017

Off-policy evaluation for slate recommendation

NeurIPS 2017oral

This paper studies the evaluation of policies that recommend an ordered set of items (e.g., a ranking) based on some context---a common scenario in web search, ads, and recommendation. We build on techniques from combinatorial bandits to introduce a new practical estimator that uses logged data to e…

2016

Contextual semibandits via supervised learning oracles

NeurIPS 2016poster

We study an online decision making problem where on each round a learner chooses a list of items based on some side information, receives a scalar feedback value for each individual item, and a reward that is linearly related to this feedback. These problems, known as contextual semibandits, arise i…