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

加快慢适应步道建设

Speeding up the construction of slow adaptive walks

Susan Khor

摘要:

提出了一种算法(bliss)来加速慢自适应行走的构造。慢速自适应漫游是偏向于较近点或较小移动步长的自适应漫游。它们以前被引入来探索搜索空间,例如检测潜在的局部最优值或评估健身景观的坚固性。为了避免为集合中的所有字符串对计算汉明距离(HD)以便为每个字符串找到最接近的字符串的集合的二次成本,字符串通过bliss进行排序和聚类,使得相似的字符串更有可能配对以进行HD计算。为了有效地安排字符串的相似性,布利斯采用共享的非重叠的位置之间的特定序列的想法,这是一个无重叠的蛋白质序列比较算法的启发。在枚举搜索空间上进行测试以评估b-步行的质量,即从布利斯的输出构造的缓慢自适应步行。最后,b-游动被应用于探索更大的搜索空间的帮助下,Wang-Landau采样。

英文摘要:

An algorithm (bliss) is proposed to speed up the construction of slow adaptive walks. Slow adaptive walks are adaptive walks biased towards closer points or smaller move steps. They were previously introduced to explore a search space, e.g. to detect potential local optima or to assess the ruggedness of a fitness landscape. To avoid the quadratic cost of computing Hamming distance (HD) for all-pairs of strings in a set in order to find the set of closest strings for each string, strings are sorted and clustered by bliss such that similar strings are more likely to get paired off for HD computation. To efficiently arrange the strings by similarity, bliss employs the idea of shared non-overlapping position specific subsequences between strings which is inspired by an alignment-free protein sequence comparison algorithm. Tests are performed to evaluate the quality of b-walks, i.e. slow adaptive walks constructed from the output of bliss, on enumerated search spaces. Finally, b-walks are applied to explore larger search spaces with the help of Wang-Landau sampling.

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

↑