activity
20182020
most citedAn Adaptive Clipping Approach for Proximal Policy Optimization

25 citations · 66 across the 9 of their papers we have counts for

collaborators

9 papers

cs.LG2020

Learning Symbolic Expressions via Gumbel-Max Equation Learner Networks

Gang Chen

Most of the neural networks (NNs) learned via state-of-the-art machine learning techniques are black-box models. For a widespread success of machine learning in science and enginee…

cs.LG2019★ 2 cited

Merging Deterministic Policy Gradient Estimations with Varied Bias-Variance Tradeoff for Effective Deep Reinforcement Learning

Gang Chen

Deep reinforcement learning (DRL) on Markov decision processes (MDPs) with continuous action spaces is often approached by directly training parametric policies along the direction…

cs.AI2019★ 16 cited

Memetic EDA-Based Approaches to Comprehensive Quality-Aware Automated Semantic Web Service Composition

Chen Wang, Hui Ma, Gang Chen +1

Comprehensive quality-aware automated semantic web service composition is an NP-hard problem, where service composition workflows are unknown, and comprehensive quality, i.e., Qual…

cs.AI2019★ 6 cited

Evolutionary Multitasking for Semantic Web Service Composition

Chen Wang, Hui Ma, Gang Chen +1

Web services are basic functions of a software system to support the concept of service-oriented architecture. They are often composed together to provide added values, known as we…

cs.LG2019★ 5 cited

Off-Policy Actor-Critic in an Ensemble: Achieving Maximum General Entropy and Effective Environment Exploration in Deep Reinforcement Learning

Gang Chen, Yiming Peng

We propose a new policy iteration theory as an important extension of soft policy iteration and Soft Actor-Critic (SAC), one of the most efficient model free algorithms for deep re…

cs.AI2019

Composing Distributed Data-intensive Web Services Using a Flexible Memetic Algorithm

Soheila Sadeghiram, Hui Ma, Gang Chen

Web Service Composition (WSC) is a particularly promising application of Web services, where multiple individual services with specific functionalities are composed to accomplish a…

cs.AI2019★ 4 cited

Distance-Guided GA-Based Approach to Distributed Data-Intensive Web Service Composition

Soheila Sadeghiram, Hui MA, Gang Chen

Distributed computing which uses Web services as fundamental elements, enables high-speed development of software applications through composing many interoperating, distributed, r…

cs.LG2018★ 8 cited

Effective Exploration for Deep Reinforcement Learning via Bootstrapped Q-Ensembles under Tsallis Entropy Regularization

Gang Chen, Yiming Peng, Mengjie Zhang

Recently deep reinforcement learning (DRL) has achieved outstanding success on solving many difficult and large-scale RL problems. However the high sample cost required for effecti…

cs.LG2018★ 25 cited

An Adaptive Clipping Approach for Proximal Policy Optimization

Gang Chen, Yiming Peng, Mengjie Zhang

Very recently proximal policy optimization (PPO) algorithms have been proposed as first-order optimization methods for effective reinforcement learning. While PPO is inspired by th…