Simple Random Sampling Estimation of the Number of Local Optima

被引:9
作者
Alyahya, Khulood [1 ]
Rowe, Jonathan E. [1 ]
机构
[1] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England
来源
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIV | 2016年 / 9921卷
关键词
COMBINATORIAL OPTIMIZATION PROBLEMS; BINOMIAL PROPORTION; INTERVAL ESTIMATION; LANDSCAPES; SEARCH;
D O I
10.1007/978-3-319-45823-6_87
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We evaluate the performance of estimating the number of local optima by estimating their proportion in the search space using simple random sampling (SRS). The performance of this method is compared against that of the jackknife method. The methods are used to estimate the number of optima in two landscapes of random instances of some combinatorial optimisation problems. SRS provides a cheap, unbiased and accurate estimate when the proportion is not exceedingly small. We discuss choices of confidence interval in the case of extremely small proportion. In such cases, the method more likely provides an upper bound to the number of optima and can be combined with other methods to obtain a better lower bound. We suggest that SRS should be the first choice for estimating the number of optima when no prior information is available about the landscape under study.
引用
收藏
页码:932 / 941
页数:10
相关论文
共 22 条
[1]   Approximate is better than "exact" for interval estimation of binomial proportions [J].
Agresti, A ;
Coull, BA .
AMERICAN STATISTICIAN, 1998, 52 (02) :119-126
[2]  
[Anonymous], 2012, ELEMENTARY STAT
[3]   Interval estimation for a binomial proportion - Comment - Rejoinder [J].
Brown, LD ;
Cai, TT ;
DasGupta, A ;
Agresti, A ;
Coull, BA ;
Casella, G ;
Corcoran, C ;
Mehta, C ;
Ghosh, M ;
Santner, TJ ;
Brown, LD ;
Cai, TT ;
DasGupta, A .
STATISTICAL SCIENCE, 2001, 16 (02) :101-133
[4]   ESTIMATION OF SIZE OF A CLOSED POPULATION WHEN CAPTURE PROBABILITIES VARY AMONG ANIMALS [J].
BURNHAM, KP ;
OVERTON, WS .
BIOMETRIKA, 1978, 65 (03) :625-633
[5]  
Caruana R., 1999, P IJCAI 1999 WORKSH
[6]  
Englert M., 2013, ALGORITHMICA, V68, P190
[7]  
Eremeev A, 2002, LECT NOTES COMPUT SC, V2279, P31
[8]   Probabilistic analysis of the number partitioning problem [J].
Ferreira, FF ;
Fontanari, JF .
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1998, 31 (15) :3417-3428
[9]   Efficiency of local search with multiple local optima [J].
Garnier, J ;
Kallel, L .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (01) :122-141
[10]  
Garnier J, 2001, NAT COMPUT SER, P343