Author of the publication

Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability.

, and . ALT, volume 167 of Proceedings of Machine Learning Research, page 968-994. PMLR, (2022)

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

Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm., and . COLT, volume 99 of Proceedings of Machine Learning Research, page 558-588. PMLR, (2019)Subspace learning from extremely compressed measurements., , and . ACSSC, page 311-315. IEEE, (2014)Sample Complexity of Learning Mixtures of Sparse Linear Regressions., , , and . CoRR, (2019)Extreme Compressive Sampling for Covariance Estimation., , and . IEEE Trans. Inf. Theory, 64 (12): 7613-7635 (2018)Go for a Walk and Arrive at the Answer: Reasoning Over Knowledge Bases with Reinforcement Learning., , , , , , , and . AKBC@NIPS, OpenReview.net, (2017)Contrastive Estimation Reveals Topic Posterior Information to Linear Models., , and . J. Mach. Learn. Res., (2021)Universal and data-adaptive algorithms for model selection in linear contextual bandits., and . CoRR, (2021)Robust Dynamic Assortment Optimization in the Presence of Outlier Customers., , and . CoRR, (2019)Provable RL with Exogenous Distractors via Multistep Inverse Dynamics., , , , and . CoRR, (2021)Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability., and . CoRR, (2021)