Optimism about the poorly understood states and actions is the main driving force of exploration for many provably-efficient reinforcement learning a…
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, is important for many applications where small runtimes are …
Imitation learning (IL) algorithms use expert demonstrations to learn a specific task. Most of the existing approaches assume that all expert demonst…
In this paper we have presented a brief survey on probabilistic reinforcement learning. We focused on two major aspects of developing RL algorithms: i) balancing the exploration-exploitation trade off and ii) computing a robust policy with limited d…
A reinforcement learning agent tries to maximize its cumulative payoff by interacting in an unknown environment. It is important for the agent to exp…
Many efficient algorithms with strong theoretical guarantees have been proposed for the contextual multi-armed bandit problem. However, applying thes…
Retrieving paragraphs to populate a Wikipedia article is a challenging task. The new TREC Complex Answer Retrieval (TREC CAR) track introduces a comp…
We propose a version of WalkSAT algorithm, named as BetaWalkSAT. This method uses probabilistic reasoning for biasing the starting state of the local…
By signing up you accept our content policy
Already have an account? Sign in
No a member yet? Create an account