M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38(4):1258--1270, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Minimizing the Average Cost of Paging and Registration: A.. - Rose (1995) (37 citations) (Correct)
....on can be removed [16] In both this paper and in [11] the problem of how p ijm (t) may be derived or measured is left open. Future work should consider the issue of location process characterization and prediction. Recent results in optimal prediction theory based on empirical sequences [17] may prove useful in this regard. It is also possible to formulate the optimal paging registration problem in terms of decision theory. In particular, one may assume the mobile terminal knows its location as well as the cost to be incurred by a paging event at time t. In as much 13 as this ....
M. Feder, N. Mehrav, and M. Gutman. Universal Prediction of Individual Sequences. IEEE Transactions on Information Theory, 38(4):1258--1270, September 1993.
A Gentle Introduction to the Universal Algorithmic Agent AIXI - Hutter (2003) (2 citations) (Correct)
....AIXI model. Conversely, one can downscale the AI# model by using more restricted forms of #. This could be done in the same way as the theory of universal induction has been downscaled with many insights to the Minimum Description Length principle [LV92a, Ris89] or to the domain of finite automata [FMG92]. The AIXI model might similarly serve as a super model or as the very definition of (universal unbiased) intelligence, from which specialized models could be derived. Implementation and approximation. With a reasonable computation time, the AIXI model would be a solution of AI (see next point if ....
.... VW98] Related topics are the Weighted Majority Algorithm invented by Littlestone and Warmuth [LW94] universal forecasting by Vovk [Vov92] Levin search [Lev73] pac learning introduced by Valiant [Val84] and Minimum Description Length [LV92a, Ris89] Resource bounded complexity is discussed in [Dal73, Dal77, FMG92, Ko86, PF97], resource bounded universal probability in [LV91, LV97, Sch02b] Implementations are rare and mainly due to Schmidhuber [Con97, Sch97, SZW97, Sch02a] Excellent reviews with a philosophical touch are [LV92b, Sol97] For an older, but general review of inductive inference see Angluin [AS83] ....
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258--1270, 1992.
Smooth Online Learning of Expert Advice - Yaroshinsky, El-Yaniv (2001) (2 citations) (Correct)
.... of worst case analysis of online algorithms has been emerged and used in various disciplines such as statistics [Che54, Mil54] where it is called regret analysis) computer science [ST85, BEY98] where it is called competitive analysis) game theory [Bla56] and information theory [Cov91, FMG92] We use this approach here. The problem of online prediction using expert advice falls within the more general context of online classification and regression, whereby a learning algorithm needs to predict the label or value assigned to each of a sequence of feature vectors that is sequentially ....
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258--1270, 1992.
On Optimal Sequential Prediction for General Processes - Nobel (2001) (Correct)
....decisions of the individual schemes in F . Aggregating methods, and corresponding bounds on the di erence between the loss of the aggregate scheme and that of the best scheme in the family, have been established in a variety of settings. Representative work and further references can be found in [41, 17, 27, 10, 9, 25]. Foster and Vohra [19] give an account of the aggregating problem and its history. Merhav and Feder [28] give an overview of prediction from individual sequences. Weissman and Merhav [43] establish nite sample aggregation bounds for the prediction of individual binary sequences observed in ....
M. Feder, N. Merhav, and M. Gutman, Universal prediction of individual sequences. IEEE Trans. Info. Theory, vol.38, pp.1258-1270, 1992. 32
Regret in the On-line Decision Problem - Foster, Vohra (1997) (37 citations) (Correct)
....a decision scheme that is comparable to F . Consider the case when F consists of just two schemes A and B. Let L t and L t be the loss incurred by using schemes A and B in time t respectively. Let The expectation is with respect to the randomization induced by S. Some authors, 25] and [10], have studied the ratio min P2F L T (P ) However, bounds on the ratio can be derived from bounds on the difference LT (S) Gamma minP2F LT (P ) C be a scheme that follows A in time t with probability w t and scheme B with probability 1 Gamma w t . In effect, C is a decision scheme whose ....
....2. All have involved the use of an algorithm that chooses to predict 0 or 1 in proportion to their payoffs with exponential weights. The exponential weighted algorithm just alluded to was introduced by Littlestone and Warmuth [25] Desantis, Markowski and Wegman [8] Feder, Mehrav and Gutman [10] and Vovk [28] at about the same time. Vovk [28] shows how the exponential weighted algorithm can be used to prove Theorem 2 for any bounded loss function (but the states of the world are either 0 or 1) Cesa Bianchi, Freund, Helmbold, Haussler, Schapire and Warmuth [5] study the special case of ....
Feder, M., N. Mehrav and M. Gutman, `Universal prediction of individual sequences', IEEE Transactions on Information Theory, 38, 1258-1270, 1992.
Universal Prediction - Merhav, Feder (1998) (17 citations) Self-citation (Feder Merhav) (Correct)
No context found.
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.
Universal Prediction of Individual Binary Sequences in the.. - Weissman, Merhav (1999) (1 citation) Self-citation (Merhav) (Correct)
.... almost as well have been, and are still being, studied by many researchers from different disciplines. The literature pertaining to this setting, under a variety of loss functions and expert classes, is far too plentiful to be specified briefly. Representative examples can be found in [2] 3] [10], 39] 14] 38] 4] and in the many references therein. The reader is referred to [17] for an overview of this setting and for a more comprehensive list of references. One of the directions suggested for future research in [17] was an investigation of the case where only a noisy version of ....
M. Feder, N. Merhav, and M. Gutman, "Universal Prediction of Individual Sequences," IEEE Trans. Inform. Theory, vol. 38, pp. 1258-1270, July 1992.
On Limited-Delay Lossy Coding and Filtering of Individual.. - Weissman, Merhav (2000) (3 citations) Self-citation (Merhav) (Correct)
....denote the class of all source codes in (R) with a decoder of finite memory s. Note that, similarly to a finite memory decoder, one can define a finite state decoder (cf. 17] While, admittedly, not every finite state encoder is a finite memory encoder, one can show, using the techniques of [5, 12], that finite memory machines perform asymptotically as well as finite state machines. Thus, the classes F s (R) are relevant for the modeling of a variety of coding schemes in applications which require a finite (or zero) delay. In many such situations, practically any randomized encoder ....
M. Feder, N. Merhav, and M. Gutman, "Universal Prediction of Individual Sequences," IEEE Trans. Inform. Theory, vol. 38, pp. 1258-1270, July 1992.
A Note On Sequence Prediction - Travis Gagie Department (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38(4):1258--1270, 1992.
IEEE August 2003 3 - Research Feature Published (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman, "Universal Prediction of Individual Sequences," IEEE Trans. Information Theory, vol. 38, 1992, pp. 1258-1270. August 2003 9
Using Factor Oracles for Machine Improvisation - Assayag, Dubnov (2004) (Correct)
No context found.
Feder M, Merhav N, Gutman M (1992) Universal Prediction of Individual Sequences, IEEE Trans. Information Theory, Vol. 38, pp. 1258--1270. August 2003
Prediction and Dimension - Fortnow, Lutz (2002) (1 citation) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transations on Information Theory, 38:1258-1270, 1992.
An Information-Theoretic Framework for Optimal Location.. - Misra, Roy, Das (2004) (1 citation) (Correct)
No context found.
M. Feder, N. Merhav and M. Gutman, "Universal prediction of individual sequences, " IEEE Transactions on Information Theory, vol. 38, no. 4, pp. 1258-1270, July 1992.
Evaluating Location Predictors with Extensive Wi-Fi Mobility.. - Song, Kotz, Jain, He (2004) (3 citations) (Correct)
No context found.
Meir Feder, Neri Merhav, and Michael Gutman, "Universal prediction of individual sequences," IEEE Transactions on Information Theory, vol. 38, no. 4, pp. 1258--1270, July 1992.
Linear Time Universal Coding and Time Reversal of Tree .. - Martin, Seroussi.. (2004) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman, "Universal prediction of individual sequences," IEEE Trans. Inform. Theory, vol. IT-38, pp. 1258--1270, July 1992.
Universal Discrete Denoising: Known Channel - Weissman, Ordentlich.. (2003) (1 citation) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Trans. Inform. Theory, 38:1258--1270, July 1992.
Optimality of Universal Bayesian Sequence Prediction for General.. - Hutter (2003) (1 citation) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258--1270, 1992.
Evaluating Next-Cell Predictors with Extensive Wi-Fi.. - Song, Kotz, Jain, He (2004) (Correct)
No context found.
Meir Feder, Neri Merhav, and Michael Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38(4):1258--1270, July 1992.
Unknown - (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258--1270, 1992.
Prediction and Dimension - Fortnow, Lutz (2003) (1 citation) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transations on Information Theory, 38:1258--1270, 1992.
Evaluating Location Predictors with Extensive Wi-Fi Mobility.. - Song, Kotz, Jain, He (2004) (3 citations) (Correct)
No context found.
Meir Feder, Neri Merhav, and Michael Gutman, "Universal prediction of individual sequences," IEEE Transactions on Information Theory, vol. 38, no. 4, pp. 1258--1270, July 1992.
On Prediction of Individual Sequences - Cesa-Bianchi, Lugosi (1998) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258--1270, 1992.
Using Factor Oracles for Machine Improvisation - Assayag, Dubnov (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman, "Universal Prediction of Individual Sequences," IEEE Trans. Information Theory, vol. 38,
Efficient Learning of Typical Finite Automata from .. - Freund, Kearns.. (1996) (20 citations) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258--1270, 1992.
Towards a Universal Theory of Artificial Intelligence based on.. - Hutter (2000) (2 citations) (Correct)
No context found.
M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258-- 1270, 1992. 7
First 50 documents Next 50
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