arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.06572cs.LGcs.AIcs.CC
收藏

预测排序算法平滑复杂度的机器学习方法

A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms

Insight Centre for Data Analytics(洞察数据分析中心);University College Dublin(都柏林大学学院);University College Cork(科克大学学院)

Bichen Shi, Michel Schellekens, Georgiana Ifrim

摘要:

平滑分析是一个分析算法复杂性的框架,作为平均和最坏情况行为之间的桥梁。例如,快速排序和单纯形算法在实际应用中被广泛使用,尽管它们的最坏情况复杂度很高。平滑复杂度旨在更好地表征此类算法。现有的排序算法的平滑复杂性的理论界仍然很弱。此外,根据经验计算平滑复杂度通过其原始定义是计算上不可行的,即使是适度的输入大小。在本文中,我们专注于准确地预测排序算法的平滑复杂度,使用机器学习技术。我们提出了两个回归模型,考虑到各种属性的排序算法和一些已知的理论结果,在平滑分析,以提高预测质量。我们展示了预测快速排序,合并排序和优化的Bubberort大输入大小的平滑复杂性的实验结果,从而填补了已知的理论和经验结果之间的差距。

英文摘要:

Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex algorithm are widely used in practical applications, despite their heavy worst-case complexity. Smoothed complexity aims to better characterize such algorithms. Existing theoretical bounds for the smoothed complexity of sorting algorithms are still quite weak. Furthermore, empirically computing the smoothed complexity via its original definition is computationally infeasible, even for modest input sizes. In this paper, we focus on accurately predicting the smoothed complexity of sorting algorithms, using machine learning techniques. We propose two regression models that take into account various properties of sorting algorithms and some of the known theoretical results in smoothed analysis to improve prediction quality. We show experimental results for predicting the smoothed complexity of Quicksort, Mergesort, and optimized Bubblesort for large input sizes, therefore filling the gap between known theoretical and empirical results.

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

↑