Constrained Approximate Maximum Entropy Learning of Markov Random Fields thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Constrained Approximate Maximum Entropy Learning of Markov Random Fields

Published on Jul 30, 20086812 Views

Parameter estimation in Markov random fields (MRFs) is a difficult task, in which inference over the network is run in the inner loop of a gradient descent procedure. Replacing exact inference with ap

Related categories