Rare-event Simulation for Neural Network and Random Forest Predictors

被引:15
作者
Bai, Yuanlu [1 ]
Huang, Zhiyuan [2 ]
Lam, Henry [1 ]
Zhao, Ding [3 ]
机构
[1] Columbia Univ, New York, NY 10027 USA
[2] Tongji Univ, Shanghai, Peoples R China
[3] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源
ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION | 2022年 / 32卷 / 03期
基金
美国安德鲁·梅隆基金会; 美国国家科学基金会;
关键词
Variance reduction; importance sampling; safety evaluation; neural network; random forest; large deviations; LARGE DEVIATIONS THEORY; EFFICIENT MONTE-CARLO; EXCESSIVE BACKLOGS; SYSTEMS; SAFETY; CLASSIFICATION; ALGORITHMS; MODELS;
D O I
10.1145/3519385
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We study rare-event simulation for a class of problems where the target hitting sets of interest are defined via modern machine learning tools such as neural networks and random forests. This problem is motivated from fast emerging studies on the safety evaluation of intelligent systems, robustness quantification of learning models, and other potential applications to large-scale simulation in which machine learning tools can be used to approximate complex rare-event set boundaries. We investigate an importance sampling scheme that integrates the dominating point machinery in large deviations and sequential mixed integer programming to locate the underlying dominating points. Our approach works for a range of neural network architectures including fully connected layers, rectified linear units, normalization, pooling and convolutional layers, and random forests built from standard decision trees. We provide efficiency guarantees and numerical demonstration of our approach using a classification model in the UCI Machine Learning Repository.
引用
收藏
页数:33
相关论文
共 122 条
[1]   EFFICIENT MONTE CARLO FOR HIGH EXCURSIONS OF GAUSSIAN RANDOM FIELDS [J].
Adler, Robert J. ;
Blanchet, Jose H. ;
Liu, Jingchen .
ANNALS OF APPLIED PROBABILITY, 2012, 22 (03) :1167-1214
[2]   Adaptive importance sampling technique for Markov chains using stochastic approximation [J].
Ahamed, T. P. I. ;
Borkar, V. S. ;
Juneja, S. .
OPERATIONS RESEARCH, 2006, 54 (03) :489-504
[3]   Efficient Simulation for Expectations over the Union of Half-Spaces [J].
Ahn, Dohyun ;
Kim, Kyoung-Kuk .
ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION, 2018, 28 (03)
[4]  
[Anonymous], 1997, INTRO LINEAR OPTIMIZ
[5]  
[Anonymous], 2010, Ruin Probabilities
[6]  
[Anonymous], 2018, Natl. Transp. Saf. Board
[7]  
[Anonymous], 2006, Advances in neural information processing systems
[8]  
[Anonymous], 2009, RARE EVENT SIMULATIO
[9]  
Arief M, 2021, PR MACH LEARN RES, V130, P595
[10]   CONJUGATE PROCESSES AND THE SIMULATION OF RUIN PROBLEMS [J].
ASMUSSEN, S .
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1985, 20 (02) :213-229