PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Sparse Markov source estimation via transformed Lasso
Teemu Roos and Bin Yu
In: IEEE Information Theory Workshop 2009, 10-12 June, 2009, Volos, Greece.


We establish a connection between Lasso-type L1 regularization and learning variable length Markov chains (VLMCs). This is achieved by a parameterization of discrete-valued finite-memory Markov sources in which setting a parameter value equal to zero is equivalent to eliminating a node in the corresponding context tree model. The parameterization involves a Haar wavelet transformation on a set of indicator functions, the output of which is mapped to symbol probabilities via logistic regression. The optimization problem is convex and can be solved efficiently using existing tools. We present preliminary results, comparing the method to an earlier algorithm for learning VLMCs in terms of model selection and prediction performance. We also discuss other transformations which lead to a flexible family of sparse representations of Markov sources.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
ID Code:5166
Deposited By:Teemu Roos
Deposited On:24 March 2009