Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms

Devs

Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms | Read Paper on Bytez