Author of the publication

Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance.

, , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 919-929. PMLR, (2020)

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

Scalable Online Exploration via Coverability., , and . CoRR, (2024)Inference in Sparse Graphs with Pairwise Measurements and Side Information., , and . AISTATS, volume 84 of Proceedings of Machine Learning Research, page 1810-1818. PMLR, (2018)Distributed Learning with Sublinear Communication., , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 40-50. PMLR, (2019)Orthogonal Statistical Learning, and . (2019)cite arxiv:1901.09036.The Complexity of Making the Gradient Small in Stochastic Convex Optimization, , , , , and . (2019)cite arxiv:1902.04686.Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient., , and . COLT, volume 195 of Proceedings of Machine Learning Research, page 3969-4043. PMLR, (2023)Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximation., , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 3489. PMLR, (2022)Learning in Games: Robustness of Fast Convergence., , , , and . NIPS, page 4727-4735. (2016)Can large language models explore in-context?, , , , and . CoRR, (2024)Naive Exploration is Optimal for Online LQR., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 8937-8948. PMLR, (2020)