1 code implementation • 9 Oct 2023 • Andrew Starnes, Anton Dereventsov, Clayton Webster
In this effort, we consider the impact of regularization on the diversity of actions taken by policies generated from reinforcement learning agents trained using a policy gradient.
2 code implementations • 24 Dec 2021 • Anton Dereventsov, Ranga Raju Vatsavai, Clayton Webster
In this effort we consider a reinforcement learning (RL) technique for solving personalization tasks with complex reward signals.
1 code implementation • 7 Jun 2021 • Anton Dereventsov, Joseph D. Daws Jr., Clayton Webster
We address the challenge of policy evaluation in real-world applications of reinforcement learning systems where the available historical data is limited due to ethical, practical, or security considerations.
no code implementations • 4 Dec 2019 • Joseph Daws, Clayton Webster
The construction of the proposed neural network is based on a quasi-optimal polynomial approximation.
no code implementations • 7 Oct 2019 • Armenak Petrosyan, Anton Dereventsov, Clayton Webster
In this effort, we derive a formula for the integral representation of a shallow neural network with the ReLU activation function.
1 code implementation • 24 May 2019 • Viktor Reshniak, Clayton Webster
In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes.
1 code implementation • 24 May 2019 • Anton Dereventsov, Armenak Petrosyan, Clayton Webster
We present a greedy-based approach to construct an efficient single hidden layer neural network with the ReLU activation that approximates a target function.