Author of the publication

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.

, , , , , , and . AISTATS, volume 130 of Proceedings of Machine Learning Research, page 3367-3375. PMLR, (2021)

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

Causal Bandits with Propagating Inference., , , , , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 5508-5516. PMLR, (2018)Online Task Assignment Problems with Reusable Resources., , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)Lagrangian Decomposition Algorithm for Allocating Marketing Channels., , , and . AAAI, page 1144-1150. AAAI Press, (2015)DeQED: an efficient divide-and-coordinate algorithm for DCOP., and . AAMAS, page 1325-1326. IFAAMAS, (2013)Improved Regret Bounds for Bandit Combinatorial Optimization., , , , , , and . NeurIPS, page 12027-12036. (2019)Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback., , , , , , and . NeurIPS, page 10589-10598. (2019)Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation., , , , , , and . NIPS, page 4099-4108. (2017)Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling., , , and . AAAI, page 1992-1999. AAAI Press, (2017)Computing Least Cores of Supermodular Cooperative Games., and . AAAI, page 551-557. AAAI Press, (2017)Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions., , , , , , and . AAAI, page 9791-9798. AAAI Press, (2021)