6 citations · 17 across the 8 of their papers we have counts for
8 papers
Adversarial Attacks on Cooperative Multi-agent Bandits
Jinhang Zuo, Zhiyao Zhang, Xuchuang Wang +5
Cooperative multi-agent multi-armed bandits (CMA2B) consider the collaborative efforts of multiple agents in a shared multi-armed bandit game. We study latent vulnerabilities expos…
Robust Learning for Smoothed Online Convex Optimization with Feedback Delay
Pengfei Li, Jianyi Yang, Adam Wierman +1
We study a challenging form of Smoothed Online Convex Optimization, a.k.a. SOCO, including multi-step nonlinear switching costs and feedback delay. We propose a novel machine learn…
Adversarial Attacks on Online Learning to Rank with Click Feedback
Jinhang Zuo, Zhiyao Zhang, Zhiyong Wang +3
Online learning to rank (OLTR) is a sequential decision-making problem where a learning agent selects an ordered list of items and receives feedback through user clicks. Although p…
A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
Zaiwei Chen, Kaiqing Zhang, Eric Mazumdar +2
We study two-player zero-sum stochastic games, and propose a form of independent learning dynamics called Doubly Smoothed Best-Response dynamics, which integrates a discrete and do…
Online switching control with stability and regret guarantees
Yingying Li, James A. Preiss, Na Li +3
This paper considers online switching control with a finite candidate controller pool, an unknown dynamical system, and unknown cost functions. The candidate controllers can be uns…
Decentralized Online Convex Optimization in Networked Systems
Yiheng Lin, Judy Gan, Guannan Qu +2
We study the problem of networked online convex optimization, where each agent individually decides on an action at every time step and agents cooperatively seek to minimize the to…