Papers › Acting in Delayed Environments with Non-Stationary Markov Policies

Acting in Delayed Environments with Non-Stationary Markov Policies

28 Jan 2021ICLR 2021 1arXiv:2101.11992archive 2025-07-28

Esther Derman, Gal Dalal, Shie Mannor

The standard Markov Decision Process (MDP) formulation hinges on the assumption that an action is executed immediately after it was chosen. However, assuming it is often unrealistic and can lead to catastrophic failures in applications such as robotic manipulation, cloud computing, and finance. We introduce a framework for learning and planning in MDPs where the decision-maker commits actions that are executed with a delay of m steps. The brute-force state augmentation baseline where the state is concatenated to the last m committed actions suffers from an exponential complexity in m, as we show for policy iteration. We then prove that with execution delay, deterministic Markov policies in the original state-space are sufficient for attaining maximal reward, but need to be non-stationary. As for stationary Markov policies, we show they are sub-optimal in general. Consequently, we devise a non-stationary Q-learning style model-based algorithm that solves delayed execution tasks without resorting to state-augmentation. Experiments on tabular, physical, and Atari domains reveal that it converges quickly to high performance even for substantial delays, while standard approaches that either ignore the delay or rely on state-augmentation struggle or fail due to divergence. The code is available at github.com/galdl/rl_delay_basic and github.com/galdl/rl_delay_atari.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 7 code samples harvested from 1 repository linked to this paper: 3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 2 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 7 samples from 1 repository, 3 ran (1 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

galdl/rl_delay_atari officialmentioned in papermentioned on GitHubtfSyntology: not harvested report
galdl/rl_delay_basic officialmentioned in papermentioned on GitHubtfSyntology: 7 samples, 3 ran (2 instrument-failed) · 4 unverified 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

7 samples harvested: 3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

2ran; the contract check could not run
1ran
4unverified

Licence: 0 of the 7 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 galdl/rl_delay_basic. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

galdl/rl_delay_basic official repository 7 samples, 3 ran (2 instrument-failed) · 4 unverified
ForwardModel in 6 papers dqn_agents.py ran Apache-2.0 (permissive) · bac53a374bb21edc · report fixture: returned ForwardModel · level recorded 2026-09-22
concatenate_state_action dqn_agents.py ran; the contract check could not run (RAISES) · metamorphic tier: well formed Apache-2.0 (permissive) · 64ee35f5621332c6 · report fixture: signature state:tuple/1/ndarray, action:float/0/float · returned ndarray · level recorded 2026-09-22
reshape_state dqn_agents.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted Apache-2.0 (permissive) · b4c93343c916d898 · report fixture: signature state:ndarray/1/float, is_atari_env:bool/0/bool, state_size:int/0/int · returned ndarray · level recorded 2026-09-22
DDQNAgent dqn_agents.py unverified Apache-2.0 (permissive) · 5b1a8d1d169f146e · report
DDQNPlanningAgent dqn_agents.py unverified Apache-2.0 (permissive) · c0594047adeb6fb6 · report
DQNAgent dqn_agents.py unverified Apache-2.0 (permissive) · 96778dedd8f50887 · report
update_loss dqn_agents.py unverified Apache-2.0 (permissive) · 3880ba2e2c852b2c · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for non-stationary Q-learning style model-based algorithm (graph method: non-stationary Q-learning style model-based algorithm). 7 bricks; individually on a fixture: 3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified. The assembly has not been run end-to-end.

  1. DDQNPlanningAgent entry · level 0 · unverified · c0594047adeb6fb6
  2. DDQNAgent helper · level 0 · unverified · 5b1a8d1d169f146e
  3. ForwardModel model · level 1 · ran · bac53a374bb21edc
  4. reshape_state helper · level 1 · ran; the contract check could not run (RAISES) · b4c93343c916d898
  5. DQNAgent helper · level 0 · unverified · 96778dedd8f50887
  6. update_loss helper · level 0 · unverified · 3880ba2e2c852b2c
  7. concatenate_state_action data_transform · level 1 · ran; the contract check could not run (RAISES) · 64ee35f5621332c6

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2101.11992") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Cloud ComputingQ-Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Q-Learning

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