10 papers · 1 filter
Variance-Reduced Q-Learning over Static and Time-Varying Networks
Sreejeet Maity, Feng Zhu, Aritra Mitra +1
We investigate a decentralized reinforcement learning problem involving multiple agents that interact with the same Markov Decision Process (MDP). The agents can exchange informati…
Robust Asynchronous Q-Learning under Reward and State Corruption via Batching
Sreejeet Maity, Aritra Mitra
Motivated by reinforcement learning in harsh environments, we consider the problem of learning an optimal policy subject to adversarially corrupted feedback. Specifically, at each…
A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms
Feng Zhu, Robert W. Heath, Aritra Mitra
Stochastic variance-reduced algorithms such as Stochastic Average Gradient (SAG) and SAGA, and their deterministic counterparts like the Incremental Aggregated Gradient (IAG) metho…
Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates
Sreejeet Maity, Aritra Mitra
We study the problem of learning the optimal policy in a discounted, infinite-horizon reinforcement learning (RL) setting in the presence of adversarially corrupted rewards. To add…
Achieving Tighter Finite-Time Rates for Heterogeneous Federated Stochastic Approximation under Markovian Sampling
Feng Zhu, Aritra Mitra, Robert W. Heath
Motivated by collaborative reinforcement learning (RL) and optimization with time-correlated data, we study a generic federated stochastic approximation problem involving agent…
Adversarially-Robust TD Learning with Markovian Data: Finite-Time Rates and Fundamental Limits
Sreejeet Maity, Aritra Mitra
One of the most basic problems in reinforcement learning (RL) is policy evaluation: estimating the long-term return, i.e., value function, corresponding to a given fixed policy. Th…