The Influence of Operational Cost on Estimation

This work concerns the way that statistical models are used to make decisions. In particular, we aim to merge the way estimation algorithms are designed with how they are used for a subsequent task. Our methodology considers the operational cost of carrying out a policy, based on a predictive model....

Full description

Bibliographic Details
Main Authors: Tulabandhula, Theja (Contributor), Rudin, Cynthia (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Sloan School of Management (Contributor)
Format: Article
Language:English
Published: 2014-09-11T12:40:00Z.
Subjects:
Online Access:Get fulltext
LEADER 01920 am a22002413u 4500
001 89424
042 |a dc 
100 1 0 |a Tulabandhula, Theja  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
100 1 0 |a Sloan School of Management  |e contributor 
100 1 0 |a Tulabandhula, Theja  |e contributor 
100 1 0 |a Rudin, Cynthia  |e contributor 
700 1 0 |a Rudin, Cynthia  |e author 
245 0 0 |a The Influence of Operational Cost on Estimation 
260 |c 2014-09-11T12:40:00Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/89424 
520 |a This work concerns the way that statistical models are used to make decisions. In particular, we aim to merge the way estimation algorithms are designed with how they are used for a subsequent task. Our methodology considers the operational cost of carrying out a policy, based on a predictive model. The operational cost becomes a regularization term in the learning algorithm's objective function, allowing either an optimistic or pessimistic view of possible costs. Limiting the operational cost reduces the hypothesis space for the predictive model, and can thus improve generalization. We show that different types of operational problems can lead to the same type of restriction on the hypothesis space, namely the restriction to an intersection of an l[subscript q] ball with a halfspace. We bound the complexity of such hypothesis spaces by proposing a technique that involves counting integer points in polyhedrons. 
520 |a United States. J. William Fulbright Foreign Scholarship Board (Science and Technology Fellowship) 
520 |a Solomon Buchsbaum AT&T Research Fund 
520 |a National Science Foundation (U.S.) (Grant IIS-1053407) 
546 |a en_US 
655 7 |a Article 
773 |t Proceedings of the 2012 International Symposium on Artificial Intelligence and Mathematics