4 citations · 4 across the 8 of their papers we have counts for
5 papers · 1 filter
A second order regret bound for NormalHedge
Yoav Freund, Nicholas J. A. Harvey, Victor S. Portella +2
We consider the problem of prediction with expert advice for ``easy'' sequences. We show that a variant of NormalHedge enjoys a second-order -quantile regret bound of $O\big(\sq…
Private-RAG: Answering Multiple Queries with LLMs while Keeping Your Data Private
Ruihan Wu, Erchi Wang, Zhiyuan Zhang +1
Retrieval-augmented generation (RAG) enhances large language models (LLMs) by retrieving documents from an external corpus at inference time. When this corpus contains sensitive in…
Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs
Hongyi Liu, Jiaji Huang, Zhen Jia +2
Speculative decoding is widely used in accelerating large language model (LLM) inference. In this work, we focus on the online draft model selection problem in speculative decoding…
No-Regret Linear Bandits under Gap-Adjusted Misspecification
Chong Liu, Dan Qiao, Ming Yin +2
This work studies linear bandits under a new notion of gap-adjusted misspecification and is an extension of Liu et al. (2023). When the underlying reward function is not linear, ex…
Communication-Efficient Federated Non-Linear Bandit Optimization
Chuanhao Li, Chong Liu, Yu-Xiang Wang
Federated optimization studies the problem of collaborative function optimization among multiple clients (e.g. mobile devices or organizations) under the coordination of a central…