BriefGPT.xyz
Jun, 2019
通过解游戏进行非渐近纯探索
Non-Asymptotic Pure Exploration by Solving Games
HTML
PDF
Rémy Degenne, Wouter M. Koolen, Pierre Ménard
TL;DR
本文提出了一种适用于纯探索问题和赌博机结构的不需完全解决优化问题的优化算法,并获得了对指数族的适应性和有限信心保证。
Abstract
pure exploration
(aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mistakes and take few samples. Lower bounds (for
→