Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes.

C. Wei, M. Jafarnia-Jahromi, H. Luo, H. Sharma, and R. Jain. ICML, volume 119 of Proceedings of Machine Learning Research, page 10170-10180. 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.

Haipeng Ding

Haipeng Jing

Haipeng Song

Jia Luo

Xiaoguang Luo

Other publications of authors with the same name

Tractable Local Equilibria in Non-Concave Games.Y. Cai, C. Daskalakis, H. Luo, C. Wei, and W. Zheng. CoRR, (2024)Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs.H. Luo, H. Tong, M. Zhang, and Y. Zhang. ALT, volume 201 of Proceedings of Machine Learning Research, page 1074-1100. PMLR, (2023)Posterior sampling-based online learning for the stochastic shortest path model.M. Jafarnia-Jahromi, L. Chen, R. Jain, and H. Luo. UAI, volume 216 of Proceedings of Machine Learning Research, page 922-931. PMLR, (2023)Optimal and Adaptive Algorithms for Online Boosting.A. Beygelzimer, S. Kale, and H. Luo. ICML, volume 37 of JMLR Workshop and Conference Proceedings, page 2323-2331. JMLR.org, (2015)A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free.Y. Chen, C. Lee, H. Luo, and C. Wei. COLT, volume 99 of Proceedings of Machine Learning Research, page 696-726. PMLR, (2019)Fair Contextual Multi-Armed Bandits: Theory and Experiments.Y. Chen, A. Cuellar, H. Luo, J. Modi, H. Nemlekar, and S. Nikolaidis. CoRR, (2019)Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case.L. Chen, and H. Luo. ICML, volume 139 of Proceedings of Machine Learning Research, page 1651-1660. PMLR, (2021)Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP.L. Chen, R. Jain, and H. Luo. ICML, volume 162 of Proceedings of Machine Learning Research, page 3204-3245. PMLR, (2022)Learning Adversarial Markov Decision Processes with Bandit Feedback and Unknown Transition.C. Jin, T. Jin, H. Luo, S. Sra, and T. Yu. ICML, volume 119 of Proceedings of Machine Learning Research, page 4860-4869. PMLR, (2020)No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution.M. Zhang, S. Chen, H. Luo, and Y. Wang. AISTATS, volume 206 of Proceedings of Machine Learning Research, page 3270-3298. PMLR, (2023)

BibSonomy

Disambiguation of "Luo, Haipeng"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes.

Please choose a person to relate this publication to

Haipeng Ding

Haipeng Jing

Haipeng Song

Jia Luo

Xiaoguang Luo

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Luo, Haipeng"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes.

Please choose a person to relate this publication to

Haipeng Ding

Haipeng Jing

Haipeng Song

Jia Luo

Xiaoguang Luo

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes.