Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms
Year: 2014
Type: conference-paper
Source: Conference on Learning Theory
Institution: KTH Royal Institute of Technology
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: closed
OpenAlex ID: W2028404160
