3 papers
math.OC2022
Sufficient Conditions for Persistency of Excitation with Step and ReLU Activation Functions
Tyler Lekang, Andrew Lamperski
This paper defines geometric criteria which are then used to establish sufficient conditions for persistency of excitation with vector functions constructed from single hidden-laye…
math.OC2021
Wasserstein Contraction Bounds on Closed Convex Domains with Applications to Stochastic Adaptive Control
Tyler Lekang, Andrew Lamperski
This paper is motivated by the problem of quantitatively bounding the convergence of adaptive control methods for stochastic systems to a stationary distribution. Such bounds are u…
cs.LG2019
Simple Algorithms for Dueling Bandits
Tyler Lekang, Andrew Lamperski
In this paper, we present simple algorithms for Dueling Bandits. We prove that the algorithms have regret bounds for time horizon T of order O(T^rho ) with 1/2 <= rho <= 3/4, which…