arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.06724cs.NEcs.CC
收藏

计算 lexicase 选择概率是 NP-Hard 的

Calculating lexicase selection probabilities is NP-Hard

Emily Dolson

AI总结:

本文将 SAT 经 epsilon-lexicase selection 中间归约证明计算 lexicase selection 下个体选中概率的 lex-prob 问题为 NP-Hard,并指出近似与优化比精确多项式算法更现实。

摘要:

在 lexicase selection(词典顺序选择)下计算单个解被选中的概率,是深入理解这一进化计算中最先进父代选择算法的理论尝试中的一个重要问题。发现该问题的快速解法也会对改进 lexicase selection 的实际工作产生影响。本文证明了我命名为 lex-prob 的这一问题是 NP-Hard 的。证明通过将著名的 NP-Complete 问题 SAT 在多项式时间内归约到 lex-prob 来完成。该归约包含一个中间步骤:将 lexicase selection 的流行变体 epsilon-lexicase selection 归约到标准 lexicase selection。这一证明对任何需要快速计算单个解在 lexicase selection 下被选中概率的人都具有重要实际意义:在多项式时间内完成该计算即便不是完全不可能,也将极其困难。因此,寻找近似算法或加速暴力解法的实际优化可能更有价值。该结果还对 epsilon-lexicase selection 与 lexicase selection 之间的关系,以及 lex-prob 与其他 NP-Hard 问题之间的关系具有更深层的理论意义。

英文摘要:

Calculating the probability of an individual solution being selected under lexicase selection is an important problem in attempts to develop a deeper theoretical understanding of lexicase selection, a state-of-the art parent selection algorithm in evolutionary computation. Discovering a fast solution to this problem would also have implications for efforts to develop practical improvements to lexicase selection. Here, I prove that this problem, which I name lex-prob, is NP-Hard. I achieve this proof by reducing SAT, a well-known NP-Complete problem, to lex-prob in polynomial time. This reduction involves an intermediate step in which a popular variant of lexicase selection, epsilon-lexicase selection, is reduced to standard lexicase selection. This proof has important practical implications for anyone needing a fast way of calculating the probabilities of individual solutions being selected under lexicase selection. Doing so in polynomial time would be incredibly challenging, if not all-together impossible. Thus, finding approximation algorithms or practical optimizations for speeding up the brute-force solution is likely more worthwhile. This result also has deeper theoretical implications about the relationship between epsilon-lexicase selection and lexicase selection and the relationship between lex-prob and other NP-Hard problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑