arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.07855cs.LGstat.ML
收藏

MaxEntropy Pursuit Variational Inference

Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究所);National Research University Higher School of Economics(国立研究型高等经济学院);Samsung AI Center(三星人工智能中心)

Evgenii Egorov, Kirill Neklydov, Ruslan Kostoev, Evgeny Burnaev

英文摘要:

One of the core problems in variational inference is a choice of approximate posterior distribution. It is crucial to trade-off between efficient inference with simple families as mean-field models and accuracy of inference. We propose a variant of a greedy approximation of the posterior distribution with tractable base learners. Using Max-Entropy approach, we obtain a well-defined optimization problem. We demonstrate the ability of the method to capture complex multimodal posterior via continual learning setting for neural networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑