Pith. sign in

REVIEW 1 cited by

Reintroducing Straight-Through Estimators as Principled Methods for Stochastic Binary Networks

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 2006.06880 v4 pith:PD2SXI22 submitted 2020-06-11 stat.ML cs.CVcs.LGcs.NE

classification stat.MLcs.CVcs.LGcs.NE
keywords weightsactivationsbinaryestimatorsmethodsapproachesdiscreteempirical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Training neural networks with binary weights and activations is a challenging problem due to the lack of gradients and difficulty of optimization over discrete weights. Many successful experimental results have been achieved with empirical straight-through (ST) approaches, proposing a variety of ad-hoc rules for propagating gradients through non-differentiable activations and updating discrete weights. At the same time, ST methods can be truly derived as estimators in the stochastic binary network (SBN) model with Bernoulli weights. We advance these derivations to a more complete and systematic study. We analyze properties, estimation accuracy, obtain different forms of correct ST estimators for activations and weights, explain existing empirical approaches and their shortcomings, explain how latent weights arise from the mirror descent method when optimizing over probabilities. This allows to reintroduce ST methods, long known empirically, as sound approximations, apply them with clarity and develop further improvements.

Discussion (0). Sign in 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. Energy-Efficient Supervised Learning with a Binary Stochastic Forward-Forward Algorithm

    cs.LG 2025-07 conditional novelty 6.0 of 10

    Binary stochastic forward-forward training reaches near-real-valued forward-forward accuracy on image benchmarks while estimating 10-100x energy savings in p-bit hardware.

Pith tools