( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors.

, , и . CoRR, (2017)

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.

Zhou Zhou

Zhou Zhou

Rui Zhou

Xianzhong Zhou

Jun Zhou

 

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

Lazy-CFR: fast and near-optimal regret minimization for extensive games with imperfect information., , , , и . ICLR, OpenReview.net, (2020)Selective Verification Strategy for Learning From Crowds., , и . AAAI, стр. 4147-4154. AAAI Press, (2018)Identify the Nash Equilibrium in Static Games with Random Payoffs., , и . ICML, том 70 из Proceedings of Machine Learning Research, стр. 4160-4169. PMLR, (2017)Online Label Aggregation: A Variational Bayesian Approach., , , , и . WWW, стр. 1904-1915. ACM / IW3C2, (2021)Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback., , и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 11473-11482. PMLR, (2022)Exploration Analysis in Finite-Horizon Turn-based Stochastic Games., , , и . UAI, том 124 из Proceedings of Machine Learning Research, стр. 201-210. AUAI Press, (2020)Stabilizing Policy Gradients for Stochastic Differential Equations via Consistency with Perturbation Process., , и . ICML, OpenReview.net, (2024)Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors., , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 5995-6003. PMLR, (2018)Lazy-CFR: a fast regret minimization algorithm for extensive games with imperfect information., , , , и . CoRR, (2018)Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors., , и . CoRR, (2017)