Fast and Scalable Bayesian Deep Learning by Weight-Perturbation in Adam
원문 초록
Uncertainty computation in deep learning is essential to design robust and reliable systems. Variational inference (VI) is a promising approach for such computation, but requires more effort to implement and execute compared to maximum-likelihood methods. In this paper, we propose new natural-gradient algorithms to reduce such efforts for Gaussian mean-field VI. Our algorithms can be implemented within the Adam optimizer by perturbing the network weights during gradient evaluations, and uncertainty estimates can be cheaply obtained by using the vector that adapts the learning rate. This requires lower memory, computation, and implementation effort than existing VI methods, while obtaining uncertainty estimates of comparable quality. Our empirical results confirm this and further suggest that the weight-perturbation in our algorithm could be useful for exploration in reinforcement learning and stochastic optimization.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bayesian Meta-Reinforcement Learning with Laplace Variational Recurrent Networks
Fully Offline Reinforcement Learning
High-Throughput Distributed Reinforcement Learning via Adaptive Policy Synchronization
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Step-wise Policy for Rare-tool Knowledge (SPaRK): Offline RL that Drives Diverse Tool Use in LLMs
Exploring the robustness of TractOracle methods in RL-based tractography
토론
이 논문과 연결된 포럼 글이 아직 없습니다.