Minimum description length principle for maximum entropy model selection

Gaurav Pandey, Ambedkar Dukkipati
2013 2013 IEEE International Symposium on Information Theory  
Model selection is central to statistics, and many learning problems can be formulated as model selection problems. In this paper, we treat the problem of selecting a maximum entropy model given various feature subsets and their moments, as a model selection problem, and present a minimum description length (MDL) formulation to solve this problem. For this, we derive normalized maximum likelihood (NML) codelength for these models. Furthermore, we prove that the minimax entropy principle is a
more » ... y principle is a special case of maximum entropy model selection, where one assumes that complexity of all the models are equal. We apply our approach to gene selection problem and present simulation results.
doi:10.1109/isit.2013.6620481 dblp:conf/isit/PandeyD13 fatcat:6rbvyonghzbfrnbbonkam5ok4m