自动为超维计算优化近似方法,提升性能且几乎不损失精度。
Compiler-Driven Approximation Tuning for Hyperdimensional Computing

- 基于编译器的自动化搜索框架,定位高价值软硬件近似配置。
- 在多种硬件平台(含内存计算芯片)上实现跨平台部署与性能提升。
- 适合关注低功耗、高效率的机器学习加速系统设计者。
随着摩尔定律逼近物理和经济极限,领域专用方法日益用于加速机器学习任务。超维计算(HDC)是其中一种新兴范式,提供不同于传统深度学习的替代方案。基于认知计算模型,HDC从底层设计即以硬件效率为核心目标。其工作负载天然适配异构硬件平台,包括CPU、GPU、FPGA以及新兴的阻变存储器(ReRAM)和相变存储器(PCM)。HDC算法对噪声和近似具有内在容错性,可在几乎不损失精度的前提下实现显著性能提升。本文提出ApproxHDC框架,用于自动识别并应用HDC工作负载中的领域特定近似。该框架扩展了HPVM-HDC编译器基础设施,支持在多种硬件后端(如CPU、GPU及模拟的ReRAM/PCM加速器)间进行可重定向编译。由于可能的近似组合呈指数级增长,ApproxHDC通过高效搜索与分析机制,定位出覆盖软硬件层面的高影响力配置。
原文摘要 · Abstract (English)
As Moore's law reaches its physical and economic limits, domain-specific approaches are increasingly employed to accelerate machine learning workloads. Hyperdimensional Computing (HDC) represents one such emerging paradigm, offering an alternative to conventional deep learning techniques. Rooted in cognitive models of computation, HDC is designed bottom-up with hardware efficiency as a first-class objective. HDC workloads map naturally to heterogeneous hardware platforms, including CPUs, GPUs, and FPGAs, as well as emerging in-memory computing technologies such as Resistive RAM (ReRAM) and Phase-Change Memory (PCM). HDC algorithms are intrinsically tolerant to noise and approximation, enabling substantial performance gains with minimal accuracy loss. In this work, we introduce ApproxHDC, a framework for automated identification and application of domain-specific approximations in HDC workloads. ApproxHDC extends the HPVM-HDC compiler infrastructure to enable retargetable compilation across diverse hardware backends, including CPUs, GPUs, and simulated ReRAM and PCM-based accelerators. The space of possible approximations is exponentially large; ApproxHDC employs efficient search and analysis to navigate it and identify high-impact configurations spanning both software and hardware levels.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。