Pith. sign in

REVIEW 1 cited by

Reinforcement Learning with Trajectory Feedback

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 2008.06036 v2 pith:PLW24I32 submitted 2020-08-13 cs.LG stat.ML

classification cs.LGstat.ML
keywords feedbacktrajectorylearningmodelreinforcementrewardunknownalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The standard feedback model of reinforcement learning requires revealing the reward of every visited state-action pair. However, in practice, it is often the case that such frequent feedback is not available. In this work, we take a first step towards relaxing this assumption and require a weaker form of feedback, which we refer to as \emph{trajectory feedback}. Instead of observing the reward obtained after every action, we assume we only receive a score that represents the quality of the whole trajectory observed by the agent, namely, the sum of all rewards obtained over this trajectory. We extend reinforcement learning algorithms to this setting, based on least-squares estimation of the unknown reward, for both the known and unknown transition model cases, and study the performance of these algorithms by analyzing their regret. For cases where the transition model is unknown, we offer a hybrid optimistic-Thompson Sampling approach that results in a tractable algorithm.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Dreamer-SAC: Off-Policy Learning in Latent World Models for Sample-Efficient Autonomous Driving

    cs.LG 2026-08 conditional novelty 5.0 of 10

    A latent world model combined with off-policy SAC, short latent rollouts, and n-step targets outperforms DreamerV3, SAC, and PPO in MetaDrive driving, with the best results at a five-step rollout horizon.

Pith tools