Adaptive Context Tree Weighting

  title={Adaptive Context Tree Weighting},
  author={A. O'Neill and Marcus Hutter and W. Shao and Peter Sunehag},
  journal={2012 Data Compression Conference},
  • A. O'Neill, Marcus Hutter, +1 author Peter Sunehag
  • Published 2012
  • Computer Science, Mathematics
  • 2012 Data Compression Conference
  • We describe an adaptive context tree weighting (ACTW) algorithm, as an extension to the standard context tree weighting (CTW) algorithm. Unlike the standard CTW algorithm, which weights all observations equally regardless of the depth, ACTW gives increasing weight to more recent observations, aiming to improve performance in cases where the input sequence is from a non-stationary distribution. Data compression results show ACTW variants improving over CTW on merged files from standard… CONTINUE READING

    Tables and Topics from this paper.


    Publications referenced by this paper.
    A universal algorithm for sequential data compression
    • 5,143
    • PDF
    The context-tree weighting method: basic properties
    • 644
    • PDF
    A Block-sorting Lossless Data Compression Algorithm
    • 2,575
    • PDF
    Compression of individual sequences via variable-rate coding
    • 3,327
    • PDF
    Arithmetic coding for data compression
    • 2,997
    On Prediction Using Variable Order Markov Models
    • 377
    • PDF
    Modeling for text compression
    • 276
    • PDF
    Data Compression Using Dynamic Markov Modelling
    • 237
    • PDF