1 citations · 1 across the 10 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.LG2023★ 1 cited
Span-Based Optimal Sample Complexity for Average Reward MDPs
Matthew Zurek, Yudong Chen
We study the sample complexity of learning an -optimal policy in an average-reward Markov decision process (MDP) under a generative model. We establish the complexity…
cs.LG2023
Gap-Free Clustering: Sensitivity and Robustness of SDP
Matthew Zurek, Yudong Chen
We study graph clustering in the Stochastic Block Model (SBM) in the presence of both large clusters and small, unrecoverable clusters. Previous convex relaxation approaches achiev…
cs.LG2023
Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces
Brahma S. Pavse, Matthew Zurek, Yudong Chen +2
In many reinforcement learning (RL) applications, we want policies that reach desired states and then keep the controlled system within an acceptable region around the desired stat…