Inducing Features of Random Fields
S. Della Pietra, V. Della Pietra (IBM), and J. Lafferty (CMU)

TL;DR
This paper introduces a method for constructing complex random fields from training data by incrementally adding features supported by larger subgraphs, trained via divergence minimization and iterative algorithms.
Contribution
It presents a novel approach to learning non-Markovian random fields with many parameters, differing from traditional NLP and computer vision models, and demonstrates its application in word classification.
Findings
Effective feature construction for random fields.
Successful application to natural language word classification.
Comparison with decision trees and Boltzmann machines.
Abstract
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the Kullback-Leibler divergence between the model and the empirical distribution of the training data. A greedy algorithm determines how features are incrementally added to the field and an iterative scaling algorithm is used to estimate the optimal values of the weights. The statistical modeling techniques introduced in this paper differ from those common to much of the natural language processing literature since there is no probabilistic finite state or push-down automaton on which the model is built. Our approach also differs from the techniques common to the computer vision literature in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
