On Abruptly-Changing and Slowly-Varying Multiarmed Bandit Problems. - Lai Wei 002; Vaibhav Srivastava (ACC, 2018)

On Distributed Multi-Player Multiarmed Bandit Problems in Abruptly Changing Environment. - Lai Wei 002; Vaibhav Srivastava (CDC, 2018)

Expedited Multi-Target Search with Guaranteed Performance via Multi-fidelity Gaussian Processes. - Lai Wei 002; Xiaobo Tan; Vaibhav Srivastava (IROS, 2020)

Minimax Policy for Heavy-tailed Multi-armed Bandits. - Lai Wei 002; Vaibhav Srivastava (CoRR, 2020)

Online Estimation and Coverage Control with Heterogeneous Sensing Information. - Andrew McDonald 003; Lai Wei 002; Vaibhav Srivastava (CCTA, 2021)

Multi-Robot Gaussian Process Estimation and Coverage: Deterministic Sequencing Algorithm and Regret Analysis. - Lai Wei 002; Andrew McDonald 003; Vaibhav Srivastava (ICRA, 2021)

Regret Analysis of Distributed Gaussian Process Estimation and Coverage. - Lai Wei 002; Andrew McDonald 003; Vaibhav Srivastava (CoRR, 2021)

Nonstationary Stochastic Multiarmed Bandits: UCB Policies and Minimax Regret. - Lai Wei 002; Vaibhav Srivastava (CoRR, 2021)

Minimax Policy for Heavy-Tailed Bandits. - Lai Wei 002; Vaibhav Srivastava (IEEE Control. Syst. Lett., 2021)