Tight Bounds for Bandit Combinatorial Optimization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alon Cohen, Tamir Hazan, Tomer Koren. Tight Bounds for Bandit Combinatorial Optimization. In Satyen Kale, Ohad Shamir, editors, Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017. Volume 65 of JMLR Workshop and Conference Proceedings, pages 629-642, JMLR.org, 2017. [doi]

This author has not been identified. Look up 'Alon Cohen' in GoogleThis author has not been identified. Look up 'Tamir Hazan' in GoogleThis author has not been identified. Look up 'Tomer Koren' in Google

runs on WebDSL