自适应上下文树加权
Adaptive Context Tree Weighting
摘要:
我们描述了自适应上下文树加权(ACTW)算法,作为标准上下文树加权(CTW)算法的扩展。与标准CTW算法不同,该算法对所有观测值进行同等权重,而不管深度如何,ACTW对最近的观测值赋予越来越大的权重,旨在提高输入序列来自非平稳分布的情况下的性能。数据压缩结果显示,ACTW变体在标准压缩基准测试中的合并文件上的性能优于CTW,而在任何单个文件上的性能都不会明显变差。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。