- Journal of Machine Learning Research 8 (2007) 2369-2403 Submitted 4/07; Revised 8/07; Published 10/07 The On-Line Shortest Path Problem Under Partial Monitoring
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 7, JULY 2003 1821 Codecell Convexity in Optimal Entropy-Constrained
- IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 52, NO. 8, AUGUST 2004 2337 Efficient Adaptive Algorithms and Minimax Bounds
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 11, NOVEMBER 2003 3031 Do Optimal Entropy-Constrained Quantizers Have a Finite
- 2704 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 7, NOVEMBER 2000 Let a ! 0 and T ! 0 first, and then let k ! 1 to obtain
- 5570 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 12, DECEMBER 2006 Symbol-Based Modeling and Coding of
- A \Follow the Perturbed Leader"-type Algorithm for Zero-Delay Quantization of Individual Sequences
- Continuous Time Associative Bandit Problems Andras Gyorgy1
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 11, NOVEMBER 2005 4013 H( ^Xkj ^Xk01
- 416 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 On the Structure of Optimal Entropy-Constrained
- 2110 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 6, SEPTEMBER 1999 On the Rate-Distortion Function of Random Vectors
- 1604 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 4, APRIL 2008 Tracking the Best Quantizer
