1 code implementation • 21 Nov 2022 • Anton Dereventsov, Andrew Starnes, Clayton G. Webster
This effort is focused on examining the behavior of reinforcement learning systems in personalization environments and detailing the differences in policy entropy associated with the type of learning algorithm utilized.
1 code implementation • 18 Jun 2020 • Anton Dereventsov, Clayton G. Webster, Joseph D. Daws Jr
In this work, we propose a novel adaptive stochastic gradient-free (ASGF) approach for solving high-dimensional nonconvex optimization problems based on function evaluations.
no code implementations • 13 Apr 2020 • Yiming Xu, Akil Narayan, Hoang Tran, Clayton G. Webster
We first propose a novel criterion that guarantees that an $s$-sparse signal is the local minimizer of the $\ell_1/\ell_2$ objective; our criterion is interpretable and useful in practice.
1 code implementation • 20 Sep 2019 • Viktor Reshniak, Jeremy Trageser, Clayton G. Webster
We present a nonlocal variational image completion technique which admits simultaneous inpainting of multiple structures and textures in a unified framework.
1 code implementation • 24 May 2019 • Joseph Daws Jr., Clayton G. Webster
In this effort we propose a novel approach for reconstructing multivariate functions from training data, by identifying both a suitable network architecture and an initialization using polynomial-based approximations.