activity
20182021
most citedGreedy UnMixing for Q-Learning in Multi-Agent Reinforcement Learning

1 citations · 2 across the 3 of their papers we have counts for

collaborators

7 papers

cs.LG2021

Regularize! Don't Mix: Multi-Agent Reinforcement Learning without Explicit Centralized Structures

Chapman Siu, Jason Traish, Richard Yi Da Xu

We propose using regularization for Multi-Agent Reinforcement Learning rather than learning explicit cooperative structures called {\em Multi-Agent Regularized Q-learning} (MARQ).…

cs.LG20211 cited

Dual Behavior Regularized Reinforcement Learning

Chapman Siu, Jason Traish, Richard Yi Da Xu

Reinforcement learning has been shown to perform a range of complex tasks through interaction with an environment or collected leveraging experience. However, many of these approac…

cs.LG20211 cited

Greedy UnMixing for Q-Learning in Multi-Agent Reinforcement Learning

Chapman Siu, Jason Traish, Richard Yi Da Xu

This paper introduces Greedy UnMix (GUM) for cooperative multi-agent reinforcement learning (MARL). Greedy UnMix aims to avoid scenarios where MARL methods fail due to overestimati…

stat.ML2019

Residual Networks Behave Like Boosting Algorithms

Chapman Siu

We show that Residual Networks (ResNet) is equivalent to boosting feature representation, without any modification to the underlying ResNet training algorithm. A regret bound based…

stat.ML2019

TreeGrad: Transferring Tree Ensembles to Neural Networks

Chapman Siu

Gradient Boosting Decision Tree (GBDT) are popular machine learning algorithms with implementations such as LightGBM and in popular machine learning toolkits like Scikit-Learn. Man…

stat.ML2018

Automatic Induction of Neural Network Decision Tree Algorithms

Chapman Siu

This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weig…