Wei Liu, Kewei Tu, Songlin Yang
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.
Hidden Markov Models (HMMs) and Probabilistic Context-Free Grammars (PCFGs) are widely used structured models, both of which can be represented as factor graph grammars (FGGs), a powerful formalism capable of describing a wide range of models. Recent research found it beneficial to use large state spaces for HMMs and PCFGs. However, inference with large state spaces is computationally demanding, especially for PCFGs. To tackle this challenge, we leverage tensor rank decomposition (aka. CPD) to decrease inference computational complexities for a subset of FGGs subsuming HMMs and PCFGs. We apply CPD on the factors of an FGG and then construct a new FGG defined in the rank space. Inference with the new FGG produces the same result but has a lower time complexity when the rank size is smaller than the state size. We conduct experiments on HMM language modeling and unsupervised PCFG parsing, showing better performance than previous work. Our code is publicly available at https://github.com/ VPeterV/RankSpace-Models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.00484")
get_code_for_paper("2205.00484")
have("2205.00484")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.00484.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.00484)
Connect an agent — have() is free.