paper-with-me

Papers

Using Experience Classification for Training Non-Markovian Tasks

2023-10-18 · Ruixuan Miao, Xu Lu, Cong Tian, Bin Yu, Zhenhua Duan

Unlike the standard Reinforcement Learning (RL) model, many real-world tasks are non-Markovian, whose rewards are predicated on state history rather than solely on the current state. Solving a non-Markovian task, frequently applied in practical applications such as autonomous driving, financial trading, and medical diagnosis, can be quite challenging. We propose a novel RL approach to achieve non-Markovian rewards expressed in temporal logic LTL$_f$ (Linear Temporal Logic over Finite Traces). To this end, an encoding of linear complexity from LTL$_f$ into MDPs (Markov Decision Processes) is introduced to take advantage of advanced RL algorithms. Then, a prioritized experience replay technique based on the automata structure (semantics equivalent to LTL$_f$ specification) is utilized to improve the training process. We empirically evaluate several benchmark problems augmented with non-Markovian tasks to demonstrate the feasibility and effectiveness of our approach.

📄 PDF Abstract BibTeX arXiv:2310.11678

Code (0)

등록된 구현이 없습니다.

Tasks

Autonomous DrivingClassificationMedical DiagnosisReinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

Experience Replay Experience Replay is a replay memory technique used in reinforcement learning where we store the agent’s experiences at each time-step, $e\_{t} = \left(s\_{t}, a\_{t}, r\_{t},…
Prioritized Experience Replay Prioritized Experience Replay is a type of experience replay in reinforcement learning where we more frequently replay…

Similar Papers 제목 키워드 기반

Beyond Sliding Windows: Learning to Manage Memory in Non-Markovian Environments

2025-12-22 · Geraud Nangue Tasse, Matthew Riemer, Benjamin Rosman, Tim Klinger arxiv

Recent success in developing increasingly general purpose agents based on sequence models has led to increased focus on the problem of deploying computationally limited agents within the vastly more complex real-world. A…

ParMod: A Parallel and Modular Framework for Learning Non-Markovian Tasks

2024-12-17 · Ruixuan Miao, Xu Lu, Cong Tian, Bin Yu 외

The commonly used Reinforcement Learning (RL) model, MDPs (Markov Decision Processes), has a basic premise that rewards depend on the current state and action only. However, many real-world tasks are non-Markovian, which…

NMTReinforcement Learning (RL)

Frequency-Severity Experience Rating based on Latent Markovian Risk Profiles

2021-09-03 · Robert Matthijs Verschuren

Bonus-Malus Systems traditionally consider a customer's number of claims irrespective of their sizes, even though these components are dependent in practice. We propose a novel joint experience rating approach based on l…

Temporal Difference Learning with Experience Replay

2023-06-16 · Han-Dong Lim, Donghwan Lee

Temporal-difference (TD) learning is widely regarded as one of the most popular algorithms in reinforcement learning (RL). Despite its widespread use, it has only been recently that researchers have begun to actively stu…

Reinforcement Learning (RL)

Reinforcement Learning with Non-Markovian Rewards

2019-12-05 · Maor Gaon, Ronen I. Brafman

The standard RL world model is that of a Markov Decision Process (MDP). A basic premise of MDPs is that the rewards depend on the last state and action only. Yet, many real-world rewards are non-Markovian. For example, a…

Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)