Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms.
Qian YuYining WangBaihe HuangQi LeiJason D. LeePublished in: NeurIPS (2023)
Keyphrases
- sample complexity
- upper and lower bounds
- worst case
- theoretical analysis
- lower bound
- constant factor
- computational complexity
- upper bound
- vc dimension
- learning algorithm
- regret bounds
- average case
- learning problems
- support vector
- data dependent
- machine learning
- machine learning algorithms
- decision trees
- pac model
- linear threshold