conftrace_

markov decision process

790 papers

Explore in graph

Also known as

MDP

Co-occurring keywords

reinforcement learning (4352) regret bound (1926) sample complexity (1169) policy optimization (657) value iteration (162) online learning (1777) function approximation (319) optimal policy (93) deep reinforcement learning (903) value function (295)

Papers

Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes NIPS 2021
Ordering-Based Causal Discovery with Reinforcement Learning IJCAI 2021
RL for Latent MDPs: Regret Guarantees and a Lower Bound NIPS 2021
Distributionally Robust Imitation Learning NIPS 2021
Symbolic Dynamic Programming for Continuous State MDPs with Linear Program Transitions IJCAI 2021
LTL-Constrained Steady-State Policy Synthesis IJCAI 2021
Optimal Policies Tend To Seek Power NIPS 2021
Robust Reinforcement Learning using Least Squares Policy Iteration with Provable Performance Guarantees ICML 2021
Twice regularized MDPs and the equivalence between robustness and regularization NIPS 2021
The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition NIPS 2021
Learning To Recommend Frame for Interactive Video Object Segmentation in the Wild CVPR 2021
Online learning in MDPs with linear function approximation and bandit feedback. NIPS 2021
Model updating after interventions paradoxically introduces bias AISTATS 2021
A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces AISTATS 2021
Reinforcement Learning in Parametric MDPs with Exponential Families AISTATS 2021
Abstract Value Iteration for Hierarchical Reinforcement Learning AISTATS 2021
Algorithms for Fairness in Sequential Decision Making AISTATS 2021
Generalization Bounds for Stochastic Saddle Point Problems AISTATS 2021
Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping ICML 2021
Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021
Distributional Reinforcement Learning for Multi-Dimensional Reward Functions NIPS 2021
Play to Grade: Testing Coding Games as Classifying Markov Decision Process NIPS 2021
Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes COLT 2021
Iterative Bounding MDPs: Learning Interpretable Policies via Non-Interpretable Methods AAAI 2021
Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity ICML 2021