Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
Abstract
In this article, we present a unified framework for learning Gibbs models from training images. We identify two key factors that determine the accuracy and speed of learning Gibbs models: (1). Fisher information, and (2). The accuracy of Monte Carlo estimate for partition functions. We propose three new learning algorithms under the unified framework. (I). The maximum partial likelihood estimator. (II). The maximum patch likelihood estimator, and (III). The maximum satellite likelihood estimator. The first two algorithms can speed up the minimax entropy algorithm by about 2D times without losing much accuracy. The third one makes use of a set of known Gibbs models as references-dubbed "satellites" and can approximately estimate the minimax entropy model in the speed of 10 seconds.
Cite
Text
Zhu and Liu. "Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000. doi:10.1109/CVPR.2000.854723Markdown
[Zhu and Liu. "Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2000.](https://mlanthology.org/cvpr/2000/zhu2000cvpr-learning/) doi:10.1109/CVPR.2000.854723BibTeX
@inproceedings{zhu2000cvpr-learning,
title = {{Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?}},
author = {Zhu, Song Chun and Liu, Xiuwen},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2000},
pages = {2002-2008},
doi = {10.1109/CVPR.2000.854723},
url = {https://mlanthology.org/cvpr/2000/zhu2000cvpr-learning/}
}