Local learning reduces cross-layer training dependencies, but an efficient accelerator must still retain operands, accumulate gradients, and select quantization scales. We present an FPGA system that trains a CNN and its regional auxiliary classifiers using a shared integer matrix engine. Compact errors are expanded on chip, gradients are folded tile by tile, and historical scales permit direct output conversion. At 200 MHz, the KV260 prototype achieves 76.57% accuracy on CIFAR-10 and 91.85% on SVHN at approximately 4.20 W mean module power. Effective matrix throughput is 31.22 and 31.57 GMAC/s, respectively. Against the same integer method on Jetson Orin Nano, measured training energy is 40.4% and 42.1% lower, with 1.86× and 1.82× longer runtime; measurements use the respective platform power domains. Selected state checks and matching complete-run prediction counts support functional agreement with the software reference.
Figures & tables
Fig. 1: One CNN layer and its local supervision. Dashed paths retain operands; the local head also updates V . No convolutional input gradient is sent to earlier layers.
Fig. 2: Hardware organization. Convolution and classifier operations reuse the matrix engine. Regional errors expand in operand supply; numerical and output units share DDR access. Control is dashed; data connections are solid.
Operation
Output indices
Reduction
Conv forward
(p,cout)
Kernel, cin
Conv weight gradient ∗
(cout,cin)
n,p
Local-classifier forward
(n,k)
f
Local feature error
(n,f)
k
Classifier weight gradient
(k,f)
n
Final-classifier forward
(n,k)
f in four partitions
TABLE I: Shared-engine mappings. n : sample; p : spatial position; c : channel; k : class; f : feature.
Resource
Count
Utilization (%)
LUT
92,789
79.23
FF
113,250
48.35
DSP
587
47.04
BRAM (36-Kb equivalents)
122.5
85.07
URAM
20
31.25
TABLE II: KV260 implementation and complete training. Energy is measured on VCC_SOM; energy/sample counts all training presentations across epochs.
Epochs
MMAC/sample
PL s/epoch
GMAC/s
Peak (%)
1–20
69.99
121.53
28.79
28.12
21–30
63.48
90.82
34.95
34.13
31–40
44.60
69.00
32.32
31.56
41–50
35.13
50.65
34.67
33.86
TABLE III: Derived effective matrix throughput on CIFAR-10, using algorithmic MAC counts and measured PL cycles.
Metric
EF-Train [ 7 ]
Venk. [ 10 ]
Ours
Device
ZCU102
Stratix 10 GX
KV260
Clock (MHz)
100
240
200
Precision
FP32
Fixed16
Mixed integer
DSPs
1,315
1,699
587
Accuracy (%)
64.82
73
76.57
Power (W)
6.89 †
20.64 †∗
4.20 ‡
TABLE IV: CIFAR-10 FPGA training over 50 epochs. Networks and power boundaries differ.
Method
Acc. (%)
Time (s)
kJ
MiB
CIFAR-10, 50 epochs
FP32 BP
79.87
2852.11
43.20
544.69
Local FP32
74.43
1198.08
17.62
401.18
Integer local
76.57
2515.06
32.91
297.83
SVHN, 60 epochs
FP32 BP
92.38
5022.51
75.67
544.69
TABLE V: Jetson results in 25 W mode with a configured GPU frequency of 918 MHz. Energy: VDD_IN; memory: peak CUDA allocation.
Deploying adaptive intelligence at the edge remains challenging due to the high computational and energy cost of training neural models. Spiking Neural Networks (SNNs) offer a promising alternative, but enabling on-device learning requires hardware-algorithm co-design. This paper presents SPIKER-LL, an FPGA-based SNN accelerator that extends the open-source Spiker+ inference architecture with efficient support for the STSF local learning rule. Through targeted microarchitectural extensions, SPIKER-LL performs inference and online learning with minimal overhead. Across MNIST, F-MNIST, and DIGITS, it achieves up to 93% accuracy, sub-millisecond latency, and less than 0.1 mJ per inference, while remaining DSP-free and highly scalable for edge-FPGA deployments.
Fixed-function CNN accelerators make edge inference fast and energy-efficient, but they execute only networks that obey a precise numerical contract. On the MAX7800x family, this contract requires power-of-two, per-tensor, symmetric scales, 8-bit activations and biases, integer-only arithmetic, and one statically configured shift per layer. We present ShiftQAT, the quantization-aware training (QAT) flow we developed for this family, which produces networks satisfying the contract by construction. It is the default training path of ai8x-training, the family's open-source training toolchain. ShiftQAT resolves residual, concatenation, and weight-sharing dependencies so that activation scales propagate statically and each layer's requantization reduces to one offline-configured shift. It also trains weights and biases on a joint power-of-two grid that fits the 8-bit bias budget. Among the compared methods, only ShiftQAT satisfies all of the contract's scaling constraints, including signed 8-bit activation storage. Even so, on ImageNet it matches the W8A8 accuracy drop of less constrained QAT methods and stays within 2.9 percentage points of FP32 at W4A8. On MAX78002 silicon, ShiftQAT-trained MobileNetV2 and ResNet-18 classify ImageNet images in 14.6 and 8.4 ms at 5.1 and 2.8 mJ per inference.
Oguzhan Buyuksolak, Osman Erman Okman, Mehmet Gorkem Ulkar
Forward-Forward (FF) learning [Hinton, 2022] replaces backpropagation with strictly layer-local goodness updates. Recent FF-CNN work has narrowed the gap to BP on 32x32 benchmarks, raising the question of whether layer-local training is becoming a viable alternative at realistic scale. To probe this rigorously, we develop DTG-FF -- dynamic temperature goodness, decoupled normalization, and multi-layer fusion -- as an instrument that sets FF-family state of the art across nine real-data benchmarks at the time of our submission (91.8% CIFAR-10 and an FF baseline at ImageNet-100 224x224), and use it to audit how far layer-local training actually scales. (1) Real-data scaling. Under identical recipe and backbone, an architecture-matched BP-DeepSup baseline beats DTG-FF by 2.40/5.93 pp on CIFAR-10/CIFAR-100, and the gap widens with class count. At 224x224 the same instrument reaches only 49.4% on ImageNet-100, versus 75.6% even for a self-supervised BP-trained ResNet-50 with linear evaluation [Tian et al., 2020] -- exposing a real-data ceiling invisible at 32x32. (2) Synthetic vs. real K-conflict. DTG-FF increasingly outperforms BP as class count K grows on synthetic teacher-student tasks, yet on real images the FF-BP gap reverses sign and widens with K. A within-dataset CIFAR-100 coarse vs. fine probe isolates label-hierarchy from image distribution: synthetic K-sweeps confound output dimensionality with fine-grained discrimination difficulty and thereby overstate FF transferability. (3) Systems audit. FF can be implemented without storing depth-wide activations, but on commodity 8 GB hardware standard BP+gradient-accumulation reaches 4.18 GB / 157 imgs/s versus DTG-FF's 7.90 GB / 138 imgs/s, so a memory-based justification for FF at this scale is not supported under fair baselines.