资源分类
》 资源 》论文》Better Rates for Any Adversarial Deterministic MDP

Better Rates for Any Adversarial Deterministic MDP

2020-03-02 | |  72 |   42 |   0

Abstract

We consider regret minimization in adversarial deterministic Markov Decision Processes (ADMDPs) with bandit feedback. We devise a new algorithm that pushes the state-of-theart forward in two ways: First, it attains a regret of 图片.png with respect to the best fixed policy in hindsight, whereas the previous best regret bound was 图片.png Second, the algorithm and its analysis are compatible with any feasible ADMDP graph topology, while all previous approaches required additional restrictions on the graph topology.

上一篇：Smooth Sparse Coding via Marginal Regression for Learning Sparse Representations

下一篇：Hierarchical Tensor Decomposition of Latent Tree Graphical Models

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...