arXiv:1810.04777
공식 코드 · Papers with Code
Rao-Blackwellized Stochastic Gradients for Discrete Distributions
원문 초록
We wish to compute the gradient of an expectation over a finite or countably infinite sample space having $K \leq \infty$ categories. When $K$ is indeed infinite, or finite but very large, the relevant summation is intractable. Accordingly, various stochastic gradient estimators have been proposed. In this paper, we describe a technique that can be applied to reduce the variance of any such estimator, without changing its bias---in particular, unbiasedness is retained. We show that our technique is an instance of Rao-Blackwellization, and we demonstrate the improvement it yields on a semi-supervised classification problem and a pixel attention task.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Using Instruction-Tuned Large Language Models to Identify Indicators of Vulnerability in Police Incident Narratives
Harmonic-NAS: Hardware-Aware Multimodal Neural Architecture Search on Resource-constrained Devices
STRAPPER: Preference-based Reinforcement Learning via Self-training Augmentation and Peer Regularization
Unlocking the Use of Raw Multispectral Earth Observation Imagery for Onboard Artificial Intelligence
VNE: An Effective Method for Improving Deep Representation by Manipulating Eigenvalue Distribution
Continuous Indeterminate Probability Neural Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.