Search Results for author: Junyan Liu

Found 2 papers, 0 papers with code

Achieving Near-Optimal Regret for Bandit Algorithms with Uniform Last-Iterate Guarantee

no code implementations20 Feb 2024 Junyan Liu, Yunfan Li, Lin Yang

This paper introduces a stronger performance measure, the uniform last-iterate (ULI) guarantee, capturing both cumulative and instantaneous performance of bandit algorithms.

Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions

no code implementations8 Jun 2021 Junyan Liu, Shuai Li, Dapeng Li

Our algorithm not only achieves near-optimal regret in the stochastic setting, but also obtains a regret with an additive term of corruption in the corrupted setting, while maintaining efficient communication.

Multi-Armed Bandits Open-Ended Question Answering

Cannot find the paper you are looking for? You can Submit a new open access paper.