Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback
Ankan Saha
Video in druga učna gradiva
Oznake: computer science;optimization methods
The study of online convex optimization in the bandit setting was initiated by Kleinberg (2004) and Flaxman et al. (2005). Such a setting models a decision maker that has to make decisions in the face of adversarially chosen convex loss functions. Moreover, the only information the decision ma ...
Leto: 2011 Vir: videolectures.net
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Repozitorij:
Tipologija:
Jezik: