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

Jingfeng Wu, Vladimir Braverman, Lin Yang 0011. Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual. pages 13112-13124, 2021. [doi]

@inproceedings{WuBY21-0,
  title = {Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning},
  author = {Jingfeng Wu and Vladimir Braverman and Lin Yang 0011},
  year = {2021},
  url = {https://proceedings.neurips.cc/paper/2021/hash/6d7d394c9d0c886e9247542e06ebb705-Abstract.html},
  researchr = {https://researchr.org/publication/WuBY21-0},
  cites = {0},
  citedby = {0},
  pages = {13112-13124},
  booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual},
  editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan},
}