REVIEW 3 cited by
State-wise Safe Reinforcement Learning: A Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Despite the tremendous success of Reinforcement Learning (RL) algorithms in simulation environments, applying RL to real-world applications still faces many challenges. A major concern is safety, in another word, constraint satisfaction. State-wise constraints are one of the most common constraints in real-world applications and one of the most challenging constraints in Safe RL. Enforcing state-wise constraints is necessary and essential to many challenging tasks such as autonomous driving, robot manipulation. This paper provides a comprehensive review of existing approaches that address state-wise constraints in RL. Under the framework of State-wise Constrained Markov Decision Process (SCMDP), we will discuss the connections, differences, and trade-offs of existing approaches in terms of (i) safety guarantee and scalability, (ii) safety and reward performance, and (iii) safety after convergence and during training. We also summarize limitations of current methods and discuss potential future directions.
Forward citations
Cited by 3 Pith papers
-
Combee: Scaling Prompt Learning for Self-Improving Language Model Agents
Mastery-conditioned constrained RL expands the instructional action set only when prerequisites are mastered, reducing reward hacking and raising mastery gains on Junyi and XES3G5M.
-
Leveraging Constraint Violation Signals For Action-Constrained Reinforcement Learning
A new method trains normalizing flows using constraint violation signals to map latent actions to feasible actions, reducing constraint violations by over 10x in several RL control benchmarks.
-
Action Mapping for Reinforcement Learning in Continuous Environments with Constraints
Decoupling feasibility from objective optimization by training the RL policy over latent actions that map to feasible actions improves sample efficiency and constraint satisfaction in continuous constrained RL.
Discussion (0). Continue with ORCID to comment.