{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/recommendation-systems/papers/ran/3","list_of":"/task/recommendation-systems","task":"Recommendation Systems","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"of":330,"counts":{"archive_papers_tagged":6047,"with_a_code_link":1997,"where_syntology_ran_a_sample":330,"not_listed_spam_title":0,"listed":6047,"listed_where_code_ran":330,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":280,"every_run_a_failure_of_syntologys_instrument":50,"listed_with_a_run_with_no_instrument_failure":280,"listed_every_run_a_failure_of_syntologys_instrument":50,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/recommendation-systems/papers/ran/1","prev":"/task/recommendation-systems/papers/ran/2","next":"/task/recommendation-systems/papers/ran/4","papers":[{"url":"/paper/sequential-nature-of-recommender-systems","slug":"sequential-nature-of-recommender-systems","title":"Sequential Nature of Recommender Systems Disrupts the Evaluation Process","date":"2022-05-26","arxiv_id":"2205.13681","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-nature-of-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/2205.13681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13681"}},"official":{"repos":["alishiraligit/augmented-boosting-attack"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bars-towards-open-benchmarking-for","slug":"bars-towards-open-benchmarking-for","title":"BARS: Towards Open Benchmarking for Recommender Systems","date":"2022-05-19","arxiv_id":"2205.09626","repositories_listed":5,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bars-towards-open-benchmarking-for#ran","syntology_url":"https://syntology.ai/paper/2205.09626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09626"}},"official":{"repos":["openbenchmark/BARS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/calibration-matters-tackling-maximization","slug":"calibration-matters-tackling-maximization","title":"Calibration Matters: Tackling Maximization Bias in Large-scale Advertising Recommendation Systems","date":"2022-05-19","arxiv_id":"2205.09809","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/calibration-matters-tackling-maximization#ran","syntology_url":"https://syntology.ai/paper/2205.09809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09809"}},"official":{"repos":["tofuwen/vad"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-contrastive-learning-for","slug":"knowledge-graph-contrastive-learning-for","title":"Knowledge Graph Contrastive Learning for Recommendation","date":"2022-05-02","arxiv_id":"2205.00976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-graph-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00976"}},"official":{"repos":["yuh-yang/kgcl-sigir22"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-multisided-exposure-fairness-for","slug":"joint-multisided-exposure-fairness-for","title":"Joint Multisided Exposure Fairness for Recommendation","date":"2022-04-29","arxiv_id":"2205.00048","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-multisided-exposure-fairness-for#ran","syntology_url":"https://syntology.ai/paper/2205.00048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00048"}},"official":{"repos":["haolun-wu/jmefairness"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-review-aware-graph-contrastive-learning","slug":"a-review-aware-graph-contrastive-learning","title":"A Review-aware Graph Contrastive Learning Framework for Recommendation","date":"2022-04-26","arxiv_id":"2204.12063","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-review-aware-graph-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2204.12063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12063"}},"official":{"repos":["JarenceSJ/ReviewGraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-level-interaction-reranking-with-user","slug":"multi-level-interaction-reranking-with-user","title":"Multi-Level Interaction Reranking with User Behavior History","date":"2022-04-20","arxiv_id":"2204.09370","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-level-interaction-reranking-with-user#ran","syntology_url":"https://syntology.ai/paper/2204.09370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09370"}},"official":{"repos":["YunjiaXi/Multi-Level-Interaction-Reranking"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cirs-bursting-filter-bubbles-by","slug":"cirs-bursting-filter-bubbles-by","title":"CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System","date":"2022-04-04","arxiv_id":"2204.01266","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cirs-bursting-filter-bubbles-by#ran","syntology_url":"https://syntology.ai/paper/2204.01266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01266"}},"official":{"repos":["chongminggao/cirs-codes"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/escm-2-entire-space-counterfactual-multi-task","slug":"escm-2-entire-space-counterfactual-multi-task","title":"ESCM$^2$: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimation","date":"2022-04-03","arxiv_id":"2204.05125","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/escm-2-entire-space-counterfactual-multi-task#ran","syntology_url":"https://syntology.ai/paper/2204.05125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05125"}},"official":null}},{"url":"/paper/cross-domain-recommendation-to-cold-start","slug":"cross-domain-recommendation-to-cold-start","title":"Cross-Domain Recommendation to Cold-Start Users via Variational Information Bottleneck","date":"2022-03-31","arxiv_id":"2203.16863","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cross-domain-recommendation-to-cold-start#ran","syntology_url":"https://syntology.ai/paper/2203.16863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16863"}},"official":{"repos":["cjx96/cdrib"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangled-multimodal-representation","slug":"disentangled-multimodal-representation","title":"Disentangled Multimodal Representation Learning for Recommendation","date":"2022-03-10","arxiv_id":"2203.05406","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disentangled-multimodal-representation#ran","syntology_url":"https://syntology.ai/paper/2203.05406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05406"}},"official":{"repos":["liufancs/dmrl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/kuairec-a-fully-observed-dataset-for","slug":"kuairec-a-fully-observed-dataset-for","title":"KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systems","date":"2022-02-22","arxiv_id":"2202.10842","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kuairec-a-fully-observed-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2202.10842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.10842"}},"official":{"repos":["chongminggao/KuaiRec"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/neural-re-ranking-in-multi-stage-recommender","slug":"neural-re-ranking-in-multi-stage-recommender","title":"Neural Re-ranking in Multi-stage Recommender Systems: A Review","date":"2022-02-14","arxiv_id":"2202.06602","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-re-ranking-in-multi-stage-recommender#ran","syntology_url":"https://syntology.ai/paper/2202.06602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06602"}},"official":{"repos":["librerank-community/librerank"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/off-policy-evaluation-for-large-action-spaces","slug":"off-policy-evaluation-for-large-action-spaces","title":"Off-Policy Evaluation for Large Action Spaces via Embeddings","date":"2022-02-13","arxiv_id":"2202.06317","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/off-policy-evaluation-for-large-action-spaces#ran","syntology_url":"https://syntology.ai/paper/2202.06317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06317"}},"official":{"repos":["st-tech/zr-obp","usaito/icml2022-mips"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/on-sampling-collaborative-filtering-datasets","slug":"on-sampling-collaborative-filtering-datasets","title":"On Sampling Collaborative Filtering Datasets","date":"2022-01-13","arxiv_id":"2201.04768","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-sampling-collaborative-filtering-datasets#ran","syntology_url":"https://syntology.ai/paper/2201.04768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.04768"}},"official":{"repos":["noveens/sampling_cf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-few-shot-class-incremental-learning","slug":"graph-few-shot-class-incremental-learning","title":"Graph Few-shot Class-incremental Learning","date":"2021-12-23","arxiv_id":"2112.12819","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-few-shot-class-incremental-learning#ran","syntology_url":"https://syntology.ai/paper/2112.12819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.12819"}},"official":{"repos":["zhen-tan-dmml/gfcil"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-and-mitigating-gender-bias-in","slug":"exploring-and-mitigating-gender-bias-in","title":"Exploring and Mitigating Gender Bias in Recommender Systems with Explicit Feedback","date":"2021-12-05","arxiv_id":"2112.02530","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-and-mitigating-gender-bias-in#ran","syntology_url":"https://syntology.ai/paper/2112.02530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02530"}},"official":{"repos":["venomnomnom/genderbias"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-online-bayesian-inference-for","slug":"efficient-online-bayesian-inference-for","title":"Efficient Online Bayesian Inference for Neural Bandits","date":"2021-12-01","arxiv_id":"2112.00195","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-online-bayesian-inference-for#ran","syntology_url":"https://syntology.ai/paper/2112.00195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00195"}},"official":{"repos":["probml/bandits"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/it-is-different-when-items-are-older","slug":"it-is-different-when-items-are-older","title":"It Is Different When Items Are Older: Debiasing Recommendations When Selection Bias and User Preferences Are Dynamic","date":"2021-11-24","arxiv_id":"2111.12481","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/it-is-different-when-items-are-older#ran","syntology_url":"https://syntology.ai/paper/2111.12481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12481"}},"official":{"repos":["betsyhj/dancer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/metaformer-is-actually-what-you-need-for","slug":"metaformer-is-actually-what-you-need-for","title":"MetaFormer Is Actually What You Need for Vision","date":"2021-11-22","arxiv_id":"2111.11418","repositories_listed":18,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/metaformer-is-actually-what-you-need-for#ran","syntology_url":"https://syntology.ai/paper/2111.11418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.11418"}},"official":{"repos":["rwightman/pytorch-image-models","sail-sg/poolformer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/recguru-adversarial-learning-of-generalized","slug":"recguru-adversarial-learning-of-generalized","title":"RecGURU: Adversarial Learning of Generalized User Representations for Cross-Domain Recommendation","date":"2021-11-19","arxiv_id":"2111.10093","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recguru-adversarial-learning-of-generalized#ran","syntology_url":"https://syntology.ai/paper/2111.10093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.10093"}},"official":{"repos":["chain123/recguru"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-or-non-linear-that-is-the-question","slug":"linear-or-non-linear-that-is-the-question","title":"Linear, or Non-Linear, That is the Question!","date":"2021-11-14","arxiv_id":"2111.07265","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/linear-or-non-linear-that-is-the-question#ran","syntology_url":"https://syntology.ai/paper/2111.07265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07265"}},"official":{"repos":["jeongwhanchoi/HMLET"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/persia-a-hybrid-system-scaling-deep-learning","slug":"persia-a-hybrid-system-scaling-deep-learning","title":"Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters","date":"2021-11-10","arxiv_id":"2111.05897","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/persia-a-hybrid-system-scaling-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2111.05897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05897"}},"official":{"repos":["persiaml/persia"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/propensity-scored-probabilistic-label-trees","slug":"propensity-scored-probabilistic-label-trees","title":"Propensity-scored Probabilistic Label Trees","date":"2021-10-20","arxiv_id":"2110.10803","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/propensity-scored-probabilistic-label-trees#ran","syntology_url":"https://syntology.ai/paper/2110.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10803"}},"official":{"repos":["mwydmuch/napkinXC"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-with-learnable-1","slug":"graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","arxiv_id":"2110.07875","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-networks-with-learnable-1#ran","syntology_url":"https://syntology.ai/paper/2110.07875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07875"}},"official":{"repos":["vijaydwivedi75/gnn-lspe"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-correction-strategy-for-ranking","slug":"dual-correction-strategy-for-ranking","title":"Dual Correction Strategy for Ranking Distillation in Top-N Recommender System","date":"2021-09-08","arxiv_id":"2109.03459","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dual-correction-strategy-for-ranking#ran","syntology_url":"https://syntology.ai/paper/2109.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.03459"}},"official":{"repos":["dudwns511/dcd_cikm21"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-the-robustness-of-off-policy","slug":"evaluating-the-robustness-of-off-policy","title":"Evaluating the Robustness of Off-Policy Evaluation","date":"2021-08-31","arxiv_id":"2108.13703","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-the-robustness-of-off-policy#ran","syntology_url":"https://syntology.ai/paper/2108.13703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13703"}},"official":{"repos":["st-tech/zr-obp","sony/pyieoe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-trend-networks-for-recommendations","slug":"graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","arxiv_id":"2108.05552","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-trend-networks-for-recommendations#ran","syntology_url":"https://syntology.ai/paper/2108.05552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05552"}},"official":{"repos":["wenqifan03/gtn-sigir2022"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lt-ocf-learnable-time-ode-based-collaborative#ran","syntology_url":"https://syntology.ai/paper/2108.06208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06208"}},"official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/memorize-factorize-or-be-naive-learning","slug":"memorize-factorize-or-be-naive-learning","title":"Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction","date":"2021-08-03","arxiv_id":"2108.01265","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/memorize-factorize-or-be-naive-learning#ran","syntology_url":"https://syntology.ai/paper/2108.01265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01265"}},"official":{"repos":["fuyuanlyu/OptInter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/you-do-not-need-a-bigger-boat-recommendations","slug":"you-do-not-need-a-bigger-boat-recommendations","title":"You Do Not Need a Bigger Boat: Recommendations at Reasonable Scale in a (Mostly) Serverless and Open Stack","date":"2021-07-15","arxiv_id":"2107.07346","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/you-do-not-need-a-bigger-boat-recommendations#ran","syntology_url":"https://syntology.ai/paper/2107.07346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07346"}},"official":{"repos":["jacopotagliabue/metaflow-intent-prediction"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-contextual-bandits-without-regret","slug":"neural-contextual-bandits-without-regret","title":"Neural Contextual Bandits without Regret","date":"2021-07-07","arxiv_id":"2107.03144","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-contextual-bandits-without-regret#ran","syntology_url":"https://syntology.ai/paper/2107.03144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03144"}},"official":{"repos":["pkassraie/NNUCB"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-spotlight-a-general-method-for","slug":"the-spotlight-a-general-method-for","title":"The Spotlight: A General Method for Discovering Systematic Errors in Deep Learning Models","date":"2021-07-01","arxiv_id":"2107.00758","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-spotlight-a-general-method-for#ran","syntology_url":"https://syntology.ai/paper/2107.00758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00758"}},"official":{"repos":["gregdeon/spotlight"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/quantifying-availability-and-discovery-in","slug":"quantifying-availability-and-discovery-in","title":"Quantifying Availability and Discovery in Recommender Systems via Stochastic Reachability","date":"2021-06-30","arxiv_id":"2107.00833","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/quantifying-availability-and-discovery-in#ran","syntology_url":"https://syntology.ai/paper/2107.00833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00833"}},"official":{"repos":["modestyachts/stochastic-rec-reachability"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-spaces-for-graph-embeddings-a","slug":"symmetric-spaces-for-graph-embeddings-a","title":"Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach","date":"2021-06-09","arxiv_id":"2106.04941","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/symmetric-spaces-for-graph-embeddings-a#ran","syntology_url":"https://syntology.ai/paper/2106.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04941"}},"official":{"repos":["fedelopez77/sympa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/dselect-k-differentiable-selection-in-the","slug":"dselect-k-differentiable-selection-in-the","title":"DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning","date":"2021-06-07","arxiv_id":"2106.03760","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dselect-k-differentiable-selection-in-the#ran","syntology_url":"https://syntology.ai/paper/2106.03760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03760"}},"official":{"repos":["google-research/google-research"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/enhanced-doubly-robust-learning-for-debiasing","slug":"enhanced-doubly-robust-learning-for-debiasing","title":"Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimation","date":"2021-05-28","arxiv_id":"2105.13623","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhanced-doubly-robust-learning-for-debiasing#ran","syntology_url":"https://syntology.ai/paper/2105.13623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13623"}},"official":{"repos":["guosyjlu/MRDR-DL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/causal-intervention-for-leveraging-popularity","slug":"causal-intervention-for-leveraging-popularity","title":"Causal Intervention for Leveraging Popularity Bias in Recommendation","date":"2021-05-13","arxiv_id":"2105.06067","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/causal-intervention-for-leveraging-popularity#ran","syntology_url":"https://syntology.ai/paper/2105.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.06067"}},"official":{"repos":["zyang1580/PDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autodebias-learning-to-debias-for","slug":"autodebias-learning-to-debias-for","title":"AutoDebias: Learning to Debias for Recommendation","date":"2021-05-10","arxiv_id":"2105.04170","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autodebias-learning-to-debias-for#ran","syntology_url":"https://syntology.ai/paper/2105.04170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04170"}},"official":{"repos":["DongHande/AutoDebias"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graphformers-gnn-nested-language-models-for","slug":"graphformers-gnn-nested-language-models-for","title":"GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graph","date":"2021-05-06","arxiv_id":"2105.02605","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphformers-gnn-nested-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2105.02605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02605"}},"official":{"repos":["microsoft/graphformers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mining-latent-structures-for-multimedia","slug":"mining-latent-structures-for-multimedia","title":"Mining Latent Structures for Multimedia Recommendation","date":"2021-04-19","arxiv_id":"2104.09036","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mining-latent-structures-for-multimedia#ran","syntology_url":"https://syntology.ai/paper/2104.09036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09036"}},"official":{"repos":["CRIPAC-DIG/LATTICE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/faithfully-explainable-recommendation-via","slug":"faithfully-explainable-recommendation-via","title":"Faithfully Explainable Recommendation via Neural Logic Reasoning","date":"2021-04-16","arxiv_id":"2104.07869","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/faithfully-explainable-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/2104.07869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07869"}},"official":{"repos":["orcax/LOGER"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarks-for-deep-off-policy-evaluation-1","slug":"benchmarks-for-deep-off-policy-evaluation-1","title":"Benchmarks for Deep Off-Policy Evaluation","date":"2021-03-30","arxiv_id":"2103.16596","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarks-for-deep-off-policy-evaluation-1#ran","syntology_url":"https://syntology.ai/paper/2103.16596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16596"}},"official":{"repos":["google-research/deep_ope"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learnable-embedding-sizes-for-recommender-1","slug":"learnable-embedding-sizes-for-recommender-1","title":"Learnable Embedding Sizes for Recommender Systems","date":"2021-01-19","arxiv_id":"2101.07577","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learnable-embedding-sizes-for-recommender-1#ran","syntology_url":"https://syntology.ai/paper/2101.07577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.07577"}},"official":{"repos":["ssui-liu/learnable-embed-sizes-for-RecSys"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/recurrent-point-review-models","slug":"recurrent-point-review-models","title":"Recurrent Point Review Models","date":"2020-12-10","arxiv_id":"2012.05684","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recurrent-point-review-models#ran","syntology_url":"https://syntology.ai/paper/2012.05684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.05684"}},"official":{"repos":["cvejoski/recurrent-point-review-models"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/de-rrd-a-knowledge-distillation-framework-for","slug":"de-rrd-a-knowledge-distillation-framework-for","title":"DE-RRD: A Knowledge Distillation Framework for Recommender System","date":"2020-12-08","arxiv_id":"2012.04357","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/de-rrd-a-knowledge-distillation-framework-for#ran","syntology_url":"https://syntology.ai/paper/2012.04357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04357"}},"official":{"repos":["SeongKu-Kang/DE-RRD_CIKM20"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/adversarial-counterfactual-learning-and-1","slug":"adversarial-counterfactual-learning-and-1","title":"Adversarial Counterfactual Learning and Evaluation for Recommender System","date":"2020-11-08","arxiv_id":"2012.02295","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-counterfactual-learning-and-1#ran","syntology_url":"https://syntology.ai/paper/2012.02295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02295"}},"official":{"repos":["StatsDLMathsRecomSys/Adversarial-Counterfactual-Learning-and-Evaluation-for-Recommender-System"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/aspect-based-document-similarity-for-research","slug":"aspect-based-document-similarity-for-research","title":"Aspect-based Document Similarity for Research Papers","date":"2020-10-13","arxiv_id":"2010.06395","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/aspect-based-document-similarity-for-research#ran","syntology_url":"https://syntology.ai/paper/2010.06395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06395"}},"official":{"repos":["malteos/aspect-document-similarity"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-entity-representations-from-text","slug":"inductive-entity-representations-from-text","title":"Inductive Entity Representations from Text via Link Prediction","date":"2020-10-07","arxiv_id":"2010.03496","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-entity-representations-from-text#ran","syntology_url":"https://syntology.ai/paper/2010.03496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03496"}},"official":{"repos":["dfdazac/blp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-adversarial-networks-protecting","slug":"graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","arxiv_id":"2009.13504","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":5,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-adversarial-networks-protecting#ran","syntology_url":"https://syntology.ai/paper/2009.13504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13504"}},"official":{"repos":["liaopeiyuan/GAL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fuxictr-an-open-benchmark-for-click-through","slug":"fuxictr-an-open-benchmark-for-click-through","title":"BARS-CTR: Open Benchmarking for Click-Through Rate Prediction","date":"2020-09-12","arxiv_id":"2009.05794","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuxictr-an-open-benchmark-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2009.05794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05794"}},"official":{"repos":["reczoo/BARS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/rank-over-class-the-untapped-potential-of","slug":"rank-over-class-the-untapped-potential-of","title":"Rank over Class: The Untapped Potential of Ranking in Natural Language Processing","date":"2020-09-10","arxiv_id":"2009.05160","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rank-over-class-the-untapped-potential-of#ran","syntology_url":"https://syntology.ai/paper/2009.05160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05160"}},"official":{"repos":["atapour/rank-over-class"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/information-theoretic-counterfactual-learning","slug":"information-theoretic-counterfactual-learning","title":"Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedback","date":"2020-09-06","arxiv_id":"2009.02623","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/information-theoretic-counterfactual-learning#ran","syntology_url":"https://syntology.ai/paper/2009.02623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02623"}},"official":{"repos":["RyanWangZf/CVIB-Rec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graphsail-graph-structure-aware-incremental","slug":"graphsail-graph-structure-aware-incremental","title":"GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systems","date":"2020-08-25","arxiv_id":"2008.13517","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphsail-graph-structure-aware-incremental#ran","syntology_url":"https://syntology.ai/paper/2008.13517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13517"}},"official":{"repos":["mmvv11/GraphSAIL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-logic-reasoning","slug":"neural-logic-reasoning","title":"Neural Logic Reasoning","date":"2020-08-20","arxiv_id":"2008.09514","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-logic-reasoning#ran","syntology_url":"https://syntology.ai/paper/2008.09514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09514"}},"official":{"repos":["rutgerswiselab/NLR"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/dcn-m-improved-deep-cross-network-for-feature","slug":"dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","arxiv_id":"2008.13535","repositories_listed":12,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dcn-m-improved-deep-cross-network-for-feature#ran","syntology_url":"https://syntology.ai/paper/2008.13535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13535"}},"official":{"repos":["tensorflow/recommenders"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/self-supervised-learning-for-deep-models-in","slug":"self-supervised-learning-for-deep-models-in","title":"Self-supervised Learning for Large-scale Item Recommendations","date":"2020-07-25","arxiv_id":"2007.12865","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-learning-for-deep-models-in#ran","syntology_url":"https://syntology.ai/paper/2007.12865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.12865"}},"official":null}},{"url":"/paper/explainable-recommendation-via-interpretable","slug":"explainable-recommendation-via-interpretable","title":"Explainable Recommendation via Interpretable Feature Mapping and Evaluation of Explainability","date":"2020-07-12","arxiv_id":"2007.06133","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/explainable-recommendation-via-interpretable#ran","syntology_url":"https://syntology.ai/paper/2007.06133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06133"}},"official":null}},{"url":"/paper/inductive-relational-matrix-completion","slug":"inductive-relational-matrix-completion","title":"Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach","date":"2020-07-09","arxiv_id":"2007.04833","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/inductive-relational-matrix-completion#ran","syntology_url":"https://syntology.ai/paper/2007.04833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04833"}},"official":{"repos":["qitianwu/IDCF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gag-global-attributed-graph-neural-network","slug":"gag-global-attributed-graph-neural-network","title":"GAG: Global Attributed Graph Neural Network for Streaming Session-based Recommendation","date":"2020-07-06","arxiv_id":"2007.02747","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gag-global-attributed-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2007.02747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02747"}},"official":{"repos":["RuihongQiu/GAG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-neighborhood-based-interaction","slug":"an-efficient-neighborhood-based-interaction","title":"An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph","date":"2020-07-01","arxiv_id":"2007.00216","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-efficient-neighborhood-based-interaction#ran","syntology_url":"https://syntology.ai/paper/2007.00216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00216"}},"official":null}},{"url":"/paper/learning-optimal-tree-models-under-beam","slug":"learning-optimal-tree-models-under-beam","title":"Learning Optimal Tree Models Under Beam Search","date":"2020-06-27","arxiv_id":"2006.15408","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-optimal-tree-models-under-beam#ran","syntology_url":"https://syntology.ai/paper/2006.15408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15408"}},"official":null}},{"url":"/paper/direct-feedback-alignment-scales-to-modern","slug":"direct-feedback-alignment-scales-to-modern","title":"Direct Feedback Alignment Scales to Modern Deep Learning Tasks and Architectures","date":"2020-06-23","arxiv_id":"2006.12878","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/direct-feedback-alignment-scales-to-modern#ran","syntology_url":"https://syntology.ai/paper/2006.12878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12878"}},"official":{"repos":["lightonai/dfa-scales-to-modern-deep-learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/temporal-graph-networks-for-deep-learning-on","slug":"temporal-graph-networks-for-deep-learning-on","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","date":"2020-06-18","arxiv_id":"2006.10637","repositories_listed":10,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/temporal-graph-networks-for-deep-learning-on#ran","syntology_url":"https://syntology.ai/paper/2006.10637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10637"}},"official":null}},{"url":"/paper/how-useful-are-reviews-for-recommendation-a","slug":"how-useful-are-reviews-for-recommendation-a","title":"How Useful are Reviews for Recommendation? A Critical Review and Potential Improvements","date":"2020-05-25","arxiv_id":"2005.12210","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/how-useful-are-reviews-for-recommendation-a#ran","syntology_url":"https://syntology.ai/paper/2005.12210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.12210"}},"official":{"repos":["noveens/reviews4rec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gcn-based-user-representation-learning-for","slug":"gcn-based-user-representation-learning-for","title":"GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detection","date":"2020-05-20","arxiv_id":"2005.10150","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gcn-based-user-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2005.10150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10150"}},"official":null}},{"url":"/paper/controllable-multi-interest-framework-for","slug":"controllable-multi-interest-framework-for","title":"Controllable Multi-Interest Framework for Recommendation","date":"2020-05-19","arxiv_id":"2005.09347","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/controllable-multi-interest-framework-for#ran","syntology_url":"https://syntology.ai/paper/2005.09347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09347"}},"official":{"repos":["THUDM/ComiRec"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/stealing-links-from-graph-neural-networks","slug":"stealing-links-from-graph-neural-networks","title":"Stealing Links from Graph Neural Networks","date":"2020-05-05","arxiv_id":"2005.02131","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stealing-links-from-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.02131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02131"}},"official":null}},{"url":"/paper/tensor-decompositions-for-temporal-knowledge-1","slug":"tensor-decompositions-for-temporal-knowledge-1","title":"Tensor Decompositions for temporal knowledge base completion","date":"2020-04-10","arxiv_id":"2004.04926","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tensor-decompositions-for-temporal-knowledge-1#ran","syntology_url":"https://syntology.ai/paper/2004.04926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04926"}},"official":{"repos":["facebookresearch/tkbc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autofis-automatic-feature-interaction","slug":"autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","arxiv_id":"2003.11235","repositories_listed":6,"syntology":{"n":24,"n_ran":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":1,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/autofis-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/2003.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11235"}},"official":{"repos":["zhuchenxv/AutoFIS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","repositories_listed":18,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}},"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/recvae-a-new-variational-autoencoder-for-top","slug":"recvae-a-new-variational-autoencoder-for-top","title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","date":"2019-12-24","arxiv_id":"1912.11160","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recvae-a-new-variational-autoencoder-for-top#ran","syntology_url":"https://syntology.ai/paper/1912.11160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11160"}},"official":{"repos":["ilya-shenbin/RecVAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-with-gaussian-differential","slug":"deep-learning-with-gaussian-differential","title":"Deep Learning with Gaussian Differential Privacy","date":"2019-11-26","arxiv_id":"1911.11607","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":3,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-learning-with-gaussian-differential#ran","syntology_url":"https://syntology.ai/paper/1911.11607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11607"}},"official":{"repos":["woodyx218/Deep-Learning-with-GDP"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-model-based-reinforcement-learning-with","slug":"a-model-based-reinforcement-learning-with","title":"Model-Based Reinforcement Learning with Adversarial Training for Online Recommendation","date":"2019-11-10","arxiv_id":"1911.03845","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-model-based-reinforcement-learning-with#ran","syntology_url":"https://syntology.ai/paper/1911.03845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03845"}},"official":{"repos":["JianGuanTHU/IRecGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixed-dimension-embeddings-with-application","slug":"mixed-dimension-embeddings-with-application","title":"Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems","date":"2019-09-25","arxiv_id":"1909.11810","repositories_listed":6,"syntology":{"n":26,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":26,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixed-dimension-embeddings-with-application#ran","syntology_url":"https://syntology.ai/paper/1909.11810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11810"}},"official":{"repos":["facebookresearch/dlrm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/recsim-a-configurable-simulation-platform-for","slug":"recsim-a-configurable-simulation-platform-for","title":"RecSim: A Configurable Simulation Platform for Recommender Systems","date":"2019-09-11","arxiv_id":"1909.04847","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recsim-a-configurable-simulation-platform-for#ran","syntology_url":"https://syntology.ai/paper/1909.04847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04847"}},"official":{"repos":["google-research/recsim"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/relevance-matrix-factorization","slug":"relevance-matrix-factorization","title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","date":"2019-09-09","arxiv_id":"1909.03601","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/relevance-matrix-factorization#ran","syntology_url":"https://syntology.ai/paper/1909.03601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03601"}},"official":{"repos":["usaito/unbiased-implicit-rec","usaito/unbiased-implicit-rec-real"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/eliminating-bias-in-recommender-systems-via","slug":"eliminating-bias-in-recommender-systems-via","title":"Asymmetric Tri-training for Debiasing Missing-Not-At-Random Explicit Feedback","date":"2019-09-08","arxiv_id":"1910.01444","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/eliminating-bias-in-recommender-systems-via#ran","syntology_url":"https://syntology.ai/paper/1910.01444","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01444"}},"official":{"repos":["usaito/asymmetric-tri-rec-real"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/compositional-embeddings-using-complementary","slug":"compositional-embeddings-using-complementary","title":"Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systems","date":"2019-09-04","arxiv_id":"1909.02107","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/compositional-embeddings-using-complementary#ran","syntology_url":"https://syntology.ai/paper/1909.02107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02107"}},"official":{"repos":["facebookresearch/dlrm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/cosrec-2d-convolutional-neural-networks-for","slug":"cosrec-2d-convolutional-neural-networks-for","title":"CosRec: 2D Convolutional Neural Networks for Sequential Recommendation","date":"2019-08-27","arxiv_id":"1908.09972","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cosrec-2d-convolutional-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1908.09972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09972"}},"official":{"repos":["zzxslp/CosRec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/are-we-really-making-much-progress-a-worrying","slug":"are-we-really-making-much-progress-a-worrying","title":"Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches","date":"2019-07-16","arxiv_id":"1907.06902","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/are-we-really-making-much-progress-a-worrying#ran","syntology_url":"https://syntology.ai/paper/1907.06902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06902"}},"official":{"repos":["MaurizioFD/RecSys2019_DeepLearning_Evaluation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-importance-of-news-content","slug":"on-the-importance-of-news-content","title":"On the Importance of News Content Representation in Hybrid Neural Session-based Recommender Systems","date":"2019-07-12","arxiv_id":"1907.07629","repositories_listed":2,"syntology":{"n":26,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/on-the-importance-of-news-content#ran","syntology_url":"https://syntology.ai/paper/1907.07629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07629"}},"official":{"repos":["gabrielspmoreira/chameleon_recsys"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-gating-networks-for-sequential","slug":"hierarchical-gating-networks-for-sequential","title":"Hierarchical Gating Networks for Sequential Recommendation","date":"2019-06-21","arxiv_id":"1906.09217","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}},"official":{"repos":["allenjack/HGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600091","slug":"190600091","title":"Deep Learning Recommendation Model for Personalization and Recommendation Systems","date":"2019-05-31","arxiv_id":"1906.00091","repositories_listed":19,"syntology":{"n":28,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":15,"n_pointer_only":6,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 0 violated, 15 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/190600091#ran","syntology_url":"https://syntology.ai/paper/1906.00091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00091"}},"official":{"repos":["facebookresearch/dlrm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/darec-deep-domain-adaptation-for-cross-domain","slug":"darec-deep-domain-adaptation-for-cross-domain","title":"DARec: Deep Domain Adaptation for Cross-Domain Recommendation via Transferring Rating Patterns","date":"2019-05-26","arxiv_id":"1905.10760","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/darec-deep-domain-adaptation-for-cross-domain#ran","syntology_url":"https://syntology.ai/paper/1905.10760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10760"}},"official":null}},{"url":"/paper/is-a-single-vector-enough-exploring-node","slug":"is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","arxiv_id":"1905.10668","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/is-a-single-vector-enough-exploring-node#ran","syntology_url":"https://syntology.ai/paper/1905.10668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10668"}},"official":null}},{"url":"/paper/compositional-fairness-constraints-for-graph","slug":"compositional-fairness-constraints-for-graph","title":"Compositional Fairness Constraints for Graph Embeddings","date":"2019-05-25","arxiv_id":"1905.10674","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-fairness-constraints-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10674"}},"official":{"repos":["joeybose/Flexible-Fairness-Constraints"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fibinet-combining-feature-importance-and","slug":"fibinet-combining-feature-importance-and","title":"FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Prediction","date":"2019-05-23","arxiv_id":"1905.09433","repositories_listed":31,"syntology":{"n":26,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":14,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/fibinet-combining-feature-importance-and#ran","syntology_url":"https://syntology.ai/paper/1905.09433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09433"}},"official":null}},{"url":"/paper/practice-on-long-sequential-user-behavior","slug":"practice-on-long-sequential-user-behavior","title":"Practice on Long Sequential User Behavior Modeling for Click-Through Rate Prediction","date":"2019-05-22","arxiv_id":"1905.09248","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/practice-on-long-sequential-user-behavior#ran","syntology_url":"https://syntology.ai/paper/1905.09248","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09248"}},"official":{"repos":["UIC-Paper/MIMN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","repositories_listed":7,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}},"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","repositories_listed":21,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/1905.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08108"}},"official":{"repos":["xiangwang1223/neural_graph_collaborative_filtering"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/190513128","slug":"190513128","title":"Recommendation from Raw Data with Adaptive Compound Poisson Factorization","date":"2019-05-20","arxiv_id":"1905.13128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190513128#ran","syntology_url":"https://syntology.ai/paper/1905.13128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13128"}},"official":{"repos":["Oligou/dcPF"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-session-interest-network-for-click","slug":"deep-session-interest-network-for-click","title":"Deep Session Interest Network for Click-Through Rate Prediction","date":"2019-05-16","arxiv_id":"1905.06482","repositories_listed":7,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-session-interest-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1905.06482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06482"}},"official":{"repos":["shenweichen/DSIN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/behavior-sequence-transformer-for-e-commerce","slug":"behavior-sequence-transformer-for-e-commerce","title":"Behavior Sequence Transformer for E-commerce Recommendation in Alibaba","date":"2019-05-15","arxiv_id":"1905.06874","repositories_listed":9,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/behavior-sequence-transformer-for-e-commerce#ran","syntology_url":"https://syntology.ai/paper/1905.06874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06874"}},"official":null}},{"url":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","repositories_listed":9,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}},"official":null}},{"url":"/paper/on-the-difficulty-of-evaluating-baselines-a","slug":"on-the-difficulty-of-evaluating-baselines-a","title":"On the Difficulty of Evaluating Baselines: A Study on Recommender Systems","date":"2019-05-04","arxiv_id":"1905.01395","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-difficulty-of-evaluating-baselines-a#ran","syntology_url":"https://syntology.ai/paper/1905.01395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01395"}},"official":null}},{"url":"/paper/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-interest-network-with-dynamic-routing","slug":"multi-interest-network-with-dynamic-routing","title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall","date":"2019-04-17","arxiv_id":"1904.08030","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-interest-network-with-dynamic-routing#ran","syntology_url":"https://syntology.ai/paper/1904.08030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08030"}},"official":null}}],"record_sha256":"6dafae4972548494f5eed225416d74d15b10b108b5462c565424fa6f47a2eead","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}