( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints.

, , , и . CoRR, (2018)

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.

Hédi M'barek

Hédi Ouanès

Mohamed Hédi Kallel

Mohamed Hédi Kallel

Ekkehart Hédi Eckert

 

Другие публикации лиц с тем же именем

Scale-free Unconstrained Online Learning for Curved Losses., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 4464-4497. PMLR, (2022)Diversity-Preserving K-Armed Bandits, Revisited., , , и . CoRR, (2020)Adaptation to the Range in K-Armed Bandits., и . J. Mach. Learn. Res., (2023)KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints., , , и . J. Mach. Learn. Res., (2022)Accelerated Rates between Stochastic and Adversarial Online Convex Optimization., , , и . CoRR, (2023)KL-UCB-switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints., , , и . CoRR, (2018)Distributed Online Learning for Joint Regret with Communication Constraints., , и . ALT, том 167 из Proceedings of Machine Learning Research, стр. 1003-1042. PMLR, (2022)Polynomial Cost of Adaptation for X-Armed Bandits.. NeurIPS, стр. 1027-1036. (2019)Distributed Online Learning for Joint Regret with Communication Constraints., , и . CoRR, (2021)Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games., , , и . CoRR, (2023)