Tight Lower Bounds for Combinatorial Multi-Armed Bandits

Nadav Merlis, Shie Mannor. Tight Lower Bounds for Combinatorial Multi-Armed Bandits. In Jacob D. Abernethy, Shivani Agarwal 0001, editors, Conference on Learning Theory, COLT 2020, 9-12 July 2020, Virtual Event [Graz, Austria]. Volume 125 of Proceedings of Machine Learning Research, pages 2830-2857, PMLR, 2020. [doi]

@inproceedings{MerlisM20,
  title = {Tight Lower Bounds for Combinatorial Multi-Armed Bandits},
  author = {Nadav Merlis and Shie Mannor},
  year = {2020},
  url = {http://proceedings.mlr.press/v125/merlis20a.html},
  researchr = {https://researchr.org/publication/MerlisM20},
  cites = {0},
  citedby = {0},
  pages = {2830-2857},
  booktitle = {Conference on Learning Theory, COLT 2020, 9-12 July 2020, Virtual Event [Graz, Austria]},
  editor = {Jacob D. Abernethy and Shivani Agarwal 0001},
  volume = {125},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}