Pith. sign in

REVIEW 1 cited by

BinaryDuo: Reducing Gradient Mismatch in Binary Activation Network by Coupling Binary Activations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.06517 v1 pith:ZW3CE7DW submitted 2020-02-16 cs.LG stat.ML

classification cs.LGstat.ML
keywords activationgradientbinarymismatchactivationsbinaryduobnnsapproximation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Binary Neural Networks (BNNs) have been garnering interest thanks to their compute cost reduction and memory savings. However, BNNs suffer from performance degradation mainly due to the gradient mismatch caused by binarizing activations. Previous works tried to address the gradient mismatch problem by reducing the discrepancy between activation functions used at forward pass and its differentiable approximation used at backward pass, which is an indirect measure. In this work, we use the gradient of smoothed loss function to better estimate the gradient mismatch in quantized neural network. Analysis using the gradient mismatch estimator indicates that using higher precision for activation is more effective than modifying the differentiable approximation of activation function. Based on the observation, we propose a new training scheme for binary activation networks called BinaryDuo in which two binary activations are coupled into a ternary activation during training. Experimental results show that BinaryDuo outperforms state-of-the-art BNNs on various benchmarks with the same amount of parameters and computing cost.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Discreteness: Sample Complexity Analysis of Straight-Through Estimator for 1-bit Quantization

    cs.LG 2025-05 conditional novelty 7.0 of 10

    For a two-layer binary network with Gaussian inputs, O(n^2) samples guarantee ergodic convergence of STE training and O(n^4) guarantee that iterates revisit the optimal weights, even under label noise.

Pith tools