Compound sequential decisions against the well-informed antagonist

2006 IEEE Information Theory Workshop, ITW 2006

Volumn , Issue , 2006, Pages 77-81

  Weissman, Tsachy ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC FILTER; MEMORYLESS CHANNELS; NOISE-CORRUPTED SEQUENCE; SEMI-STOCHASTIC SETTING;

COMMUNICATION CHANNELS (INFORMATION THEORY); MATHEMATICAL MODELS; SPURIOUS SIGNAL NOISE;

INFORMATION THEORY;

EID: 33751070099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R. J. Ballard. Extended rules for the sequence compound decision problem with m × n component. PhD thesis, Michicgan State University, 1974.
2. R. J. Ballard, D. C. Gilliland, and J. Hannan. O(N-1/2) convergence to k-extended Bayes risk in the sequence compound decision problem with m × n component. Statistics and Probability RM-333, Michigan State University, 1974.
3. N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R. Schapire, and M.K. Warmuth. How to use expert advice. Journal of the ACM, 44(3):427-485, 1997.
4. N. Cesa-Bianchi and G. Lugosi. On prediction of individual sequences. Ann. Stat., 27(6):1865-1895, 1999.
5. J. Chan and T. Berger. The capacity of finite-state Markov channels with feedback. IEEE Trans, on Inf. Th., (51):780-789, 2005.
6. T.M. Cover. Behavior of sequential predictors of binary sequences. Transactions of the Fourth Prague Conference on Information Theory, September 1966. Prague.
7. T.M. Cover and A. Shenhar. Compound bayes predictors for sequences with apparent Markov structure. IEEE Transactions on Systems, Man and Cybernetics, SMC-7(6):421-424, June 1977.
8. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York, 1996.
9. J. Hannan. Approximation to Bayes risk in repeated play. Contributions to the Theory of Games, 111:97-139, 1957. Princeton, NJ.
10. N. Merhav and M. Feder. Universal prediction. IEEE Trans. Inform. Theory, 44(6):2124-2147, October 1998.
11. N. Merhav, E. Ordentlich, G. Seroussi, and M. J. Weinberger. On sequential strategies for loss functions with memory. IEEE Trans. Inform. Theory, 48(7):1947-1958, July 2002.
12. H. Robbins. Asymptotically subminimax solutions of compound statistical decision problems. Proc. Second Berkeley Symp. Math. Statis. Prob., pages 131-148, 1951.
13. J. Van Ryzin. The sequential compound decision problem with m × n finite loss matrix. Ann. Math. Statist., 37:954-975, 1966.
14. E. Samuel. Asymptotic solutions of the sequential compound decision problem. Ann. Math. Statist., pages 1079-1095, 1963.
15. S. B. Vardeman. A note on the applicability of sequence compound decision schemes. Scand. J. Statist., (6):86-88, 1979.
16. S. B. Vardeman. Admissible solutions of k-extended finite state set and the sequence compound decision problems. J. Multiv. Anal., 10:426-441, 1980.
17. S. B. Vardeman. Approximation to minimum k-extended Bayes risk in sequences of finite state decision problems and games. Bulletin of the Institute of Mathematics Academia Sinica, 10(1):35-52, March 1982.
18. V. Vovk. Aggregating strategies. Proc. 3rd Annu. Workshop on Computational Learning Theory, pages 371-383, 1990. San Mateo, CA: Kaufmann.
19. T. Weissman, E. Ordentlich, M. J. Weinberger, A. Somekh-Baruch, and N. Merhav. Universal filtering via prediction. HP Technical report, February 2006.