activity
20202023
most citedCorruption-Robust Offline Reinforcement Learning

7 citations · 30 across the 14 of their papers we have counts for

collaborators

14 papers

cs.LG2023

Federated Multi-Level Optimization over Decentralized Networks

Shuoguang Yang, Xuezhou Zhang, Mengdi Wang

Multi-level optimization has gained increasing attention in recent years, as it provides a powerful framework for solving complex optimization problems that arise in many fields, s…

cs.LG2023

Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP

Jiacheng Guo, Zihao Li, Huazheng Wang +3

In this paper, we study representation learning in partially observable Markov Decision Processes (POMDPs), where the agent learns a decoder function that maps a series of high-dim…

cs.LG2022

Representation Learning for General-sum Low-rank Markov Games

Chengzhuo Ni, Yuda Song, Xuezhou Zhang +2

We study multi-agent general-sum Markov games with nonlinear function approximation. We focus on low-rank Markov games whose transition matrix admits a hidden low-rank structure on…

cs.LG2022

Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization

Kaixuan Huang, Yu Wu, Xuezhou Zhang +4

Online influence maximization aims to maximize the influence spread of a content in a social network with unknown network model by selecting a few seed nodes. Recent studies follow…

stat.ML2022★ 4 cited

Decentralized Gossip-Based Stochastic Bilevel Optimization over Communication Networks

Shuoguang Yang, Xuezhou Zhang, Mengdi Wang

Bilevel optimization have gained growing interests, with numerous applications found in meta learning, minimax games, reinforcement learning, and nested composition optimization. T…

cs.LG2022★ 4 cited

Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization

Hui Yuan, Chengzhuo Ni, Huazheng Wang +4

Directed Evolution (DE), a landmark wet-lab method originated in 1960s, enables discovery of novel protein designs via evolving a population of candidate sequences. Recent advances…

cs.LG2022★ 2 cited

Byzantine-Robust Online and Offline Distributed Reinforcement Learning

Yiding Chen, Xuezhou Zhang, Kaiqing Zhang +2

We consider a distributed reinforcement learning setting where multiple agents separately explore the environment and communicate their experiences through a central server. Howeve…

cs.LG2022★ 2 cited

Provable Benefits of Representational Transfer in Reinforcement Learning

Alekh Agarwal, Yuda Song, Wen Sun +3

We study the problem of representational transfer in RL, where an agent first pretrains in a number of source tasks to discover a shared representation, which is subsequently used…

stat.ML2022

Off-Policy Fitted Q-Evaluation with Differentiable Function Approximators: Z-Estimation and Inference Theory

Ruiqi Zhang, Xuezhou Zhang, Chengzhuo Ni +1

Off-Policy Evaluation (OPE) serves as one of the cornerstones in Reinforcement Learning (RL). Fitted Q Evaluation (FQE) with various function approximators, especially deep neural…

stat.ML2022

Optimal Estimation of Off-Policy Policy Gradient via Double Fitted Iteration

Chengzhuo Ni, Ruiqi Zhang, Xiang Ji +2

Policy gradient (PG) estimation becomes a challenge when we are not allowed to sample with the target policy but only have access to a dataset generated by some unknown behavior po…

cs.LG2022

Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approach

Xuezhou Zhang, Yuda Song, Masatoshi Uehara +3

We present BRIEE (Block-structured Representation learning with Interleaved Explore Exploit), an algorithm for efficient reinforcement learning in Markov Decision Processes with bl…

cs.LG2021★ 5 cited

Representation Learning for Online and Offline RL in Low-rank MDPs

Masatoshi Uehara, Xuezhou Zhang, Wen Sun

This work studies the question of Representation Learning in RL: how can we learn a compact low-dimensional representation such that on top of the representation we can perform RL…

cs.LG2021★ 7 cited

Corruption-Robust Offline Reinforcement Learning

Xuezhou Zhang, Yiding Chen, Jerry Zhu +1

We study the adversarial robustness in offline reinforcement learning. Given a batch dataset consisting of tuples , an adversary is allowed to arbitrarily modify …

cs.LG2020★ 6 cited

Using Machine Teaching to Investigate Human Assumptions when Teaching Reinforcement Learners

Yun-Shiuan Chuang, Xuezhou Zhang, Yuzhe Ma +3

Successful teaching requires an assumption of how the learner learns - how the learner uses experiences from the world to update their internal states. We investigate what expectat…