Adversarial online multi-task reinforcement learning

MaRDI QIDQ7022727zbMATH OpenFDO

Authors Quan Nguyen, Nishant A. Mehta

Publication date 24 February 2025

Full work available at URL https://proceedings.mlr.press/v201/nguyen23a.html

zbMATH Keywords

adversarial online multi-task learningclusteringreinforcement learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40)

Cites work

• Asymptotically efficient adaptive allocation rules
• Elements of Information Theory
• Episodic reinforcement learning in finite MDPs: minimax lower bounds revisited
• Near-optimal regret bounds for reinforcement learning
• The Nonstochastic Multiarmed Bandit Problem

This page was built for publication: Adversarial online multi-task reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022727)