Training Binary Neural Networks using the Bayesian Learning Rule
원문 초록
Neural networks with binary weights are computation-efficient and hardware-friendly, but their training is challenging because it involves a discrete optimization problem. Surprisingly, ignoring the discrete nature of the problem and using gradient-based methods, such as the Straight-Through Estimator, still works well in practice. This raises the question: are there principled approaches which justify such methods? In this paper, we propose such an approach using the Bayesian learning rule. The rule, when applied to estimate a Bernoulli distribution over the binary weights, results in an algorithm which justifies some of the algorithmic choices made by the previous approaches. The algorithm not only obtains state-of-the-art performance, but also enables uncertainty estimation for continual learning to avoid catastrophic forgetting. Our work provides a principled approach for training binary neural networks which justifies and extends existing approaches.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Questioning Representational Optimism in Deep Learning: The Fractured Entangled Representation Hypothesis
LifelongPR: Lifelong knowledge fusion for point cloud place recognition based on replay and prompt learning
Rethinking Query-based Transformer for Continual Image Segmentation
Addressing Imbalanced Domain-Incremental Learning through Dual-Balance Collaborative Experts
PSAT: Pediatric Segmentation Approaches via Adult Augmentations and Transfer Learning
Remember Past, Anticipate Future: Learning Continual Multimodal Misinformation Detectors
토론
이 논문과 연결된 포럼 글이 아직 없습니다.