Skip to content
conftrace_
2013 NeurIPS NeurIPS 2013

Learning Adaptive Value of Information for Structured Prediction

Discriminative methods for learning structured models have enabled wide-spread use of very rich feature representations. However, the computational cost of feature extraction is prohibitive for large-scale or time-sensitive applications, often dominating the cost of inference in the models. Significant efforts have been devoted to sparsity-based model selection to decrease this cost. Such feature selection methods control computation statically and miss the opportunity to fine-tune feature extraction to each input at run-time. We address the key challenge of learning to control fine-grained feature extraction adaptively, exploiting non-homogeneity of the data. We propose an architecture that uses a rich feedback loop between extraction and prediction. The run-time control policy is learned using efficient value-function approximation, which adaptively determines the value of information of features at the level of individual variables for each input. We demonstrate significant speedups over state-of-the-art methods on two challenging datasets. For articulated pose estimation in video, we achieve a more accurate state-of-the-art model that is simultaneously 4$\times$ faster while using only a small fraction of possible features, with similar results on an OCR task.

🌉 Interdisciplinary Bridge - Artificial Intelligence and Computer Vision
📈 Trend Setter - Pose Estimation
🧭 Keyword Pioneer - adaptive computation
🐣 Hot Topic Early Bird - structured prediction

More from NeurIPS 2013

All NeurIPS 2013 papers →