Expressive Priors in Bayesian Neural Networks: Kernel Combinations and Periodic Functions
원문 초록
A simple, flexible approach to creating expressive priors in Gaussian process (GP) models makes new kernels from a combination of basic kernels, e.g. summing a periodic and linear kernel can capture seasonal variation with a long term trend. Despite a well-studied link between GPs and Bayesian neural networks (BNNs), the BNN analogue of this has not yet been explored. This paper derives BNN architectures mirroring such kernel combinations. Furthermore, it shows how BNNs can produce periodic kernels, which are often useful in this context. These ideas provide a principled approach to designing BNNs that incorporate prior knowledge about a function. We showcase the practical value of these ideas with illustrative experiments in supervised and reinforcement learning settings.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
High-Throughput Distributed Reinforcement Learning via Adaptive Policy Synchronization
Exploring the robustness of TractOracle methods in RL-based tractography
Deep Reinforcement Learning with Gradient Eligibility Traces
AutoTriton: Automatic Triton Programming with Reinforcement Learning in LLMs
OctoThinker: Mid-training Incentivizes Reinforcement Learning Scaling
Partially Observable Residual Reinforcement Learning for PV-Inverter-Based Voltage Control in Distribution Grids
토론
이 논문과 연결된 포럼 글이 아직 없습니다.