No-regret Algorithms for Online Convex Programs
暂无分享,去创建一个
[1] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .
[2] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[3] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[4] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[5] Robert E. Schapire,et al. Predicting Nearly as Well as the Best Pruning of a Decision Tree , 1995, COLT.
[6] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[7] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[8] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[9] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[10] Geoffrey J. Gordon,et al. Approximate solutions to markov decision processes , 1999 .
[11] J. Shawe-Taylor. Potential-Based Algorithms in On-Line Prediction and Game Theory ∗ , 2001 .
[12] Adam Tauman Kalai,et al. Geometric algorithms for online optimization , 2002 .
[13] Manfred K. Warmuth,et al. Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..
[14] Avrim Blum,et al. Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.
[15] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[16] No-Regret Algorithms for Structured Prediction Problems , 2005 .
[17] Yoram Singer,et al. Convex Repeated Games and Fenchel Duality , 2006, NIPS.