scholarly journals Adaptive Context Tree Weighting

Author(s):  
Alexander O'Neill ◽  
Marcus Hutter ◽  
Wen Shao ◽  
Peter Sunehag
Keyword(s):  
2007 ◽  
Vol 53 (5) ◽  
pp. 1860-1866 ◽  
Author(s):  
Jacob Ziv ◽  
Neri Merhav

2011 ◽  
Vol 43 (03) ◽  
pp. 735-759 ◽  
Author(s):  
Sandro Gallo

We present a new perfect simulation algorithm for stationary chains having unbounded variable length memory. This is the class of infinite memory chains for which the family of transition probabilities is represented by a probabilistic context tree. We do not assume any continuity condition: our condition is expressed in terms of the structure of the context tree. More precisely, the length of the contexts is a deterministic function of the distance to the last occurrence of some determined string of symbols. It turns out that the resulting class of chains can be seen as a natural extension of the class of chains having a renewal string. In particular, our chains exhibit a visible regeneration scheme.


2012 ◽  
Vol 6 (1) ◽  
pp. 186-209 ◽  
Author(s):  
Antonio Galves ◽  
Charlotte Galves ◽  
Jesús E. García ◽  
Nancy L. Garcia ◽  
Florencia Leonardi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document