REVIEW 1 cited by
Non-Stationary Learning of Neural Networks with Automatic Soft Parameter Reset
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
Neural networks are traditionally trained under the assumption that data come from a stationary distribution. However, settings which violate this assumption are becoming more popular; examples include supervised learning under distributional shifts, reinforcement learning, continual learning and non-stationary contextual bandits. In this work we introduce a novel learning approach that automatically models and adapts to non-stationarity, via an Ornstein-Uhlenbeck process with an adaptive drift parameter. The adaptive drift tends to draw the parameters towards the initialisation distribution, so the approach can be understood as a form of soft parameter reset. We show empirically that our approach performs well in non-stationary supervised and off-policy reinforcement learning settings.
Forward citations
Cited by 1 Pith paper
-
Is Exploration or Optimization the Problem for Deep Reinforcement Learning?
Deep RL agents' best experienced trajectories are 2-3 times better than their learned policy's average return, suggesting exploitation and optimization issues dominate exploration challenges.
Discussion (0). Sign in to comment.