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

Virtual machine placement for minimizing connection cost in data center networks., , and . INFOCOM Workshops, page 486-491. IEEE, (2015)Online Optimization of Video-Ad Allocation., , , and . IJCAI, page 423-429. ijcai.org, (2017)Adaptive Budget Allocation for Maximizing Influence of Advertisements., , and . IJCAI, page 3600-3608. IJCAI/AAAI Press, (2016)Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems., and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 747-756. Springer, (2005)Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs.. CoRR, (2015)FPTASs for trimming weighted trees., , and . Theor. Comput. Sci., (2013)Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling., , , and . AAAI, page 1992-1999. AAAI Press, (2017)Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions., , , , , , and . AAAI, page 9791-9798. AAAI Press, (2021)Improved Regret Bounds for Bandit Combinatorial Optimization., , , , , , and . NeurIPS, page 12027-12036. (2019)Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation., , , , , , and . NIPS, page 4099-4108. (2017)