Sensitivity-Guided Framework for Pruned and Quantized Reservoir Computing Accelerators
Organizations: Paderborn University, Paderborn, Germany · Brandenburg Technical University, Cottbus, Germany · Tallinn University of Technology, Tallinn, Estonia · Reneo Group GmbH, Hamburg, Germany
Abstract
This paper presents a compression framework for Reservoir Computing that enables systematic design-space exploration of trade-offs among quantization levels, pruning rates, model accuracy, and hardware efficiency. The proposed approach leverages a sensitivity-based pruning mechanism to identify and remove less critical quantized weights with minimal impact on model accuracy, thereby reducing computational overhead while preserving accuracy. We perform an extensive trade-off analysis to validate the effectiveness of the proposed framework and the impact of pruning and quantization on model performance and hardware parameters. For this evaluation, we employ three time-series datasets, including both classification and regression tasks. Experimental results across selected benchmarks demonstrate that our proposed approach maintains high accuracy while substantially improving computational and resource efficiency in FPGA-based implementations, with variations observed across different configurations and time series applications. For instance, for the MELBOEN dataset, an accelerator quantized to 4-bit at a 15% pruning rate reduces resource utilization by 1.2% and the Power Delay Product (PDP) by 50.8% compared to an unpruned model, without any noticeable degradation in accuracy.
Figures & tables
| \begin{split}\mathit{Sensitivity}(w)=\\ \frac{1}{q}\sum_{b=1}^{q}\left|\mathit{Perf}^{base}(q)-{}\right.\left.\mathit{Perf}^{b,w}(q)\right|\end{split} |
| Benchmark | |||
| Parameter | MELBORN | PEN | HENON |
| 50 | 50 | 50 | |
| 24 | 8 | 5000 | |
| classes | 1 | 10 | (regression) |
| 1194 | 7494 | 4000 | |
| 2439 | 3498 | 1000 | |
| Quantization | Pruning | Resource Utilization | Latency (ns) | Throughput | PDP | Resource Saving | PDP Saving | |
| Bits | rate | LUTs | FFs | (ns) | (Msps) | (nWs) | (%) | (%) |
| Unpruned | 29400 | 558 | 16.220 | 61.67 | 9.408 | - | - | |
| 15% | 29027 | 543 | 8.343 | 119.86 | 4.618 | 1.26 | 50.88 | |
| 4 | 45% | 28728 | 516 | 7.040 | 142.05 | 3.772 | 2.27 | 59.91 |
| 75% | 28227 | 516 | 4.380 | 228.31 | 2.342 | 3.99 | 75.09 | |
| 90% | 28170 | 508 | 4.278 | 233.80 | 2.228 | 4.17 | 76.31 | |
| Quantization | Pruning | Resource Utilization | Latency | Throughput | PDP (nWs) | Resource Saving | PDP Saving | |
| Bits | rate | LUTs | FFs | (ns) | (Msps) | (nWs) | (%) | (%) |
| Unpruned | 3448 | 196 | 5.581 | 179.2 | 0.341 | - | - | |
| 15% | 3112 | 190 | 5.378 | 185.9 | 0.301 | 9.38 | 11.73 | |
| 4 | 45% | 2426 | 176 | 4.383 | 228.2 | 0.202 | 26.36 | 40.76 |
| 75% | 1971 | 134 | 2.984 | 335.2 | 0.116 | 40.42 | 65.98 | |
| 90% | 1869 | 76 | 2.616 | 382.3 | 0.094 | 51.63 | 72.44 | |
Reservoir Computing
Reservoir computing uses recurrent dynamical systems to transform temporal inputs into features that support efficient learning with simple readouts.
See all 107 papers