We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Bayesian inference plays an important role in advancing machine learning, but faces computational challenges when applied to complex models such as deep neural networks. Variational inference circumvents these challenges by formulating Bayesian inference as an optimization problem and solving it using gradient-based optimization. In this paper, we argue in favor of natural-gradient approaches which, unlike their gradient-based counterparts, can improve convergence by exploiting the information geometry of the solutions. We show how to derive fast yet simple natural-gradient updates by using a duality associated with exponential-family distributions. An attractive feature of these methods is that, by using natural-gradients, they are able to extract accurate local approximations for individual model components. We summarize recent results for Bayesian deep learning showing the superiority of natural-gradient approaches over their gradient counterparts.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1807.04489")
get_code_for_paper("1807.04489")
have("1807.04489")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1807.04489.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1807.04489)
Connect an agent — have() is free.