activity
20162026
most citedNeural Policy Gradient Methods: Global Optimality and Rates of Convergence

89 citations · 302 across the 30 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.LG2021★ 13 cited

Dynamic Bottleneck for Robust Self-Supervised Exploration

Chenjia Bai, Lingxiao Wang, Lei Han +4

Exploration methods based on pseudo-count of transitions or curiosity of dynamics have achieved promising results in solving reinforcement learning with sparse rewards. However, su…

cs.LG2021★ 2 cited

Adaptive Differentially Private Empirical Risk Minimization

Xiaoxia Wu, Lingxiao Wang, Irina Cristali +2

We propose an adaptive (stochastic) gradient perturbation method for differentially private empirical risk minimization. At each iteration, the random noise added to the gradient i…

cs.LG2021

False Correlation Reduction for Offline Reinforcement Learning

Zhihong Deng, Zuyue Fu, Lingxiao Wang +5

Offline reinforcement learning (RL) harnesses the power of massive datasets for resolving sequential decision problems. Most existing papers only discuss defending against out-of-d…

cs.LG2021★ 3 cited

Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach

Yan Li, Lingxiao Wang, Jiachen Yang +4

Multi-agent reinforcement learning (MARL) becomes more challenging in the presence of more agents, as the capacity of the joint state and action spaces grows exponentially in the n…

cs.LG2021★ 7 cited

Principled Exploration via Optimistic Bootstrapping and Backward Induction

Chenjia Bai, Lingxiao Wang, Lei Han +4

One principled approach for provably efficient exploration is incorporating the upper confidence bound (UCB) into the value function as a bonus. However, UCB is specified to deal w…