Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang. Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. 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 482-534, JMLR.org, 2017. [doi]

This author has not been identified. Look up 'Lijie Chen' in GoogleThis author has not been identified. Look up 'Anupam Gupta' in GoogleThis author has not been identified. Look up 'Jian Li' in GoogleThis author has not been identified. Look up 'Mingda Qiao' in GoogleThis author has not been identified. Look up 'Ruosong Wang' in Google

runs on WebDSL