Author of the publication

Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds.

, and . COLT, volume 195 of Proceedings of Machine Learning Research, page 2653-2677. PMLR, (2023)

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)Unbiased Objective Estimation in Predictive Optimization., , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 2181-2190. PMLR, (2018)Robust Quadratic Programming for Price Optimization., , and . IJCAI, page 4648-4654. ijcai.org, (2017)Online Task Assignment Problems with Reusable Resources., , , , , , and . AAAI, page 5199-5207. AAAI Press, (2022)Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits.. NeurIPS, page 2654-2667. (2021)Maximization of Minimum Weighted Hamming Distance between Set Pairs., and . ACML, volume 222 of Proceedings of Machine Learning Research, page 895-910. PMLR, (2023)Best-of-Both-Worlds Algorithms for Partial Monitoring., , and . ALT, volume 201 of Proceedings of Machine Learning Research, page 1484-1515. PMLR, (2023)Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds., , and . CoRR, (2024)Large-Scale Price Optimization via Network Flow., and . NIPS, page 3855-3863. (2016)Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness.. ICML, volume 162 of Proceedings of Machine Learning Research, page 9678-9694. PMLR, (2022)