资源分类
》 资源 》论文》Decomposing Parameter Estimation Problems

Decomposing Parameter Estimation Problems

2020-01-19 | |  50 |   38 |   0

Abstract

We propose a technique for decomposing the parameter learning problem in Bayesian networks into independent learning problems. Our technique applies to incomplete datasets and exploits variables that are either hidden or observed in the given dataset. We show empirically that the proposed technique can lead to orders-of-magnitude savings in learning time. We explain, analytically and empirically, the reasons behind our reported savings, and compare the proposed technique to related ones that are sometimes used by inference algorithms.

上一篇：Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards

下一篇：A Wild Bootstrap for Degenerate Kernel Tests

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...