Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.01677 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912253960257536 |
|---|---|
| author | Gu, Shangding Sel, Bilgehan Ding, Yuhao Wang, Lu Lin, Qingwei Jin, Ming Knoll, Alois |
| author_facet | Gu, Shangding Sel, Bilgehan Ding, Yuhao Wang, Lu Lin, Qingwei Jin, Ming Knoll, Alois |
| contents | Ensuring the safety of Reinforcement Learning (RL) is crucial for its deployment in real-world applications. Nevertheless, managing the trade-off between reward and safety during exploration presents a significant challenge. Improving reward performance through policy adjustments may adversely affect safety performance. In this study, we aim to address this conflicting relation by leveraging the theory of gradient manipulation. Initially, we analyze the conflict between reward and safety gradients. Subsequently, we tackle the balance between reward and safety optimization by proposing a soft switching policy optimization method, for which we provide convergence analysis. Based on our theoretical examination, we provide a safe RL framework to overcome the aforementioned challenge, and we develop a Safety-MuJoCo Benchmark to assess the performance of safe RL algorithms. Finally, we evaluate the effectiveness of our method on the Safety-MuJoCo Benchmark and a popular safe RL benchmark, Omnisafe. Experimental results demonstrate that our algorithms outperform several state-of-the-art baselines in terms of balancing reward and safety optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01677 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Balance Reward and Safety Optimization for Safe Reinforcement Learning: A Perspective of Gradient Manipulation Gu, Shangding Sel, Bilgehan Ding, Yuhao Wang, Lu Lin, Qingwei Jin, Ming Knoll, Alois Machine Learning Artificial Intelligence Ensuring the safety of Reinforcement Learning (RL) is crucial for its deployment in real-world applications. Nevertheless, managing the trade-off between reward and safety during exploration presents a significant challenge. Improving reward performance through policy adjustments may adversely affect safety performance. In this study, we aim to address this conflicting relation by leveraging the theory of gradient manipulation. Initially, we analyze the conflict between reward and safety gradients. Subsequently, we tackle the balance between reward and safety optimization by proposing a soft switching policy optimization method, for which we provide convergence analysis. Based on our theoretical examination, we provide a safe RL framework to overcome the aforementioned challenge, and we develop a Safety-MuJoCo Benchmark to assess the performance of safe RL algorithms. Finally, we evaluate the effectiveness of our method on the Safety-MuJoCo Benchmark and a popular safe RL benchmark, Omnisafe. Experimental results demonstrate that our algorithms outperform several state-of-the-art baselines in terms of balancing reward and safety optimization. |
| title | Balance Reward and Safety Optimization for Safe Reinforcement Learning: A Perspective of Gradient Manipulation |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2405.01677 |