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.
It seems to be a pearl of conventional wisdom that parameter learning in deep sum-product networks is surprisingly fast compared to shallow mixture models. This paper examines the effects of overparameterization in sum-product networks on the speed of parameter optimisation. Using theoretical analysis and empirical experiments, we show that deep sum-product networks exhibit an implicit acceleration compared to their shallow counterpart. In fact, gradient-based optimisation in deep tree-structured sum-product networks is equal to gradient ascend with adaptive and time-varying learning rates and additional momentum terms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1905.08196")
get_code_for_paper("1905.08196")
have("1905.08196")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1905.08196.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1905.08196)
Connect an agent — have() is free.