activity
20162021
most citedFully Decentralized Multi-Agent Reinforcement Learning with Networked Agents

327 citations · 783 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

7 papers · 1 filter

cs.LG2021★ 83 cited

A Survey on Epistemic (Model) Uncertainty in Supervised Learning: Recent Advances and Applications

Xinlei Zhou, Han Liu, Farhad Pourpanah +2

Quantifying the uncertainty of supervised learning models plays an important role in making more reliable predictions. Epistemic uncertainty, which usually is due to insufficient k…

cs.LG2018★ 4 cited

Finite-Sample Analysis For Decentralized Batch Multi-Agent Reinforcement Learning With Networked Agents

Kaiqing Zhang, Zhuoran Yang, Han Liu +2

Despite the increasing interest in multi-agent reinforcement learning (MARL) in multiple communities, understanding its theoretical foundation has long been recognized as a challen…

cs.LG2018★ 151 cited

Parametrized Deep Q-Networks Learning: Reinforcement Learning with Discrete-Continuous Hybrid Action Space

Jiechao Xiong, Qing Wang, Zhuoran Yang +7

Most existing deep reinforcement learning (DRL) frameworks consider either discrete action space or continuous action space solely. Motivated by applications in computer games, we…

cs.LG2018★ 6 cited

Fully Implicit Online Learning

Chaobing Song, Ji Liu, Han Liu +2

Regularized online learning is widely used in machine learning applications. In online learning, performing exact minimization ( implicit update) is known to be beneficial t…

cs.LG2018★ 327 cited

Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents

Kaiqing Zhang, Zhuoran Yang, Han Liu +2

We consider the problem of \emph{fully decentralized} multi-agent reinforcement learning (MARL), where the agents are located at the nodes of a time-varying communication network.…

cs.LG2017★ 98 cited

Continual Learning in Generative Adversarial Nets

Ari Seff, Alex Beatson, Daniel Suo +1

Developments in deep generative models have allowed for tractable learning of high-dimensional data distributions. While the employed learning procedures typically assume that trai…

cs.LG2016★ 4 cited

On Fast Convergence of Proximal Algorithms for SQRT-Lasso Optimization: Don't Worry About Its Nonsmooth Loss Function

Xingguo Li, Haoming Jiang, Jarvis Haupt +4

Many machine learning techniques sacrifice convenient computational structures to gain estimation robustness and modeling flexibility. However, by exploring the modeling structures…