Risk-sensitive learning via minimization of empirical conditional value-at-risk

被引:10
作者
Kashima, Hisashi [1 ]
机构
[1] IBM Res Corp, Tokyo Res Lab, Yamato 2428502, Japan
关键词
risk-sensitive learning; cost-sensitive learning; meta learning; conditional value-at-risk; expected shortfall;
D O I
10.1093/ietisy/e90-d.12.2043
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We extend the framework of cost-sensitive classification to mitigate risks of huge costs occurring with low probabilities, and propose an algorithm that achieves this goal. Instead of minimizing the expected cost commonly used in cost-sensitive learning, our algorithm minimizes conditional value-at-risk, also known as expected shortfall, which is considered a good risk metric in the area of financial engineering. The proposed algorithm is a general meta-learning algorithm that can exploit existing example-dependent cost-sensitive learning algorithms, and is capable of dealing with not only alternative actions in ordinary classification tasks, but also allocative actions in resource-allocation type tasks. Experiments on tasks with example-dependent costs show promising results.
引用
收藏
页码:2043 / 2052
页数:10
相关论文
共 29 条
[1]  
Abe N., 2004, Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P3
[2]  
[Anonymous], P 7 ACM SIGKDD INT C
[3]  
[Anonymous], P 10 EUR C MACH LEAR
[4]  
[Anonymous], 2002, Advances in Neural Information Processing Systems
[5]  
[Anonymous], P 1 INT WORKSH UT BA
[6]   Coherent measures of risk [J].
Artzner, P ;
Delbaen, F ;
Eber, JM ;
Heath, D .
MATHEMATICAL FINANCE, 1999, 9 (03) :203-228
[7]  
Blake C.L., 1998, UCI repository of machine learning databases
[8]  
CIZEK P, 2004, 20041300 CENTER
[9]  
Cormen T. H., 1990, INTRO ALGORITHMS
[10]  
Domingos P., 1999, Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P155