New Q-learning algorithm robust to corrupted rewards

Researchers have developed a new variant of Q-learning designed to handle adversarially corrupted rewards in reinforcement learning settings. This novel algorithm is analyzed under asynchronous sampling conditions and provides finite-time robustness guarantees. The algorithm's performance matches existing bounds, with an additive term related to corrupted samples, and establishes a near-optimal information-theoretic lower bound. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

IMPACT Introduces a more robust reinforcement learning algorithm, potentially improving reliability in real-world applications where reward signals may be noisy or manipulated.

RANK_REASON Academic paper detailing a new algorithm with theoretical guarantees. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

• Aritra Mitra
• Q-learning

• paper
• safety