Tight Memory-Regret Lower Bounds for Streaming Bandits.
Shaoang LiLan ZhangJunhao WangXiang-Yang LiPublished in: CoRR (2023)
Keyphrases
- lower bound
- regret bounds
- upper bound
- branch and bound
- worst case
- branch and bound algorithm
- lower and upper bounds
- data streams
- upper and lower bounds
- np hard
- multi armed bandit
- expert advice
- objective function
- memory usage
- lower bounding
- memory requirements
- optimal solution
- stream processing
- real time
- streaming data
- sample complexity
- vc dimension
- memory space
- learning algorithm
- main memory
- image registration
- limited memory