Combining initial segments of lists
暂无分享,去创建一个
[1] Wouter M. Koolen,et al. Follow the leader if you can, hedge if you must , 2013, J. Mach. Learn. Res..
[2] Nicolò Cesa-Bianchi,et al. Combinatorial Bandits , 2012, COLT.
[3] Wouter M. Koolen,et al. Adaptive Hedge , 2011, NIPS.
[4] Tamás Linder,et al. Efficient Tracking of Large Classes of Experts , 2011, IEEE Transactions on Information Theory.
[5] Wouter M. Koolen,et al. Hedging Structured Concepts , 2010, COLT 2010.
[6] András György,et al. On-line Sequential Bin Packing , 2010, COLT.
[7] Manfred K. Warmuth,et al. Learning Permutations with Exponential Weights , 2007, COLT.
[8] Timothy M. Chan,et al. Necklaces, Convolutions, and X+Y , 2006, Algorithmica.
[9] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[10] Petri Myllymäki,et al. A Fast Normalized Maximum Likelihood Algorithm for Multinomial Data , 2005, IJCAI.
[11] Y. Mansour,et al. Improved second-order bounds for prediction with expert advice , 2005, Machine Learning.
[12] Tamás Linder,et al. Tracking the Best of Many Experts , 2005, COLT.
[13] Marcus Hutter,et al. Adaptive Online Prediction by Following the Perturbed Leader , 2005, J. Mach. Learn. Res..
[14] Nimrod Megiddo,et al. Outperforming LRU with an adaptive replacement cache algorithm , 2004, Computer.
[15] Manfred K. Warmuth,et al. Tracking a Small Set of Experts by Mixing Past Posteriors , 2003, J. Mach. Learn. Res..
[16] Manfred K. Warmuth,et al. Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..
[17] Darrell D. E. Long,et al. Adaptive disk spin‐down for mobile computers , 2000, Mob. Networks Appl..
[18] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[19] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine Learning.
[20] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[21] David Haussler,et al. How to use expert advice , 1993, STOC.
[22] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[23] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[24] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .
[25] Wouter M. Koolen. Combining strategies efficiently: high-quality decisions from conflicting advice , 2011 .
[26] Berthold Vöcking,et al. Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm , 2010, Electron. Colloquium Comput. Complex..
[27] Manfred K. Warmuth,et al. Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension , 2008 .
[28] Elad Hazan,et al. Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization , 2008, COLT.
[29] Manfred K. Warmuth,et al. Optimal strategies from random walks , 2008, COLT 2008.
[30] Anindya Sen,et al. Making Online Predictions from K-Lists , 2007 .
[31] D. Helmbold,et al. Adaptive Caching by Experts , 2003 .
[32] Nimrod Megiddo,et al. One Up on LRU , 2003, login Usenix Mag..
[33] Scott A. Brandt,et al. Adaptive Caching by Refetching , 2002, NIPS.