Author of the publication

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration.

, , , , and . COLT, volume 65 of Proceedings of Machine Learning Research, page 482-534. PMLR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Dimensionality Reduction for Tukey Regression., , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 1262-1271. PMLR, (2019)Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?, , , and . (2019)cite arxiv:1910.03016.Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels, , , , , and . (2019)Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernels., , , , , and . NeurIPS, page 5724-5734. (2019)Exponential separations in the energy complexity of leader election., , , , and . STOC, page 771-783. ACM, (2017)Optimism in Reinforcement Learning with Generalized Linear Function Approximation., , , and . ICLR, OpenReview.net, (2021)Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes., , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 42698-42723. PMLR, (2023)Efficient Near-optimal Algorithms for Barter Exchange., , , and . AAMAS, page 362-370. ACM, (2017)Online Sub-Sampling for Reinforcement Learning with General Function Approximation., , , and . CoRR, (2021)Tight Bounds for the Subspace Sketch Problem with Applications., , and . SIAM J. Comput., 50 (4): 1287-1335 (2021)