Ubiquity symposium: Evolutionary computation and the processes of life: what the no free lunch theorems really mean: how to improve search algorithms
暂无分享,去创建一个
[1] David H. Wolpert,et al. On Bias Plus Variance , 1997, Neural Computation.
[2] David H. Wolpert,et al. The Existence of A Priori Distinctions Between Learning Algorithms , 1996, Neural Computation.
[3] David H. Wolpert,et al. Bias-Variance Techniques for Monte Carlo Optimization: Cross-validation for the CE Method , 2008, ArXiv.
[4] David H. Wolpert,et al. The Lack of A Priori Distinctions Between Learning Algorithms , 1996, Neural Computation.
[5] Cullen Schaffer,et al. A Conservation Law for Generalization Performance , 1994, ICML.
[6] Lih-Yuan Deng,et al. The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning , 2006, Technometrics.
[7] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[8] David H. Wolpert,et al. On the Connection between In-sample Testing and Generalization Error , 1992, Complex Syst..
[9] David H. Wolpert,et al. Coevolutionary free lunches , 2005, IEEE Transactions on Evolutionary Computation.
[10] Yuri Ermoliev,et al. Monte Carlo Optimization and Path Dependent Nonstationary Laws of Large Numbers , 1998 .
[11] David H. Wolpert,et al. What makes an optimization problem hard? , 1995, Complex..
[12] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[13] Dirk P. Kroese,et al. Cross‐Entropy Method , 2011 .
[14] David H. Wolpert,et al. Probability Collectives in Optimization , 2013 .
[15] Dirk P. Kroese,et al. The Cross Entropy Method: A Unified Approach To Combinatorial Optimization, Monte-carlo Simulation (Information Science and Statistics) , 2004 .