2 citations · 4 across the 4 of their papers we have counts for
4 papers
Corruption-Robust Offline Two-Player Zero-Sum Markov Games
Andi Nika, Debmalya Mandal, Adish Singla +1
We study data corruption robustness in offline two-player zero-sum Markov games. Given a dataset of realized trajectories of two players, an adversary is allowed to modify an -f…
Markov Decision Processes with Time-Varying Geometric Discounting
Jiarui Gan, Annika Hennes, Rupak Majumdar +2
Canonical models of Markov decision processes (MDPs) usually consider geometric discounting based on a constant discount factor. While this standard modeling approach has led to ma…
Implicit Poisoning Attacks in Two-Agent Reinforcement Learning: Adversarial Policies for Training-Time Attacks
Mohammad Mohammadi, Jonathan Nöther, Debmalya Mandal +2
In targeted poisoning attacks, an attacker manipulates an agent-environment interaction to force the agent into adopting a policy of interest, called target policy. Prior work has…
Online Reinforcement Learning with Uncertain Episode Lengths
Debmalya Mandal, Goran Radanovic, Jiarui Gan +2
Existing episodic reinforcement algorithms assume that the length of an episode is fixed across time and known a priori. In this paper, we consider a general framework of episodic…