We lifted 2 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| FirstHandScientist/genhmm | canonical | 0 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| load_model | Not yet run | FirstHandScientist/genhmm/src/genHMM.py code served (permissive licence) · get_code("8c0829cd95933fd9") |
| save_model | Not yet run | FirstHandScientist/genhmm/src/genHMM.py code served (permissive licence) · get_code("2471d824c1eb32d1") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Hidden Markov model (HMM) has been successfully used for sequential data modeling problems. In this work, we propose to power the modeling capacity of HMM by bringing in neural network based generative models. The proposed model is termed as GenHMM. In the proposed GenHMM, each HMM hidden state is associated with a neural network based generative model that has tractability of exact likelihood and provides efficient likelihood computation. A generative model in GenHMM consists of mixture of generators that are realized by flow models. A learning algorithm for GenHMM is proposed in expectation-maximization framework. The convergence of the learning GenHMM is analyzed. We demonstrate the efficiency of GenHMM by classification tasks on practical sequential data. Code available at https://github.com/FirstHandScientist/genhmm.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.05744")
get_code_for_paper("1910.05744")
have("1910.05744")
Connect an agent — have() is free.