Papers › Feasible Actor-Critic: Constrained Reinforcement Learning for Ensuring Statewise Safety

Feasible Actor-Critic: Constrained Reinforcement Learning for Ensuring Statewise Safety

22 May 2021arXiv:2105.10682archive 2025-07-28

Haitong Ma, Yang Guan, Shegnbo Eben Li, Xiangteng Zhang, Sifa Zheng, Jianyu Chen

The safety constraints commonly used by existing safe reinforcement learning (RL) methods are defined only on expectation of initial states, but allow each certain state to be unsafe, which is unsatisfying for real-world safety-critical tasks. In this paper, we introduce the feasible actor-critic (FAC) algorithm, which is the first model-free constrained RL method that considers statewise safety, e.g, safety for each initial state. We claim that some states are inherently unsafe no matter what policy we choose, while for other states there exist policies ensuring safety, where we say such states and policies are feasible. By constructing a statewise Lagrange function available on RL sampling and adopting an additional neural network to approximate the statewise Lagrange multiplier, we manage to obtain the optimal feasible policy which ensures safety for each feasible state and the safest possible policy for infeasible states. Furthermore, the trained multiplier net can indicate whether a given state is feasible or not through the statewise complementary slackness condition. We provide theoretical guarantees that FAC outperforms previous expectation-based constrained RL methods in terms of both constraint satisfaction and reward optimization. Experimental results on both robot locomotive tasks and safe exploration tasks verify the safety enhancement and feasibility interpretation of the proposed method.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2105.10682")

Code

Syntology Ran 1 of 6 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: official repository: 6 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mahaitongdae/Feasible-Actor-Critic officialmentioned in papertfMIT report
zlr20/saferl_kit mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 1 ran; 1 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
5unverified

Licence: 0 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from mahaitongdae/Feasible-Actor-Critic. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

update_mean_var_count_from_moments mahaitongdae/Feasible-Actor-Critic/preprocessor.py official repository ran · honoured contract fingerprinted MIT (permissive) · 3ebb420a5d10cc64 · report
built_parser mahaitongdae/Feasible-Actor-Critic/train_script4fsac.py official repository unverified MIT (permissive) · 8e77d175d25461f7 · report
built_parser mahaitongdae/Feasible-Actor-Critic/train_scripts/train_script4fsac_with_trained_model.py official repository unverified MIT (permissive) · 7fb1719dd18effc4 · report
compute_convergence_speed mahaitongdae/Feasible-Actor-Critic/ploter.py official repository unverified MIT (permissive) · 0b9cc3b9817b83d6 · report
help_func mahaitongdae/Feasible-Actor-Critic/ploter.py official repository unverified MIT (permissive) · 6d7182a8d3f335dd · report
min_n mahaitongdae/Feasible-Actor-Critic/ploter.py official repository unverified MIT (permissive) · ce7191c627d919b5 · report

Tasks

Reinforcement LearningReinforcement Learning (RL)Safe ExplorationSafe Reinforcement Learningreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections