| T. Weissman and N. Merhav, "On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise," in Proc. 12th Annu. Workshop on Computational Learning Theory, pp. 19-28, New York: ACM, 1999. |
....portfolio selection based on inaccurate data, coding based on noisy observations, etc. where the available information is incomplete. To the best of our knowledge, the problem of prediction of individual sequences based on noisy observations has thus far been considered only in [1] 40] and [41], for the case where the individual sequence is corrupted by an i.i.d. binary noise process (and the observed bits are the modulo 2 sum of the clean bit and the noise bit) and in [42] 43] for the case of additive, real valued noise. The basic problem is the following: at each time instant t ....
T. Weissman and N. Merhav, "On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise," in Proc. 12th Annu. Workshop on Computational Learning Theory, pp. 19-28, New York: ACM, 1999.
No context found.
T. Weissman and N. Merhav, "On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise," in Proc. 12th Annu. Workshop on Computational Learning Theory, pp. 19-28, New York: ACM, 1999.
No context found.
T. Weissman and N. Merhav, "On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise," in Proc. 12th Annu. Workshop on Computational Learning Theory, pp. 19-28, New York: ACM, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC