Universal Schemes for Sequential Decision from Individual Data Sequences

IEEE Transactions on Information Theory

Volumn 39, Issue 4, 1993, Pages 1280-1292

  Merhav, Neri ^a   Feder, Meir ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bayes envelope; Bayes response; empirical Bayes estimation; finite state machines; Index Terms Sequential compound decision problem; Lempel Ziv algorithm; recursive least squares

Indexed keywords

BINARY SEQUENCES; DATA COMPRESSION; DECISION THEORY; FINITE AUTOMATA; INFORMATION THEORY; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; OBSERVABILITY; RECURSIVE FUNCTIONS; SIGNAL PROCESSING; STATE ASSIGNMENT; STATE ESTIMATION;

BAYES ENVELOPE; BAYES RESPONSE; FINITE STATE MACHINES;

ALGORITHMS;

EID: 0027632407     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.243445     Document Type: Article

References (54)

1. P. H. Algoet, “Universal schemes for prediction, gambling, and portfolio selection,” Ann. Probab., Apr. 1992.
2. P. H. Algoet, “The strong law of large numbers for sequential decisions under uncertainty,” preprint.
3. P. H. Algoet and T. M. Cover, “Asymptotic optimality and asymptotic equipartition properties of log-optimum investment,” Ann. Probab., vol. 16, no. 2, pp. 876–898, 1988.
4. D. Blackwell, “An analog to the minimax theorem for vector payoffs,” Pac. J. Math., vol. 6, pp. 1–8, 1956.
5. T. M. Cover, “Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin,” Tech. Rep. 12, Dept. of Statist., Stanford Univ., 1974.
6. T. M. Cover, “Universal portfolios,” in Math. Finance, vol. 1, no. 1, pp. 1–29, Jan. 1991.
7. T. M. Cover and A. Shenhar, “Compound Bayes predictors for sequences with apparent Markov structure,” IEEE Trans. Syst. Man. Cybern., vol. SMC-7, pp. 421–424, May—June 1977.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley, 1991.
9. I. Csiszár and J. Körner Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
10. L. D. Davisson, “Minimax noiseless universal coding for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-29, no. 2, pp. 211–215, 1983.
11. M. Feder, “Gambling using a finite-state machine,” IEEE Trans. Inform. Theory, vol. IT-37, no. 5, pp. 1459–1465, Sept. 1991.
12. M. Feder, N. Merhav, and M. Gutman, “Universal prediction of individual sequences,” IEEE Trans. Inform. Theory, vol. 38, no. 4, pp. 1258–1270, July 1992.
13. A. Gill, Introduction to the Theory of Finite-State Machines. New York: McGraw Hill, 1962.
14. D. C. Gilliland, “Asymptotic risk stability resulting from play against the past in a sequence of decision problems,” IEEE Trans. Inform. Theory, vol. IT-18, no. 5, pp. 614–617, Sept. 1972.
15. D. C. Gilliland, “Sequential compound estimation,” Ann. Math. Statist., vol. 39, no. 6, pp. 1890–1904, 1968.
16. D. C. Gilliland and M. K. Helmers, “On the continuity of the Bayes response,” IEEE Trans. Inform. Theory, vol. IT-24, no. 4, pp. 506–508, July 1978.
17. D. C. Gilliland and J. F. Hannan, “On an extended compound decision problem,” Ann. Math. Statist., vol. 40, no. 5, 1536–1541, 1969.
18. G. C. Goodwin and R. L Payne, Dynamic System Identification: Experiment Design and Data Analysis., (Mathematics in Science and Engin ∊ ring), vol. 136. New York: Academic Press, 1977.
19. R. M. Gray, “Vector quantization,” IEEE ASSP Mag., vol. 1, no. 2, pp. 4–29, 1984.
20. R. M. Gray, Probability, Random Processes, and Ergodic Properties. New York: Springer-Verlag, 1988.
21. J. F. Hannan, “Approximation to Bayes risk in repeated plays,” in Contributions to the Theory of Games, vol. III, Annals of Mathematics Studies. Princeton, NJ: Princeton Univ. Press, 1957, no. 39, pp. 97–139.
22. J. F. Hannan and H. Robbins, “Asymptotic solutions of the compound decision problem for two completely specified distributions,”Ann. Math. Statist., vol. 26, pp. 37–51, 1957.
23. S. Haykin, Adaptive Filter Theory. Englewood Cliffs, NJ: Prentice-Hall, 1986.
24. M. E. Hellman, “The effects of randomization on finite-memory decision schemes,” IEEE Trans. Inform. Theory, IT-18, no. 4, pp. 499–502, 1972.
25. M. E. Hellman and T. M. Cover, “Learning with finite memory,” Ann. Math. Statist., vol. 41, no. 3, pp. 765–782, 1970.
26. M. E. Hellman and T. M. Cover, “On memory saved by randomization,” Ann. Math. Statist., vol. 42, no. 3, 1075–1078, 1971.
27. N. S. Jayant and P. Noll, Digital Coding of Waveforms. Englewood Cliffs, NJ: Prentice-Hall, 1984.
28. M. V. Johns, Jr., “Two-action compound decision problems,” Proc. Fifth Berkeley Symposium Mathematical and Statistical Probability. Berkeley, CA: Univ. of California Press, 1967 vo1. 1, pp. 463–478.
29. J. L. Kelly, Jr., “A new interpretation of information rate,” Bell Syst. Tech. J., vol. 35, pp. 917–926, 1956.
30. R. E. Krichevsky, “The relation between redundancy coding and the reliability of information from a source,” Probl. Inform. Transm., vol. 4, no. 3, pp. 37–45, 1968.
31. R. E. Krichevsky and V. K. Trofimov, “The performance of universal encoding,” IEEE Trans. Inform. Theory, IT-27, no. 2, pp. 199–207, Mar. 1981.
32. R. Krzystofowicz, “Markovian forecast processes,”. J. Amer. Statist. Assoc., vol. 82, no. 397, pp. 31–37, Mar. 1987.
33. J. Rissanen and G. G. Langdon, Jr., “Universal modeling and coding,” IEEE Trans. Inform. Theory, vol. IT-27, no. 1, pp. 12–23, Jan. 1981.
34. F. T. Leighton and R. L. Rivest, “Estimating a probability using finite memory,” IEEE Trans. Inform. Theory, vol. IT-32, no. 6, pp. 733–742, Nov. 1986.
35. Y. Linde, A. Buzo, and R. M. Gray, “An algorithm for vector quantizer design,” IEEE Trans. Commun., vol. COM-28, no. 1, pp. 84–95, 1980.
36. J. Makhoul, “Linear prediction: A tutorial review,” Proc, IEEE, vol. PROC-63, no. 4, 1975.
37. J. Makhoul, S. Roucos, and H. Gish, “Vector quantization in speech coding,” Proc. IEEE, vol. PROC-73, no. 11, pp. 1551–1588, 1985.
38. J. D. Markel and A. H. Gray, Jr., Linear Prediction of Speech. New York: Springer-Verlag, 1976.
39. Y. Nogami, “The k-extended set-compound estimation problem in a nonregular family of distributions over [θ,θ + 1),” Ann. Inst. Statist. Math., vol. 31A, 169–176, 1979.
40. E. Plotnik, M. J. Weinberger, and J. Ziv, “Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm,” IEEE Trans. Inform. Theory, vol. 38, no. 1, pp. 66–72, Jan. 1992.
41. J. Rissanen, “Universal coding, information, prediction, and estimation,” IEEE Trans. Inform. Theory, vol. IT-30, no. 4, pp. 629–636, July 1984.
42. J. Rissanen, “Stochastic complexity and modeling,” Ann. Statist., vol. 14, no. 3, pp. 1080–1100, 1986.
43. H. Robbins, “Asymptotically subminimax solutions of compound statistical decision problems,” in Proc. 2nd Berkeley Symp. Math. Statist. Probab., 1951, pp. 131–148.
44. B. Ya. Ryabko, “Twice-universal coding,” Probl. Inform. Transm., vol. 20, pp. 173–177, July-Sept. 1984.
45. B. Ya. Ryabko, “Prediction of random sequences and universal coding,” Probl. Inform. Transm., vol. 24, p p. 87–96, Apr.-June 1988.
46. E. Samuel, “Asymptotic solutions of the sequential compound decision problem,” Ann. Math Statist., vol. 34, p p. 1079–1095, 1963.
47. E. Samuel, “Convergence of the losses of certain decision rules for the sequential compound decision problem,” Ann. Math. Statist., vol. 35, pp. 1606–1621, 1964.
48. C. P. Schnorr, “A unified approach to the definition of random sequences,” Math. Syst. Theory, vol. 5, no. 3, pp. 246–258, 1971.
49. B. O. Shubert “Finite-memory classification of Bernoulli sequences using reference samples,” IEEE Trans. Inform. Theory, vol. IT-20, no. 3, pp. 384–387, 1974.
50. D. D. Swain, “Bounds and rates of convergence for the extended compound estimation problem in the sequence case,” Tech. Rep. no. 81, Dept. of Statistics, Stanford Univ., Stanford, CA. 1965.
51. J. Van Ryzin, “The sequential compound decision problem with m x n finite loss matrix,” Ann. Math. Statist., vol. 37, p p. 954–975, 1966.
52. S. B. Vardeman, “Admissible solutions of k-extended finite state set and sequence compound decision problems,” J. Multivariate Anal., vol. 10, pp. 426–441, 1980.
53. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 530–536, Sept. 1978.
54. J. Ziv, “Compression, tests for randomness, and estimating the statistical model of an individual sequence,” in Sequences, R. M. Capocelli, Ed. New York: Springer-Verlag, 1990, pp. 366–373.