Efficient Partial Monitoring with Prior Information
暂无分享,去创建一个
[1] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[2] Thorsten Joachims,et al. Reducing Dueling Bandits to Cardinal Bandits , 2014, ICML.
[3] Andreas Krause,et al. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms , 2013, WWW.
[4] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[5] Nicolò Cesa-Bianchi,et al. Regret Minimization Under Partial Monitoring , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.
[6] Jean-Yves Audibert,et al. Minimax Policies for Adversarial and Stochastic Bandits. , 2009, COLT 2009.
[7] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[8] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[9] Gábor Bartók,et al. A near-optimal algorithm for finite partial-monitoring games against adversarial opponents , 2013, COLT.
[10] Csaba Szepesvári,et al. An adaptive algorithm for finite stochastic partial monitoring , 2012, ICML.
[11] Christian Schindelhauer,et al. Discrete Prediction Games with Arbitrary Feedback and Loss , 2001, COLT/EuroCOLT.
[12] Thorsten Joachims,et al. The K-armed Dueling Bandits Problem , 2012, COLT.
[13] Csaba Szepesvári,et al. Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments , 2011, COLT.