Author of the publication

Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem.

, , , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1141-1154. JMLR.org, (2015)

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

Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification., , and . NeurIPS, (2022)Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring., , and . NIPS, page 1792-1800. (2015)Thresholded linear bandits., , , , and . AISTATS, volume 206 of Proceedings of Machine Learning Research, page 6968-7020. PMLR, (2023)RIC-NN: A Robust Transferable Deep Learning Framework for Cross-sectional Investment Strategy., , and . DSAA, page 370-379. IEEE, (2020)Strategic Choices of Migrants and Smugglers in the Central Mediterranean Sea., and . CoRR, (2022)Nonconvex Optimization for Regression with Fairness Constraints., , , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 2742-2751. PMLR, (2018)Time-Decaying Bandits for Non-stationary Systems., and . WINE, volume 8877 of Lecture Notes in Computer Science, page 460-466. Springer, (2014)Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm., , and . ICML, volume 48 of JMLR Workshop and Conference Proceedings, page 1235-1244. JMLR.org, (2016)Learning Fair Division from Bandit Feedback., , , and . CoRR, (2023)Statistical Emerging Pattern Mining with Multiple Testing Correction., , , , and . KDD, page 897-906. ACM, (2017)