AI Paper Atlas

Research map / Bandits and online learning / RL theory and MDPs

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

Jingfeng Wu, Vladimir Braverman, Lin Yang

NeurIPS 2021 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use MOVI instead of best-in-hindsight fixed policyMOVI · simulated random multi-objective MDPcumulative regretImproved
use MOVI instead of Q-learning with scalarized rewardMOVI · simulated random multi-objective MDPcumulative regretImproved
increase number of objectives d (ablation)MOVI · simulated random multi-objective MDPregretHurt
increase number of objectives d (ablation)MOVI · simulated random multi-objective MDPsublinearity of regretNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy