Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
<|reference_start|>Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback: Learning from human feedback plays an important role in aligning generative models, such as large language models (LLM). However, the effectiveness of this approach can be influenced by adversaries, who may intentionally provide misleading preferences to manipulate the output in an undesirable or harmful direction. To tackle this challenge, we study a specific model within this problem domain--contextual dueling bandits with adversarial feedback, where the true preference label can be flipped by an adversary. We propose an algorithm namely robust contextual dueling bandit (\algo), which is based on uncertainty-weighted maximum likelihood estimation. Our algorithm achieves an $\tilde O(d\sqrt{T}+dC)$ regret bound, where $T$ is the number of rounds, $d$ is the dimension of the context, and $ 0 \le C \le T$ is the total number of adversarial feedback. We also prove a lower bound to show that our regret bound is nearly optimal, both in scenarios with and without ($C=0$) adversarial feedback. Additionally, we conduct experiments to evaluate our proposed algorithm against various types of adversarial feedback. Experimental results demonstrate its superiority over the state-of-the-art dueling bandit algorithms in the presence of adversarial feedback.<|reference_end|>
@article{di2024nearly,
    title={Nearly Optimal Algorithms for Contextual Dueling Bandits from
  Adversarial Feedback},
    author={Qiwei Di, Jiafan He, Quanquan Gu},
    journal={arXiv preprint arXiv:2404.10776},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.10776},
    primaryClass={cs.LG}
}