Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition

Liyu Chen, Haipeng Luo, Chen-Yu Wei. Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition. In Mikhail Belkin, Samory Kpotufe, editors, Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA. Volume 134 of Proceedings of Machine Learning Research, pages 1180-1215, PMLR, 2021. [doi]

@inproceedings{ChenLW21-10,
  title = {Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition},
  author = {Liyu Chen and Haipeng Luo and Chen-Yu Wei},
  year = {2021},
  url = {http://proceedings.mlr.press/v134/chen21e.html},
  researchr = {https://researchr.org/publication/ChenLW21-10},
  cites = {0},
  citedby = {0},
  pages = {1180-1215},
  booktitle = {Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA},
  editor = {Mikhail Belkin and Samory Kpotufe},
  volume = {134},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}