C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms.
Qian Yu
Yining Wang
Baihe Huang
Qi Lei
Jason D. Lee
Published in:
CoRR (2023)
Keyphrases
</>
sample complexity
worst case
upper and lower bounds
theoretical analysis
upper bound
lower bound
constant factor
computational complexity
vc dimension
learning algorithm
average case
active learning
regret bounds
noisy data
machine learning algorithms
small number
support vector
machine learning
linear threshold