Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Multi-Model Inference Composition of Hyperdimensional Computing Ensembles
To answer the ever-increasing demand for high accuracy in artificial intelligence (AI)-based applications, several models have been proposed. Among them, ensemble learning, a technique that trains multiple classifiers and then combines their prediction during the inference stage, emerged as a promising approach. Despite being largely explored in the context of models like random forests or convolutional neural networks, very few research works have focused on ensemble learning targeting hyperdimensional computing (HDC). HDC is a brain-inspired computing paradigm that has gained momentum in the last decade because its lightweight and highly parallel operations make it an excellent alternative to compute-intense deep learning models for edge AI applications. In this work, we propose BagHD and BoostHD, two ensemble- based HDC implementations constructed using bagging and boosting, respectively. Accuracy evaluations indicate that our proposal improves baseline single-instance implementations and state-of-the-art HDC ensembles by up to 14% and 4%, respectively. We then leverage two key characteristics of HDC and ensemble learning to demonstrate how we can transform the proposed ensembles into equivalent single-instance implementations, thus avoiding any memory and computing overhead during inference. In fact, when compared to traditional ordinary ensembles, we reduce memory requirements by up to 40×, improving accuracy at the same time. We also support ensemble learning HDC training in BagHD and BoostHD, showing that with little memory overhead it is possible to retrieve the original weak learners from the generated single-instance design.  more » « less
Award ID(s):
2211386
PAR ID:
10665191
Author(s) / Creator(s):
 ;  ;  ;  ;  ;  
Publisher / Repository:
IEEE
Date Published:
Page Range / eLocation ID:
691 to 698
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, TinyML 2024)
    Hyperdimensional computing (HDC) is emerging as a promising AI approach that can effectively target TinyML applications thanks to its lightweight computing and memory requirements. Previous works on HDC showed that limiting the standard 10k dimensions of the hyperdimensional space to much lower values is possible, reducing even more HDC resource requirements. Similarly, other studies demonstrated that binary values can be used as elements of the generated hypervectors, leading to significant efficiency gains at the cost of some degree of accuracy degradation. Nevertheless, current optimization attempts do not concurrently co-optimize HDC hyper-parameters, and accuracy degradation is not directly controlled, resulting in sub-optimal HDC models providing several applications with unacceptable output qualities. In this work, we propose MicroHD, a novel accuracy-driven HDC optimization approach that iteratively tunes HDC hyper-parameters, reducing memory and computing requirements while ensuring user-defined accuracy levels. The proposed method can be applied to HDC implementations using different encoding functions, demonstrates good scalability for larger HDC workloads, and achieves compression and efficiency gains up to 200×when compared to baseline implementations for accuracy degradations lower than 1%. 
    more » « less
  2. ; ; ; ; ; ; ; ; ; ; et al (, ACM Transactions on Embedded Computing Systems)
    Processing large amounts of data, especially in learning algorithms, poses a challenge for current embedded computing systems. Hyperdimensional (HD) computing (HDC) is a brain-inspired computing paradigm that works with high-dimensional vectors called hypervectors . HDC replaces several complex learning computations with bitwise and simpler arithmetic operations at the expense of an increased amount of data due to mapping the data into high-dimensional space. These hypervectors, more often than not, cannot be stored in memory, resulting in long data transfers from storage. In this article, we propose Store-n-Learn, an in-storage computing solution that performs HDC classification and clustering by implementing encoding, training, retraining, and inference across the flash hierarchy. To hide the latency of training and enable efficient computation, we introduce the concept of batching in HDC. We also present on-chip acceleration for HDC encoding in flash planes. This enables us to exploit the high parallelism provided by the flash hierarchy and encode multiple data points in parallel in both batched and non-batched fashion. Store-n-Learn also implements a single top-level FPGA accelerator with novel implementations for HDC classification training, retraining, inference, and clustering on the encoded data. Our evaluation over 10 popular datasets shows that Store-n-Learn is on average 222× (543×) faster than CPU and 10.6× (7.3×) faster than the state-of-the-art in-storage computing solution, INSIDER for HDC classification (clustering). 
    more » « less
  3. ; ; ; ; (, Proceedings of the 23rd ACM/IFIP International Middleware Conference)
    Random forests use ensembles of decision trees to boost accuracy for machine learning tasks. However, large ensembles slow down inference on platforms that process each tree in an ensemble individually. We present Bolt, a platform that restructures whole random forests, not just individual trees, to speed up inference. Conceptually, Bolt maps every path in each tree to a lookup table which, if cache were large enough, would allow inference with just one memory access. When the size of the lookup table exceeds cache capacity, Bolt employs a novel combination of lossless compression, parameter selection, and bloom filters to shrink the table while preserving fast inference. We compared inference speed in Bolt to three state-of-the-art platforms: Python Scikit-Learn, Ranger, and Forest Packing. We evaluated these platforms using datasets with vision, natural language processing and categorical applications. We observed that on ensembles of shallow decision trees Bolt can run 2-14X faster than competing platforms and that Bolt's speedups persist as the number of decision trees in an ensemble increases. 
    more » « less
  4. ; ; ; ; ; ; ; ; (, Scientific Reports)
    Abstract Hyperdimensional computing (HDC) is a brain-inspired computational framework that relies on long hypervectors (HVs) for learning. In HDC, computational operations consist of simple manipulations of hypervectors and can be incredibly memory-intensive. In-memory computing (IMC) can greatly improve the efficiency of HDC by reducing data movement in the system. Most existing IMC implementations of HDC are limited to binary precision which inhibits the ability to match software-equivalent accuracies. Moreover, memory arrays used in IMC are restricted in size and cannot immediately support the direct associative search of large binary HVs (a ubiquitous operation, often over 10,000+ dimensions) required to achieve acceptable accuracies. We present a multi-bit IMC system for HDC using ferroelectric field-effect transistors (FeFETs) that simultaneously achieves software-equivalent-accuracies, reduces the dimensionality of the HDC system, and improves energy consumption by 826x and latency by 30x when compared to a GPU baseline. Furthermore, for the first time, we experimentally demonstrate multi-bit, array-level content-addressable memory (CAM) operations with FeFETs. We also present a scalable and efficient architecture based on CAMs which supports the associative search of large HVs. Furthermore, we study the effects of device, circuit, and architectural-level non-idealities on application-level accuracy with HDC. 
    more » « less
  5. ; ; ; ; ; ; (, Proceedings of The 32nd ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '27))
    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. Consequently, 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). The intrinsic tolerance of HDC algorithms to noise and approximation enables substantial performance gains with minimal loss in inference quality. 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 software and hardware approximations in HDC is exponentially large, making exhaustive exploration intractable; ApproxHDC employs efficient search and analysis techniques to navigate this space and identify high-impact approximations. We further integrate hardware-level approximation mechanisms within the HDC accelerator to demonstrate ApproxHDC's ability to exploit both software and hardware approximations. Experimental evaluation shows that ApproxHDC achieves up to 17.25x speedup on CPUs, 14.97x on GPUs, and 4.69x on SpecPCM while staying within user-specified quality-of-service constraints, outperforming the state-of-the-art MicroHD framework by 3.49x. HDC-specific search space pruning reduces the design space by 71 to 491 orders of magnitude automatically and up to 89 more with developer guidance, enabling discovery of high-quality configurations within minutes. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Text Encoded Conversion
  • XML
  • Save / Share this Record
  • Send to Email