{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":61,"rows_per_page":100,"rows":[101,200],"of":6047,"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","prev":"/task/recommendation-systems","next":"/task/recommendation-systems/papers/3","papers":[{"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/search-based-user-interest-modeling-with","slug":"search-based-user-interest-modeling-with","title":"Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Prediction","date":"2020-06-10","arxiv_id":"2006.05639","repositories_listed":3,"syntology":null},{"url":"/paper/neural-collaborative-reasoning","slug":"neural-collaborative-reasoning","title":"Neural Collaborative Reasoning","date":"2020-05-16","arxiv_id":"2005.08129","repositories_listed":3,"syntology":null},{"url":"/paper/hybridcite-a-hybrid-model-for-context-aware","slug":"hybridcite-a-hybrid-model-for-context-aware","title":"HybridCite: A Hybrid Model for Context-Aware Citation Recommendation","date":"2020-02-15","arxiv_id":"2002.06406","repositories_listed":3,"syntology":null},{"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/the-unfairness-of-popularity-bias-in-music","slug":"the-unfairness-of-popularity-bias-in-music","title":"The Unfairness of Popularity Bias in Music Recommendation: A Reproducibility Study","date":"2019-12-10","arxiv_id":"1912.04696","repositories_listed":3,"syntology":null},{"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/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/joint-neural-collaborative-filtering-for","slug":"joint-neural-collaborative-filtering-for","title":"Joint Neural Collaborative Filtering for Recommender Systems","date":"2019-07-08","arxiv_id":"1907.03459","repositories_listed":3,"syntology":null},{"url":"/paper/reinforcement-learning-for-slate-based","slug":"reinforcement-learning-for-slate-based","title":"Reinforcement Learning for Slate-based Recommender Systems: A Tractable Decomposition and Practical Methodology","date":"2019-05-29","arxiv_id":"1905.12767","repositories_listed":3,"syntology":null},{"url":"/paper/stochastic-shared-embeddings-data-driven","slug":"stochastic-shared-embeddings-data-driven","title":"Stochastic Shared Embeddings: Data-driven Regularization of Embedding Layers","date":"2019-05-25","arxiv_id":"1905.10630","repositories_listed":3,"syntology":null},{"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-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","repositories_listed":3,"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/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"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/retrieving-similar-e-commerce-images-using","slug":"retrieving-similar-e-commerce-images-using","title":"Retrieving Similar E-Commerce Images Using Deep Learning","date":"2019-01-11","arxiv_id":"1901.03546","repositories_listed":3,"syntology":null},{"url":"/paper/nais-neural-attentive-item-similarity-model","slug":"nais-neural-attentive-item-similarity-model","title":"NAIS: Neural Attentive Item Similarity Model for Recommendation","date":"2018-09-19","arxiv_id":"1809.07053","repositories_listed":3,"syntology":null},{"url":"/paper/a-simple-convolutional-generative-network-for","slug":"a-simple-convolutional-generative-network-for","title":"A Simple Convolutional Generative Network for Next Item Recommendation","date":"2018-08-15","arxiv_id":"1808.05163","repositories_listed":3,"syntology":null},{"url":"/paper/news-session-based-recommendations-using-deep","slug":"news-session-based-recommendations-using-deep","title":"News Session-Based Recommendations using Deep Neural Networks","date":"2018-07-31","arxiv_id":"1808.00076","repositories_listed":3,"syntology":null},{"url":"/paper/a-hybrid-variational-autoencoder-for","slug":"a-hybrid-variational-autoencoder-for","title":"A Hybrid Variational Autoencoder for Collaborative Filtering","date":"2018-07-14","arxiv_id":"1808.01006","repositories_listed":3,"syntology":null},{"url":"/paper/time-and-local-popularity-in-top-n","slug":"time-and-local-popularity-in-top-n","title":"Local Popularity and Time in top-N Recommendation","date":"2018-07-11","arxiv_id":"1807.04204","repositories_listed":3,"syntology":null},{"url":"/paper/evaluation-of-session-based-recommendation","slug":"evaluation-of-session-based-recommendation","title":"Evaluation of Session-based Recommendation Algorithms","date":"2018-03-26","arxiv_id":"1803.09587","repositories_listed":3,"syntology":null},{"url":"/paper/sequence-aware-recommender-systems","slug":"sequence-aware-recommender-systems","title":"Sequence-Aware Recommender Systems","date":"2018-02-23","arxiv_id":"1802.08452","repositories_listed":3,"syntology":null},{"url":"/paper/variational-autoencoders-for-collaborative-1","slug":"variational-autoencoders-for-collaborative-1","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/minimizing-polarization-and-disagreement-in","slug":"minimizing-polarization-and-disagreement-in","title":"Minimizing Polarization and Disagreement in Social Networks","date":"2017-12-28","arxiv_id":"1712.09948","repositories_listed":3,"syntology":null},{"url":"/paper/field-aware-factorization-machines-for-ctr","slug":"field-aware-factorization-machines-for-ctr","title":"Field-aware factorization machines for CTR prediction","date":"2016-09-07","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/exponential-machines","slug":"exponential-machines","title":"Exponential Machines","date":"2016-05-12","arxiv_id":"1605.03795","repositories_listed":3,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/exponential-machines#ran","syntology_url":"https://syntology.ai/paper/1605.03795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.03795"}},"official":{"repos":["Bihaqo/exp-machines"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/content-based-recommendations-with-poisson","slug":"content-based-recommendations-with-poisson","title":"Content-based recommendations with Poisson factorization","date":"2014-12-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/unveiling-contrastive-learning-s-capability","slug":"unveiling-contrastive-learning-s-capability","title":"Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filtering","date":"2025-04-14","arxiv_id":"2504.10113","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-self-attentive-sequential","slug":"revisiting-self-attentive-sequential","title":"Revisiting Self-Attentive Sequential Recommendation","date":"2025-04-13","arxiv_id":"2504.09596","repositories_listed":2,"syntology":null},{"url":"/paper/scaling-new-frontiers-insights-into-large","slug":"scaling-new-frontiers-insights-into-large","title":"Scaling New Frontiers: Insights into Large Recommendation Models","date":"2024-12-01","arxiv_id":"2412.00714","repositories_listed":2,"syntology":null},{"url":"/paper/fairsort-learning-to-fair-rank-for","slug":"fairsort-learning-to-fair-rank-for","title":"FairSort: Learning to Fair Rank for Personalized Recommendations in Two-Sided Platforms","date":"2024-11-30","arxiv_id":"2412.00424","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-model-empowered-embedding","slug":"large-language-model-empowered-embedding","title":"LLMEmb: Large Language Model Can Be a Good Embedding Generator for Sequential Recommendation","date":"2024-09-30","arxiv_id":"2409.19925","repositories_listed":2,"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/large-language-model-empowered-embedding#ran","syntology_url":"https://syntology.ai/paper/2409.19925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19925"}},"official":{"repos":["applied-machine-learning-lab/llmemb","liuqidong07/LLMEmb"],"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/can-large-language-models-analyze-graphs-like","slug":"can-large-language-models-analyze-graphs-like","title":"Can Large Language Models Analyze Graphs like Professionals? A Benchmark, Datasets and Models","date":"2024-09-29","arxiv_id":"2409.19667","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/can-large-language-models-analyze-graphs-like#ran","syntology_url":"https://syntology.ai/paper/2409.19667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19667"}},"official":{"repos":["bupt-gamma/prograph"],"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/cross-domain-latent-factors-sharing-via","slug":"cross-domain-latent-factors-sharing-via","title":"Cross-Domain Latent Factors Sharing via Implicit Matrix Factorization","date":"2024-09-23","arxiv_id":"2409.15568","repositories_listed":2,"syntology":null},{"url":"/paper/ssd4rec-a-structured-state-space-duality","slug":"ssd4rec-a-structured-state-space-duality","title":"SSD4Rec: A Structured State Space Duality Model for Efficient Sequential Recommendation","date":"2024-09-02","arxiv_id":"2409.01192","repositories_listed":2,"syntology":null},{"url":"/paper/bidirectional-gated-mamba-for-sequential","slug":"bidirectional-gated-mamba-for-sequential","title":"SIGMA: Selective Gated Mamba for Sequential Recommendation","date":"2024-08-21","arxiv_id":"2408.11451","repositories_listed":2,"syntology":null},{"url":"/paper/pareto-front-approximation-for-multi","slug":"pareto-front-approximation-for-multi","title":"Pareto Front Approximation for Multi-Objective Session-Based Recommender Systems","date":"2024-07-23","arxiv_id":"2407.16828","repositories_listed":2,"syntology":null},{"url":"/paper/2407-21034","slug":"2407-21034","title":"Watermarking Recommender Systems","date":"2024-07-17","arxiv_id":"2407.21034","repositories_listed":2,"syntology":null},{"url":"/paper/uet4rec-u-net-encapsulated-transformer-for","slug":"uet4rec-u-net-encapsulated-transformer-for","title":"UET4Rec: U-net Encapsulated Transformer for Sequential Recommender","date":"2024-07-14","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/improving-multi-modal-recommender-systems-by","slug":"improving-multi-modal-recommender-systems-by","title":"Improving Multi-modal Recommender Systems by Denoising and Aligning Multi-modal Content and User Feedback","date":"2024-06-18","arxiv_id":"2406.12501","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/improving-multi-modal-recommender-systems-by#ran","syntology_url":"https://syntology.ai/paper/2406.12501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12501"}},"official":{"repos":["enoche/mmrec"],"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/an-llm-based-recommender-system-environment","slug":"an-llm-based-recommender-system-environment","title":"SUBER: An RL Environment with Simulated Human Behavior for Recommender Systems","date":"2024-06-01","arxiv_id":"2406.01631","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-models-enhanced-sequential","slug":"large-language-models-enhanced-sequential","title":"LLM-ESR: Large Language Models Enhancement for Long-tailed Sequential Recommendation","date":"2024-05-31","arxiv_id":"2405.20646","repositories_listed":2,"syntology":null},{"url":"/paper/continual-collaborative-distillation-for","slug":"continual-collaborative-distillation-for","title":"Continual Collaborative Distillation for Recommender System","date":"2024-05-29","arxiv_id":"2405.19046","repositories_listed":2,"syntology":null},{"url":"/paper/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"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 1 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/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}},"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/unleashing-the-power-of-multi-task-learning-a","slug":"unleashing-the-power-of-multi-task-learning-a","title":"Unleashing the Power of Multi-Task Learning: A Comprehensive Survey Spanning Traditional, Deep, and Pretrained Foundation Model Eras","date":"2024-04-29","arxiv_id":"2404.18961","repositories_listed":2,"syntology":null},{"url":"/paper/iisan-efficiently-adapting-multimodal","slug":"iisan-efficiently-adapting-multimodal","title":"IISAN: Efficiently Adapting Multimodal Representation for Sequential Recommendation with Decoupled PEFT","date":"2024-04-02","arxiv_id":"2404.02059","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":3,"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/iisan-efficiently-adapting-multimodal#ran","syntology_url":"https://syntology.ai/paper/2404.02059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02059"}},"official":{"repos":["gair-lab/iisan","jjgenailab/iisan"],"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/hypergraphs-with-attention-on-reviews-for","slug":"hypergraphs-with-attention-on-reviews-for","title":"Hypergraphs with Attention on Reviews for Explainable Recommendation","date":"2024-03-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/erase-benchmarking-feature-selection-methods","slug":"erase-benchmarking-feature-selection-methods","title":"ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systems","date":"2024-03-19","arxiv_id":"2403.12660","repositories_listed":2,"syntology":null},{"url":"/paper/mamba4rec-towards-efficient-sequential","slug":"mamba4rec-towards-efficient-sequential","title":"Mamba4Rec: Towards Efficient Sequential Recommendation with Selective State Space Models","date":"2024-03-06","arxiv_id":"2403.03900","repositories_listed":2,"syntology":null},{"url":"/paper/dual-granularity-medication-recommendation","slug":"dual-granularity-medication-recommendation","title":"CIDGMed: Causal Inference-Driven Medication Recommendation with Enhanced Dual-Granularity Learning","date":"2024-03-01","arxiv_id":"2403.00880","repositories_listed":2,"syntology":null},{"url":"/paper/multi-agent-collaboration-framework-for","slug":"multi-agent-collaboration-framework-for","title":"MACRec: a Multi-Agent Collaboration Framework for Recommendation","date":"2024-02-23","arxiv_id":"2402.15235","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":3,"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-agent-collaboration-framework-for#ran","syntology_url":"https://syntology.ai/paper/2402.15235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15235"}},"official":{"repos":["wzf2000/macrec"],"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/can-gnn-be-good-adapter-for-llms","slug":"can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","arxiv_id":"2402.12984","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 2 unverified","sample_list":"/paper/can-gnn-be-good-adapter-for-llms#ran","syntology_url":"https://syntology.ai/paper/2402.12984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12984"}},"official":{"repos":["zjunet/graphadapter","hxttkl/GraphAdapter"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-attentive-inductive-bias-for-sequential","slug":"an-attentive-inductive-bias-for-sequential","title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","date":"2023-12-16","arxiv_id":"2312.10325","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"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/e4srec-an-elegant-effective-efficient","slug":"e4srec-an-elegant-effective-efficient","title":"E4SRec: An Elegant Effective Efficient Extensible Solution of Large Language Models for Sequential Recommendation","date":"2023-12-05","arxiv_id":"2312.02443","repositories_listed":2,"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/e4srec-an-elegant-effective-efficient#ran","syntology_url":"https://syntology.ai/paper/2312.02443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02443"}},"official":{"repos":["hestiasky/e4srec"],"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/agd-an-auto-switchable-optimizer-using-1","slug":"agd-an-auto-switchable-optimizer-using-1","title":"AGD: an Auto-switchable Optimizer using Stepwise Gradient Difference for Preconditioning Matrix","date":"2023-12-04","arxiv_id":"2312.01658","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/agd-an-auto-switchable-optimizer-using-1#ran","syntology_url":"https://syntology.ai/paper/2312.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01658"}},"official":{"repos":["intelligent-machine-learning/atorch","intelligent-machine-learning/dlrover"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","official"]}}},{"url":"/paper/towards-graph-aware-diffusion-modeling-for","slug":"towards-graph-aware-diffusion-modeling-for","title":"Graph Signal Diffusion Model for Collaborative Filtering","date":"2023-11-15","arxiv_id":"2311.08744","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"4 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-graph-aware-diffusion-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2311.08744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08744"}},"official":{"repos":["hasined/giffcf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/improved-regret-bounds-of-multinomial","slug":"improved-regret-bounds-of-multinomial","title":"Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion","date":"2023-10-28","arxiv_id":"2310.18554","repositories_listed":2,"syntology":null},{"url":"/paper/wyze-rule-federated-rule-dataset-for-rule","slug":"wyze-rule-federated-rule-dataset-for-rule","title":"Wyze Rule: Federated Rule Dataset for Rule Recommendation Benchmarking","date":"2023-09-26","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/diffusion-augmentation-for-sequential","slug":"diffusion-augmentation-for-sequential","title":"Diffusion Augmentation for Sequential Recommendation","date":"2023-09-22","arxiv_id":"2309.12858","repositories_listed":2,"syntology":null},{"url":"/paper/ninerec-a-benchmark-dataset-suite-for","slug":"ninerec-a-benchmark-dataset-suite-for","title":"NineRec: A Benchmark Dataset Suite for Evaluating Transferable Recommendation","date":"2023-09-14","arxiv_id":"2309.07705","repositories_listed":2,"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/ninerec-a-benchmark-dataset-suite-for#ran","syntology_url":"https://syntology.ai/paper/2309.07705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07705"}},"official":{"repos":["westlake-repl/ninerec","anonymous-ninerec/ninerec"],"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/turning-dross-into-gold-loss-is-bert4rec","slug":"turning-dross-into-gold-loss-is-bert4rec","title":"Turning Dross Into Gold Loss: is BERT4Rec really better than SASRec?","date":"2023-09-14","arxiv_id":"2309.07602","repositories_listed":2,"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":6,"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/turning-dross-into-gold-loss-is-bert4rec#ran","syntology_url":"https://syntology.ai/paper/2309.07602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07602"}},"official":{"repos":["antklen/sasrec-bert4rec-recsys23"],"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/co-evolving-vector-quantization-for-id-based","slug":"co-evolving-vector-quantization-for-id-based","title":"Learning Category Trees for ID-Based Recommendation: Exploring the Power of Differentiable Vector Quantization","date":"2023-08-31","arxiv_id":"2308.16761","repositories_listed":2,"syntology":null},{"url":"/paper/cagra-highly-parallel-graph-construction-and","slug":"cagra-highly-parallel-graph-construction-and","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","date":"2023-08-29","arxiv_id":"2308.15136","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":8,"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) · 3 unverified","sample_list":"/paper/cagra-highly-parallel-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2308.15136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15136"}},"official":{"repos":["rapidsai/raft"],"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/stem-unleashing-the-power-of-embeddings-for","slug":"stem-unleashing-the-power-of-embeddings-for","title":"STEM: Unleashing the Power of Embeddings for Multi-task Recommendation","date":"2023-08-16","arxiv_id":"2308.13537","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-interest-network-for-click-through","slug":"temporal-interest-network-for-click-through","title":"Temporal Interest Network for User Response Prediction","date":"2023-08-15","arxiv_id":"2308.08487","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"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) · 3 unverified","sample_list":"/paper/temporal-interest-network-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2308.08487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08487"}},"official":{"repos":["zhouxy1003/tin"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cognitive-evolutionary-search-to-select","slug":"cognitive-evolutionary-search-to-select","title":"Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate Prediction","date":"2023-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/alleviating-matthew-effect-of-offline","slug":"alleviating-matthew-effect-of-offline","title":"Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation","date":"2023-07-10","arxiv_id":"2307.04571","repositories_listed":2,"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/alleviating-matthew-effect-of-offline#ran","syntology_url":"https://syntology.ai/paper/2307.04571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04571"}},"official":{"repos":["chongminggao/dorl-codes"],"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":["listed","official"]}}},{"url":"/paper/reloop2-building-self-adaptive-recommendation","slug":"reloop2-building-self-adaptive-recommendation","title":"ReLoop2: Building Self-Adaptive Recommendation Models via Responsive Error Compensation Loop","date":"2023-06-15","arxiv_id":"2306.08808","repositories_listed":2,"syntology":null},{"url":"/paper/comet-learning-cardinality-constrained","slug":"comet-learning-cardinality-constrained","title":"COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Search","date":"2023-06-05","arxiv_id":"2306.02824","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-on-large-language-models-for","slug":"a-survey-on-large-language-models-for","title":"A Survey on Large Language Models for Recommendation","date":"2023-05-31","arxiv_id":"2305.19860","repositories_listed":2,"syntology":null},{"url":"/paper/transact-transformer-based-realtime-user","slug":"transact-transformer-based-realtime-user","title":"TransAct: Transformer-based Realtime User Action Model for Recommendation at Pinterest","date":"2023-05-31","arxiv_id":"2306.00248","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-graph-contrastive-learning-for","slug":"adaptive-graph-contrastive-learning-for","title":"Adaptive Graph Contrastive Learning for Recommendation","date":"2023-05-18","arxiv_id":"2305.10837","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-models-are-zero-shot-rankers","slug":"large-language-models-are-zero-shot-rankers","title":"Large Language Models are Zero-Shot Rankers for Recommender Systems","date":"2023-05-15","arxiv_id":"2305.08845","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/large-language-models-are-zero-shot-rankers#ran","syntology_url":"https://syntology.ai/paper/2305.08845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08845"}},"official":{"repos":["rucaibox/llmrank"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-first-look-at-llm-powered-generative-news","slug":"a-first-look-at-llm-powered-generative-news","title":"ONCE: Boosting Content-based Recommendation with Both Open- and Closed-source Large Language Models","date":"2023-05-11","arxiv_id":"2305.06566","repositories_listed":2,"syntology":null},{"url":"/paper/graph-masked-autoencoder-for-sequential","slug":"graph-masked-autoencoder-for-sequential","title":"Graph Masked Autoencoder for Sequential Recommendation","date":"2023-05-08","arxiv_id":"2305.04619","repositories_listed":2,"syntology":null},{"url":"/paper/communication-efficient-graph-neural-networks","slug":"communication-efficient-graph-neural-networks","title":"Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching","date":"2023-05-04","arxiv_id":"2305.03152","repositories_listed":2,"syntology":null},{"url":"/paper/intent-aware-ranking-ensemble-for","slug":"intent-aware-ranking-ensemble-for","title":"Intent-aware Ranking Ensemble for Personalized Recommendation","date":"2023-04-15","arxiv_id":"2304.07450","repositories_listed":2,"syntology":null},{"url":"/paper/multi-modal-self-supervised-learning-for","slug":"multi-modal-self-supervised-learning-for","title":"Multi-Modal Self-Supervised Learning for Recommendation","date":"2023-02-21","arxiv_id":"2302.10632","repositories_listed":2,"syntology":null},{"url":"/paper/social4rec-distilling-user-preference-from","slug":"social4rec-distilling-user-preference-from","title":"Social4Rec: Distilling User Preference from Social Graph for Video Recommendation in Tencent","date":"2023-02-20","arxiv_id":"2302.09971","repositories_listed":2,"syntology":null},{"url":"/paper/improving-training-stability-for-multitask","slug":"improving-training-stability-for-multitask","title":"Improving Training Stability for Multitask Ranking Models in Recommender Systems","date":"2023-02-17","arxiv_id":"2302.09178","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/improving-training-stability-for-multitask#ran","syntology_url":"https://syntology.ai/paper/2302.09178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.09178"}},"official":{"repos":["tensorflow/recommenders"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-comprehensive-survey-on-multimodal","slug":"a-comprehensive-survey-on-multimodal","title":"A Comprehensive Survey on Multimodal Recommender Systems: Taxonomy, Evaluation, and Future Directions","date":"2023-02-09","arxiv_id":"2302.04473","repositories_listed":2,"syntology":null},{"url":"/paper/adap-tau-adaptively-modulating-embedding","slug":"adap-tau-adaptively-modulating-embedding","title":"Adap-$τ$: Adaptively Modulating Embedding Magnitude for Recommendation","date":"2023-02-09","arxiv_id":"2302.04775","repositories_listed":2,"syntology":null},{"url":"/paper/multimodal-recommender-systems-a-survey","slug":"multimodal-recommender-systems-a-survey","title":"Multimodal Recommender Systems: A Survey","date":"2023-02-08","arxiv_id":"2302.03883","repositories_listed":2,"syntology":null},{"url":"/paper/online-misinformation-video-detection-a","slug":"online-misinformation-video-detection-a","title":"Combating Online Misinformation Videos: Characterization, Detection, and Future Directions","date":"2023-02-07","arxiv_id":"2302.03242","repositories_listed":2,"syntology":null},{"url":"/paper/pre-train-prompt-and-recommendation-a","slug":"pre-train-prompt-and-recommendation-a","title":"Pre-train, Prompt and Recommendation: A Comprehensive Survey of Language Modelling Paradigm Adaptations in Recommender Systems","date":"2023-02-07","arxiv_id":"2302.03735","repositories_listed":2,"syntology":null},{"url":"/paper/recommed-a-comprehensive-pharmaceutical","slug":"recommed-a-comprehensive-pharmaceutical","title":"RECOMED: A Comprehensive Pharmaceutical Recommendation System","date":"2022-12-31","arxiv_id":"2301.00280","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-take-a-break-sustainable","slug":"learning-to-take-a-break-sustainable","title":"Learning to Suggest Breaks: Sustainable Optimization of Long-Term User Engagement","date":"2022-11-24","arxiv_id":"2211.13585","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-of-deep-graph-clustering-taxonomy","slug":"a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","arxiv_id":"2211.12875","repositories_listed":2,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-survey-of-deep-graph-clustering-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2211.12875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12875"}},"official":{"repos":["marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","yueliu1999/awesome-deep-graph-clustering"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-tale-of-two-graphs-freezing-and-denoising","slug":"a-tale-of-two-graphs-freezing-and-denoising","title":"A Tale of Two Graphs: Freezing and Denoising Graph Structures for Multimodal Recommendation","date":"2022-11-13","arxiv_id":"2211.06924","repositories_listed":2,"syntology":null},{"url":"/paper/fedrule-federated-rule-recommendation-system","slug":"fedrule-federated-rule-recommendation-system","title":"FedRule: Federated Rule Recommendation System with Graph Neural Networks","date":"2022-11-13","arxiv_id":"2211.06812","repositories_listed":2,"syntology":null},{"url":"/paper/track2vec-fairness-music-recommendation-with","slug":"track2vec-fairness-music-recommendation-with","title":"Track2Vec: fairness music recommendation with a GPU-free customizable-driven framework","date":"2022-10-29","arxiv_id":"2210.16590","repositories_listed":2,"syntology":null},{"url":"/paper/item-based-variational-auto-encoder-for-fair","slug":"item-based-variational-auto-encoder-for-fair","title":"Item-based Variational Auto-encoder for Fair Music Recommendation","date":"2022-10-24","arxiv_id":"2211.01333","repositories_listed":2,"syntology":null},{"url":"/paper/triplet-losses-based-matrix-factorization-for","slug":"triplet-losses-based-matrix-factorization-for","title":"Triplet Losses-based Matrix Factorization for Robust Recommendations","date":"2022-10-21","arxiv_id":"2210.12098","repositories_listed":2,"syntology":null},{"url":"/paper/quick-graph-conversion-for-robust","slug":"quick-graph-conversion-for-robust","title":"Efficient Bi-Level Optimization for Recommendation Denoising","date":"2022-10-19","arxiv_id":"2210.10321","repositories_listed":2,"syntology":null},{"url":"/paper/tenrec-a-large-scale-multipurpose-benchmark","slug":"tenrec-a-large-scale-multipurpose-benchmark","title":"Tenrec: A Large-scale Multipurpose Benchmark Dataset for Recommender Systems","date":"2022-10-13","arxiv_id":"2210.10629","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/tenrec-a-large-scale-multipurpose-benchmark#ran","syntology_url":"https://syntology.ai/paper/2210.10629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10629"}},"official":{"repos":["yuangh-x/2022-nips-tenrec"],"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/easyrec-an-easy-to-use-extendable-and","slug":"easyrec-an-easy-to-use-extendable-and","title":"EasyRec: An easy-to-use, extendable and efficient framework for building industrial recommendation systems","date":"2022-09-26","arxiv_id":"2209.12766","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-long-sequential-user-data-modeling","slug":"efficient-long-sequential-user-data-modeling","title":"Efficient Long Sequential User Data Modeling for Click-Through Rate Prediction","date":"2022-09-25","arxiv_id":"2209.12212","repositories_listed":2,"syntology":null},{"url":"/paper/tower-bridge-net-tb-net-bidirectional","slug":"tower-bridge-net-tb-net-bidirectional","title":"Tower Bridge Net (TB-Net): Bidirectional Knowledge Graph Aware Embedding Propagation for Explainable Recommender Systems","date":"2022-08-02","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/nasrec-weight-sharing-neural-architecture","slug":"nasrec-weight-sharing-neural-architecture","title":"NASRec: Weight Sharing Neural Architecture Search for Recommender Systems","date":"2022-07-14","arxiv_id":"2207.07187","repositories_listed":2,"syntology":null},{"url":"/paper/towards-representation-alignment-and","slug":"towards-representation-alignment-and","title":"Towards Representation Alignment and Uniformity in Collaborative Filtering","date":"2022-06-26","arxiv_id":"2206.12811","repositories_listed":2,"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/towards-representation-alignment-and#ran","syntology_url":"https://syntology.ai/paper/2206.12811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12811"}},"official":{"repos":["thuwangcy/directau"],"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"]}}}],"record_sha256":"307b62f73f008e439f3c2e8157f4c0cb915aeeb204c34b46a9f8421d230024c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}