%0 Conference Paper %1 conf/aistats/LiJJ24 %A Li, Zhaoqi %A Jamieson, Kevin G. %A Jain, Lalit %B AISTATS %D 2024 %E Dasgupta, Sanjoy %E Mandt, Stephan %E Li, Yingzhen %I PMLR %K dblp %P 1684-1692 %T Optimal Exploration is no harder than Thompson Sampling. %U http://dblp.uni-trier.de/db/conf/aistats/aistats2024.html#LiJJ24 %V 238

@inproceedings{conf/aistats/LiJJ24, added-at = {2024-05-13T00:00:00.000+0200}, author = {Li, Zhaoqi and Jamieson, Kevin G. and Jain, Lalit}, biburl = {https://www.bibsonomy.org/bibtex/26710e562c618cd3e678612cc14a742ed/dblp}, booktitle = {AISTATS}, crossref = {conf/aistats/2024}, editor = {Dasgupta, Sanjoy and Mandt, Stephan and Li, Yingzhen}, ee = {https://proceedings.mlr.press/v238/li24h.html}, interhash = {88a3ce40217348dda0bca47b3582083c}, intrahash = {6710e562c618cd3e678612cc14a742ed}, keywords = {dblp}, pages = {1684-1692}, publisher = {PMLR}, series = {Proceedings of Machine Learning Research}, timestamp = {2024-05-20T07:23:13.000+0200}, title = {Optimal Exploration is no harder than Thompson Sampling.}, url = {http://dblp.uni-trier.de/db/conf/aistats/aistats2024.html#LiJJ24}, volume = 238, year = 2024 }