LGDec 16, 2024

Fast and Slow Gradient Approximation for Binary Neural Network Optimization

arXiv:2412.11777v1h-index: 19Has CodeAAAI
Originality Incremental advance
AI Analysis

This work improves BNN optimization for edge device deployment, but it is incremental as it builds on existing hypernetwork-based methods.

The paper tackles the challenge of optimizing Binary Neural Networks (BNNs) by addressing gradient errors from non-differentiable quantization functions, proposing a method that incorporates historical gradient information and layer-specific adjustments, resulting in faster convergence and lower loss values on CIFAR-10 and CIFAR-100 datasets.

Binary Neural Networks (BNNs) have garnered significant attention due to their immense potential for deployment on edge devices. However, the non-differentiability of the quantization function poses a challenge for the optimization of BNNs, as its derivative cannot be backpropagated. To address this issue, hypernetwork based methods, which utilize neural networks to learn the gradients of non-differentiable quantization functions, have emerged as a promising approach due to their adaptive learning capabilities to reduce estimation errors. However, existing hypernetwork based methods typically rely solely on current gradient information, neglecting the influence of historical gradients. This oversight can lead to accumulated gradient errors when calculating gradient momentum during optimization. To incorporate historical gradient information, we design a Historical Gradient Storage (HGS) module, which models the historical gradient sequence to generate the first-order momentum required for optimization. To further enhance gradient generation in hypernetworks, we propose a Fast and Slow Gradient Generation (FSG) method. Additionally, to produce more precise gradients, we introduce Layer Recognition Embeddings (LRE) into the hypernetwork, facilitating the generation of layer-specific fine gradients. Extensive comparative experiments on the CIFAR-10 and CIFAR-100 datasets demonstrate that our method achieves faster convergence and lower loss values, outperforming existing baselines.Code is available at http://github.com/two-tiger/FSG .

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes