Adaptive context tree weighting

Alexander O'Neill*, Marcus Hutter, Wen Shao, Peter Sunehag

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    8 Citations (Scopus)

    Abstract

    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 compression benchmark tests while never being significantly worse on any individual file.

    Original languageEnglish
    Title of host publicationProceedings - DCC 2012
    Subtitle of host publication2012 Data Compression Conference
    Pages317-326
    Number of pages10
    DOIs
    Publication statusPublished - 2012
    Event2012 Data Compression Conference, DCC 2012 - Snowbird, UT, United States
    Duration: 10 Apr 201212 Apr 2012

    Publication series

    NameData Compression Conference Proceedings
    ISSN (Print)1068-0314

    Conference

    Conference2012 Data Compression Conference, DCC 2012
    Country/TerritoryUnited States
    CitySnowbird, UT
    Period10/04/1212/04/12

    Fingerprint

    Dive into the research topics of 'Adaptive context tree weighting'. Together they form a unique fingerprint.

    Cite this