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.
We present Quantized Variational Inference, a new algorithm for Evidence Lower Bound maximization. We show how Optimal Voronoi Tesselation produces variance free gradients for ELBO optimization at the cost of introducing asymptotically decaying bias. Subsequently, we propose a Richardson extrapolation type method to improve the asymptotic bound. We show that using the Quantized Variational Inference framework leads to fast convergence for both score function and the reparametrized gradient estimator at a comparable computational cost. Finally, we propose several experiments to assess the performance of our method and its limitations.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.02271")
get_code_for_paper("2011.02271")
have("2011.02271")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.02271.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.02271)
Connect an agent — have() is free.