Author of the publication

Non-stationary Dueling Bandits for Online Learning to Rank.

, , , , and . APWeb/WAIM (2), volume 13422 of Lecture Notes in Computer Science, page 166-174. Springer, (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

Non-stationary Dueling Bandits for Online Learning to Rank., , , , and . APWeb/WAIM (2), volume 13422 of Lecture Notes in Computer Science, page 166-174. Springer, (2022)Searching Privately by Imperceptible Lying: A Novel Private Hashing Method with Differential Privacy., , and . ACM Multimedia, page 2700-2709. ACM, (2020)SAdam: A Variant of Adam for Strongly Convex Functions., , , and . CoRR, (2019)Minimizing Dynamic Regret and Adaptive Regret Simultaneously., , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 309-319. PMLR, (2020)Non-stationary Continuum-armed Bandits for Online Hyperparameter Optimization., , , , , , , and . WSDM, page 618-627. ACM, (2022)Revisiting Smoothed Online Learning., , , and . NeurIPS, page 13599-13612. (2021)Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees., , , , , , , and . AAAI, page 15671-15679. AAAI Press, (2024)Stochastic Graphical Bandits with Adversarial Corruptions., , and . AAAI, page 8749-8757. AAAI Press, (2021)Stochastic Bandits with Graph Feedback in Non-Stationary Environments., , and . AAAI, page 8758-8766. AAAI Press, (2021)SAdam: A Variant of Adam for Strongly Convex Functions., , , , and . ICLR, OpenReview.net, (2020)