Universal compression algorithms have been studied in the past for sequential change detection, where they have been used to estimate the post-change distribution in the modified version of the Cumulative Sum (CUSUM) Test. In this paper, we introduce a modified CUSUM test where the pre-change distribution is also unknown and an empirical version of the pre-change distribution is used to implement the algorithm. We present a study of various characteristics of this modified CUSUM Test and then prove its asymptotic optimality.
Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decision Theory
决策理论正式解决了不确定世界中理性主体的问题,如果真实的环境概率分布是已知的。Solomonoff的泛归纳理论形式化地解决了未知分布的序列预测问题。我们统一了这两种理论,并给出了强有力的论据,由此产生的通用AIXI模型在任何可计算的环境中表现最佳。AIXI模型的主要缺点是它是不可计算的。为了克服这个问题,我们构造了一个改进的算法AIXI^tl,它仍然优于任何其他时间t和空间l有界代理。AIXI^tl的计算时间为t x 2^l的数量级。
Exploration-Exploitation Tradeoff in Universal Lossy Compression
Viterbi Faculty of Electrical and Computer Engineering, Technion – Israel Institute of Technology(维特比电气工程与计算机科学学院,技术学院–以色列理工学院);Department of Electrical Engineering-Systems, Tel Aviv University(电气工程-系统系,特拉维夫大学)