Pith. sign in

REVIEW 1 cited by

CANDERE-COACH: Reinforcement Learning from Noisy 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 2409.15521 v1 pith:F4SLNJKC submitted 2024-09-23 cs.LG cs.AI

classification cs.LGcs.AI
keywords feedbacklearningteacheragentnoisyoftenreinforcementassumption
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In recent times, Reinforcement learning (RL) has been widely applied to many challenging tasks. However, in order to perform well, it requires access to a good reward function which is often sparse or manually engineered with scope for error. Introducing human prior knowledge is often seen as a possible solution to the above-mentioned problem, such as imitation learning, learning from preference, and inverse reinforcement learning. Learning from feedback is another framework that enables an RL agent to learn from binary evaluative signals describing the teacher's (positive or negative) evaluation of the agent's action. However, these methods often make the assumption that evaluative teacher feedback is perfect, which is a restrictive assumption. In practice, such feedback can be noisy due to limited teacher expertise or other exacerbating factors like cognitive load, availability, distraction, etc. In this work, we propose the CANDERE-COACH algorithm, which is capable of learning from noisy feedback by a nonoptimal teacher. We propose a noise-filtering mechanism to de-noise online feedback data, thereby enabling the RL agent to successfully learn with up to 40% of the teacher feedback being incorrect. Experiments on three common domains demonstrate the effectiveness of the proposed approach.

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. Robust Reward Alignment via Hypothesis Space Batch Cutting

    cs.LG 2025-02 conditional novelty 6.0 of 10

    HSBC learns rewards from preference batches by conservatively cutting the hypothesis space with a voting threshold, tolerating erroneous labels up to a bound set by a parameter gamma.

Pith tools