在线问题及其预测的复杂性类
Complexity Classes for Online Problems with and without Predictions
AI总结:
本文为带预测的在线问题建立复杂性理论框架,定义基于错误度量的复杂性类层次,并引入归约、完全性等概念,通过实例分析展示其应用。
摘要:
随着机器学习的发展,利用预测的算法引起了广泛关注和兴趣,尤其是在在线算法领域,大多数新结果都针对具体在线问题融入了预测方面。尽管问题在时间和空间上的结构计算难度已经相当成熟,但对于通常不关注时间和空间资源的在线问题,我们所知甚少。当研究者考虑带有预言机建议的在线算法时,获得了一些信息论上的见解,但不确定质量的预测则是截然不同的问题。我们针对带预测的在线问题(考虑最小化问题和每个请求一个预测比特)启动了复杂性理论的发展。基于最通用的困难在线问题类型——字符串猜测,我们定义了一系列复杂性类层次(由错误度量对索引),并发展了归约、类成员、困难性和完全性等概念。我们的框架包含了处理复杂性时预期会使用的所有工具,并通过分析具有不同特征的问题来展示这些工具。此外,我们表明,对于基于标准错误度量对的层次中的每个类,带有丢弃预测的页面置换的已知下界直接适用于所有困难问题。这个页面置换问题对于这些类不是完全的。我们的工作还暗示了不带预测的经典在线问题对应的复杂性类,以及相应的完全问题。
英文摘要:
With the developments in machine learning, there has been a surge in interest and results focused on algorithms utilizing predictions, not least in online algorithms where most new results incorporate the prediction aspect for concrete online problems. While the structural computational hardness of problems with regards to time and space is quite well developed, not much is known about online problems where time and space resources are typically not in focus. Some information-theoretical insights were gained when researchers considered online algorithms with oracle advice, but predictions of uncertain quality is a very different matter. We initiate the development of a complexity theory for online problems with predictions, considering minimization problems and one prediction bit per request. Based on the most generic hard online problem type, string guessing, we define a family of hierarchies of complexity classes (indexed by pairs of error measures) and develop notions of reductions, class membership, hardness, and completeness. Our framework contains all the tools one expects to find when working with complexity, and we illustrate our tools by analyzing problems with different characteristics. In addition, we show that known lower bounds for paging with discard predictions apply directly to all hard problems for each class in the hierarchy based on the canonical pair of error measures. This paging problem is not complete for these classes. Our work also implies corresponding complexity classes for classic online problems without predictions, with the corresponding complete problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。