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.
In this paper, we model the dependencies among the items that are recommended to a user in a collaborative-filtering problem via a Gaussian Markov Random Field (MRF). We build upon Besag's auto-normal parameterization and pseudo-likelihood, which not only enables computationally efficient learning, but also connects the areas of MRFs and sparse inverse covariance estimation with autoencoders and neighborhood models, two successful approaches in collaborative filtering. We propose a novel approximation for learning sparse MRFs, where the trade-off between recommendation-accuracy and training-time can be controlled. At only a small fraction of the training-time compared to various baselines, including deep nonlinear models, the proposed approach achieved competitive ranking-accuracy on all three well-known data-sets used in our experiments, and notably a 20% gain in accuracy on the data-set with the largest number of items.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.09645")
get_code_for_paper("1910.09645")
have("1910.09645")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.09645.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.09645)
Connect an agent — have() is free.