arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.18705cs.DS
收藏

非精确计算的算法基础

Algorithmic Foundations of Inexact Computing

John Augustine, Dror Fried, Krishna V. Palem, Duc-Hung Pham, Anshumali Shrivastava

AI总结:

本文提出非精确计算的有原则模型,通过非精确性感知与不感知方法对比,证明在布尔函数求值、PAC学习和排序等问题上可获得指数级解质量提升。

摘要:

非精确计算,也称为近似计算,是一种设计算法和计算系统的风格,其中执行于其上的算法的正确性精度被有意地换取显著的资源节省。在硬件以及利用这种方法获得一些解质量(精度)损失但获得不成比例的高节省的软件或定制算法方面,已经报告了显著进展。然而,这些方法往往是临时的,并且与特定的算法和技术绑定。因此,缺乏一种有原则的设计和分析算法的方法。在本文中,我们提供了一个新颖的模型,使我们能够刻画设计为非精确的算法的行为,以及刻画这种方法提供的机会和收益。因此,我们的方法适用于标准的渐近分析,并提供了一个清晰的统一抽象,通过该抽象可以进行算法的设计和分析。以此为背景,我们表明非精确性对一些基本问题可能显著有益,因为如果利用非精确性,与那些对此方法不敏感且无法利用该方法的不可知方法相比,解的质量可以呈指数级更好。我们表明,在评估根植于布尔函数及其谱理论的布尔函数、PAC学习和排序的背景下,这种收益是可能的。形式上,这是通过引入设计算法的非精确性感知和非精确性不感知这两个孪生概念来实现的,并且指数级收益是在使用“感知”方法与“不感知”方法的解质量之比的背景下展示的。

英文摘要:

Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on them is deliberately traded for significant resource savings. Significant progress has been reported in this regard both in terms of hardware as well as software or custom algorithms that exploited this approach resulting in some loss in solution quality (accuracy) while garnering disproportionately high savings. However, these approaches tended to be ad-hoc and were tied to specific algorithms and technologies. Consequently, a principled approach to designing and analyzing algorithms was lacking. In this paper, we provide a novel model which allows us to characterize the behavior of algorithms designed to be inexact, as well as characterize opportunities and benefits that this approach offers. Our methods therefore are amenable to standard asymptotic analysis and provides a clean unified abstraction through which an algorithm's design and analysis can be conducted. With this as a backdrop, we show that inexactness can be significantly beneficial for some fundamental problems in that the quality of a solution can be exponentially better if one exploits inexactness when compared to approaches that are agnostic and are unable to exploit this approach. We show that such gains are possible in the context of evaluating Boolean functions rooted in the theory of Boolean functions and their spectra, PAC learning, and sorting. Formally, this is accomplished by introducing the twin concepts of inexactness aware and inexactness oblivious approaches to designing algorithms and the exponential gains are shown in the context of taking the ratio of the quality of the solution using the "aware" approach to the "oblivious" approach.

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

↑