Pith. sign in

REVIEW 4 cited by

Deep Reinforcement Learning amidst Lifelong Non-Stationarity

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

arxiv 2006.10701 v1 pith:V4NOYPFF submitted 2020-06-18 cs.LG cs.AIcs.ROstat.ML

classification cs.LGcs.AIcs.ROstat.ML
keywords learningalgorithmsenvironmentexperienceslifelongnon-stationarityoff-policyproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

As humans, our goals and our environment are persistently changing throughout our lifetime based on our experiences, actions, and internal and external drives. In contrast, typical reinforcement learning problem set-ups consider decision processes that are stationary across episodes. Can we develop reinforcement learning algorithms that can cope with the persistent change in the former, more realistic problem settings? While on-policy algorithms such as policy gradients in principle can be extended to non-stationary settings, the same cannot be said for more efficient off-policy algorithms that replay past experiences when learning. In this work, we formalize this problem setting, and draw upon ideas from the online learning and probabilistic inference literature to derive an off-policy RL algorithm that can reason about and tackle such lifelong non-stationarity. Our method leverages latent variable models to learn a representation of the environment from current and past experiences, and performs off-policy RL with this representation. We further introduce several simulation environments that exhibit lifelong non-stationarity, and empirically find that our approach substantially outperforms approaches that do not reason about environment shift.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adjustment Speed as a Safety Constraint for Nonstationary Reinforcement Learning

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Forecasting context shifts and treating adaptation demand against calibrated recovery capacity as a safety gate reduces transient violations in a nonstationary highway-driving simulator.

  2. From Cumulative Constraints to Adaptive Runtime Safety Control for Nonstationary Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    CPSS projects cumulative safety constraints into time-varying per-state thresholds for online action shielding in nonstationary RL, providing per-state guarantees and cumulative bounds.

  3. Safe Continual Reinforcement Learning under Nonstationarity via Adaptive Safety Constraints

    cs.LG 2026-05 unverdicted novelty 5.0 of 10

    LILAC+ combines context-based, adaptation-speed, and budget-to-state safety constraints to reduce violations in continual RL under nonstationary conditions, demonstrated in simulated driving tasks.

  4. Balancing Plasticity and Stability with Fast and Slow Successor Features

    cs.LG 2026-05 unverdicted novelty 4.0 of 10

    Synaptic consolidation applied to multi-timescale successor features yields better performance than plasticity-focused methods in RL under gradual environmental drift.

Pith tools