Yuntian Deng, Alexander Rush, Justin Chiu
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.
Structured distributions, i.e. distributions over combinatorial spaces, are commonly used to learn latent probabilistic representations from observed data. However, scaling these models is bottlenecked by the high computational and memory complexity with respect to the size of the latent representations. Common models such as Hidden Markov Models (HMMs) and Probabilistic Context-Free Grammars (PCFGs) require time and space quadratic and cubic in the number of hidden states respectively. This work demonstrates a simple approach to reduce the computational and memory complexity of a large class of structured models. We show that by viewing the central inference step as a matrix-vector product and using a low-rank constraint, we can trade off model expressivity and speed via the rank. Experiments with neural parameterized structured models for language modeling, polyphonic music modeling, unsupervised grammar induction, and video modeling show that our approach matches the accuracy of standard models at large state spaces while providing practical speedups. * Equal contribution Code is available here. 35th Conference on Neural Information Processing Systems (NeurIPS 2021).
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.02715")
get_code_for_paper("2201.02715")
have("2201.02715")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.02715.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.02715)
Connect an agent — have() is free.