( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games.

, , , и . CoRR, (2022)

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.

Haipeng Ding

Haipeng Jing

Haipeng Song

Jia Luo

Xiaoguang Luo

 

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

New lower bounds of fifteen classical Ramsey numbers., , , и . Australas. J Comb., (1999)Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds., , , и . CoRR, (2020)Achieving All with No Parameters: Adaptive NormalHedge., и . CoRR, (2015)More Adaptive Algorithms for Adversarial Bandits., и . COLT, том 75 из Proceedings of Machine Learning Research, стр. 1263-1291. PMLR, (2018)Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs., , , и . CoRR, (2022)Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints., , и . CoRR, (2022)WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct., , , , , , , , , и . CoRR, (2023)Clairvoyant Regret Minimization: Equivalence with Nemirovski's Conceptual Prox Method and Extension to General Convex Games., , , и . CoRR, (2022)Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously., , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 7683-7692. PMLR, (2019)Adaptive Resource Provisioning for the Cloud Using Online Bin Packing., , , и . IEEE Trans. Computers, 63 (11): 2647-2660 (2014)