10 datasets found

Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback

The Robust MDPs problem is a Markov Decision Process problem where the goal is to find a policy π that maximizes the Value Function under worst-case transition dynamics.

We investigate an infinite-horizon average reward Markov Decision Process (MDP) with delayed, composite, and partially anonymous reward feedback.

The dataset used in the paper is a random finite horizon Markov decision process (MDP) with states S, actions A, and horizon τ.

The BRIDGE dataset is a collection of 155 deterministic MDPs, each with a horizon of 100 time steps. The dataset is used to evaluate the performance of reinforcement learning...

The dataset used in the paper is a Markov Decision Process (MDP) with a set of states, actions, transition probabilities, and rewards.

The Four Rooms environment is a stochastic version of the classic Atari game Four Rooms. The environment has 104 states and 4 actions, and the agent can move in any of the 4...

The dataset used in the paper is a Markov Decision Process, where states can take values in a state space X, corresponding to a state x ∈ X, we can take an action u ∈ U,...

The Wizard dataset is a trick-taking game with 4 players, consisting of 15 rounds. Each round consists of a dealing, bidding, playing, and evaluation phase.

The training dataset is a collection of the publicly available Arabic corpora listed below: The unshuffled OSCAR corpus (Ortiz Su´arez et al., 2020). The Arabic Wikipedia dump...