SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2011.13034 · NeurIPS · 2021

Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning

Lin Yang, Jingfeng Wu, Vladimir Braverman

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

In this paper we consider multi-objective reinforcement learning where the objectives are balanced using preferences. In practice, the preferences are often given in an adversarial manner, e.g., customers can be picky in many applications. We formalize this problem as an episodic learning problem on a Markov decision process, where transitions are unknown and a reward function is the inner product of a preference vector with pre-specified multi-objective reward functions. We consider two settings. In the online setting, the agent receives a (adversarial) preference every episode and proposes policies to interact with the environment. We provide a model-based algorithm that achieves a nearly minimax optimal regret bound O min{d, S} • H 2 SAK , where d is the number of objectives, S is the number of states, A is the number of actions, H is the length of the horizon, and K is the number of episodes. Furthermore, we consider preference-free exploration, i.e., the agent first interacts with the environment without specifying any preference and then is able to accommodate arbitrary preference vector up to error. Our proposed algorithm is provably efficient with a nearly optimal trajectory complexity O min{d, S} • H 3 SA/ 2 . This result partly resolves an open problem raised by Jin et al. [2020].

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2011.13034")
get_code_for_paper("2011.13034")
have("2011.13034")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2011.13034.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2011.13034.svg)](https://syntology.ai/paper/2011.13034)

Connect an agent — have() is free.