TY - GEN
T1 - On compressibility and acceleration of orthogonal nmf for pomdp compression
AU - Li, Xin
AU - CHEUNG, Kwok Wai
AU - LIU, Jiming
N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - State space compression is one of the recently proposed approaches for improving POMDP's tractability. Despite its initial success, it still carries two intrinsic limitations. First, not all POMDP problems can be compressed equally well. Also, the cost of computing the compressed space itself may become significant as the size of the problem is scaled up. In this paper, we address the two issues with respect to an orthogonal non-negative matrix factorization recently proposed for POMDP compression. In particular, we first propose an eigenvalue analysis to evaluate the compressibility of a POMDP and determine an effective range for the dimension reduction. Also, we incorporate the interior-point gradient acceleration into the orthogonal NMF and derive an accelerated version to minimize the compression overhead. The validity of the eigenvalue analysis has been evaluated empirically. Also, the proposed accelerated orthogonal NMF has been demonstrated to be effective in speeding up the policy computation for a set of robot navigation related problems.
AB - State space compression is one of the recently proposed approaches for improving POMDP's tractability. Despite its initial success, it still carries two intrinsic limitations. First, not all POMDP problems can be compressed equally well. Also, the cost of computing the compressed space itself may become significant as the size of the problem is scaled up. In this paper, we address the two issues with respect to an orthogonal non-negative matrix factorization recently proposed for POMDP compression. In particular, we first propose an eigenvalue analysis to evaluate the compressibility of a POMDP and determine an effective range for the dimension reduction. Also, we incorporate the interior-point gradient acceleration into the orthogonal NMF and derive an accelerated version to minimize the compression overhead. The validity of the eigenvalue analysis has been evaluated empirically. Also, the proposed accelerated orthogonal NMF has been demonstrated to be effective in speeding up the policy computation for a set of robot navigation related problems.
UR - http://www.scopus.com/inward/record.url?scp=70549106956&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-05224-8_20
DO - 10.1007/978-3-642-05224-8_20
M3 - Conference proceeding
AN - SCOPUS:70549106956
SN - 3642052231
SN - 9783642052231
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 248
EP - 262
BT - Advances in Machine Learning - First Asian Conference on Machine Learning, ACML 2009, Proceedings
T2 - 1st Asian Conference on Machine Learning, ACML 2009
Y2 - 2 November 2009 through 4 November 2009
ER -