{"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/12","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":12,"pages_in_order":61,"rows_per_page":100,"rows":[1101,1200],"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/papers/11","next":"/task/recommendation-systems/papers/13","papers":[{"url":"/paper/reformulating-ctr-prediction-learning","slug":"reformulating-ctr-prediction-learning","title":"Reformulating CTR Prediction: Learning Invariant Feature Interactions for Recommendation","date":"2023-04-26","arxiv_id":"2304.13643","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-multi-modal-sequential","slug":"self-supervised-multi-modal-sequential","title":"Self-Supervised Multi-Modal Sequential Recommendation","date":"2023-04-26","arxiv_id":"2304.13277","repositories_listed":1,"syntology":null},{"url":"/paper/logicrec-recommendation-with-users-logical","slug":"logicrec-recommendation-with-users-logical","title":"LogicRec: Recommendation with Users' Logical Requirements","date":"2023-04-23","arxiv_id":"2304.11722","repositories_listed":1,"syntology":null},{"url":"/paper/e-pluribus-unum-guidelines-on-multi-objective","slug":"e-pluribus-unum-guidelines-on-multi-objective","title":"E Pluribus Unum: Guidelines on Multi-Objective Evaluation of Recommender Systems","date":"2023-04-20","arxiv_id":"2304.10621","repositories_listed":1,"syntology":null},{"url":"/paper/is-chatgpt-a-good-recommender-a-preliminary","slug":"is-chatgpt-a-good-recommender-a-preliminary","title":"Is ChatGPT a Good Recommender? A Preliminary Study","date":"2023-04-20","arxiv_id":"2304.10149","repositories_listed":1,"syntology":null},{"url":"/paper/attention-mixtures-for-time-aware-sequential","slug":"attention-mixtures-for-time-aware-sequential","title":"Attention Mixtures for Time-Aware Sequential Recommendation","date":"2023-04-17","arxiv_id":"2304.08158","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-residual-metric-learning","slug":"collaborative-residual-metric-learning","title":"Collaborative Residual Metric Learning","date":"2023-04-17","arxiv_id":"2304.07971","repositories_listed":1,"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/collaborative-residual-metric-learning#ran","syntology_url":"https://syntology.ai/paper/2304.07971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.07971"}},"official":{"repos":["Joinn99/CoRML"],"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/melt-mutual-enhancement-of-long-tailed-user","slug":"melt-mutual-enhancement-of-long-tailed-user","title":"MELT: Mutual Enhancement of Long-Tailed User and Item for Sequential Recommendation","date":"2023-04-17","arxiv_id":"2304.08382","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/melt-mutual-enhancement-of-long-tailed-user#ran","syntology_url":"https://syntology.ai/paper/2304.08382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.08382"}},"official":{"repos":["rlqja1107/melt"],"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","unlocated"]}}},{"url":"/paper/a-field-test-of-bandit-algorithms-for","slug":"a-field-test-of-bandit-algorithms-for","title":"A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits","date":"2023-04-16","arxiv_id":"2304.09088","repositories_listed":1,"syntology":null},{"url":"/paper/m2gnn-metapath-and-multi-interest-aggregated","slug":"m2gnn-metapath-and-multi-interest-aggregated","title":"M2GNN: Metapath and Multi-interest Aggregated Graph Neural Network for Tag-based Cross-domain Recommendation","date":"2023-04-16","arxiv_id":"2304.07911","repositories_listed":1,"syntology":null},{"url":"/paper/evalrs-2023-well-rounded-recommender-systems","slug":"evalrs-2023-well-rounded-recommender-systems","title":"EvalRS 2023. Well-Rounded Recommender Systems For Real-World Deployments","date":"2023-04-14","arxiv_id":"2304.07145","repositories_listed":1,"syntology":null},{"url":"/paper/fairrec-fairness-testing-for-deep-recommender","slug":"fairrec-fairness-testing-for-deep-recommender","title":"FairRec: Fairness Testing for Deep Recommender Systems","date":"2023-04-14","arxiv_id":"2304.07030","repositories_listed":1,"syntology":null},{"url":"/paper/gnnuers-fairness-explanation-in-gnns-for","slug":"gnnuers-fairness-explanation-in-gnns-for","title":"GNNUERS: Fairness Explanation in GNNs for Recommendation via Counterfactual Reasoning","date":"2023-04-12","arxiv_id":"2304.06182","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-recommender-model","slug":"diffusion-recommender-model","title":"Diffusion Recommender Model","date":"2023-04-11","arxiv_id":"2304.04971","repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph","slug":"graph-toolformer-to-empower-llms-with-graph","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Dataset Augmented by ChatGPT","date":"2023-04-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph-1","slug":"graph-toolformer-to-empower-llms-with-graph-1","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Augmented by ChatGPT","date":"2023-04-10","arxiv_id":"2304.11116","repositories_listed":1,"syntology":null},{"url":"/paper/editable-user-profiles-for-controllable-text","slug":"editable-user-profiles-for-controllable-text","title":"Editable User Profiles for Controllable Text Recommendation","date":"2023-04-09","arxiv_id":"2304.04250","repositories_listed":1,"syntology":null},{"url":"/paper/generative-recommendation-towards-next","slug":"generative-recommendation-towards-next","title":"Generative Recommendation: Towards Next-generation Recommender Paradigm","date":"2023-04-07","arxiv_id":"2304.03516","repositories_listed":1,"syntology":null},{"url":"/paper/sheaf-neural-networks-for-graph-based","slug":"sheaf-neural-networks-for-graph-based","title":"Sheaf4Rec: Sheaf Neural Networks for Graph-based Recommender Systems","date":"2023-04-07","arxiv_id":"2304.09097","repositories_listed":1,"syntology":null},{"url":"/paper/graph-collaborative-signals-denoising-and","slug":"graph-collaborative-signals-denoising-and","title":"Graph Collaborative Signals Denoising and Augmentation for Recommendation","date":"2023-04-06","arxiv_id":"2304.03344","repositories_listed":1,"syntology":null},{"url":"/paper/taggpt-large-language-models-are-zero-shot","slug":"taggpt-large-language-models-are-zero-shot","title":"TagGPT: Large Language Models are Zero-shot Multimodal Taggers","date":"2023-04-06","arxiv_id":"2304.03022","repositories_listed":1,"syntology":null},{"url":"/paper/a-dynamic-bayesian-optimized-active","slug":"a-dynamic-bayesian-optimized-active","title":"A dynamic Bayesian optimized active recommender system for curiosity-driven Human-in-the-loop automated experiments","date":"2023-04-05","arxiv_id":"2304.02484","repositories_listed":1,"syntology":null},{"url":"/paper/diffurec-a-diffusion-model-for-sequential","slug":"diffurec-a-diffusion-model-for-sequential","title":"DiffuRec: A Diffusion Model for Sequential Recommendation","date":"2023-04-03","arxiv_id":"2304.00686","repositories_listed":1,"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":1,"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/diffurec-a-diffusion-model-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2304.00686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00686"}},"official":{"repos":["whuir/diffurec"],"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/aiseckg-knowledge-graph-dataset-for","slug":"aiseckg-knowledge-graph-dataset-for","title":"AISecKG: Knowledge Graph Dataset for Cybersecurity Education","date":"2023-03-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/causal-disentangled-recommendation-against","slug":"causal-disentangled-recommendation-against","title":"Causal Disentangled Recommendation Against User Preference Shifts","date":"2023-03-28","arxiv_id":"2303.16068","repositories_listed":1,"syntology":null},{"url":"/paper/item-graph-convolution-collaborative","slug":"item-graph-convolution-collaborative","title":"Item Graph Convolution Collaborative Filtering for Inductive Recommendations","date":"2023-03-28","arxiv_id":"2303.15946","repositories_listed":1,"syntology":null},{"url":"/paper/pore-provably-robust-recommender-systems","slug":"pore-provably-robust-recommender-systems","title":"PORE: Provably Robust Recommender Systems against Data Poisoning Attacks","date":"2023-03-26","arxiv_id":"2303.14601","repositories_listed":1,"syntology":null},{"url":"/paper/where-to-go-next-for-recommender-systems-id","slug":"where-to-go-next-for-recommender-systems-id","title":"Where to Go Next for Recommender Systems? ID- vs. Modality-based Recommender Models Revisited","date":"2023-03-24","arxiv_id":"2303.13835","repositories_listed":1,"syntology":null},{"url":"/paper/dialogue-to-video-retrieval","slug":"dialogue-to-video-retrieval","title":"Dialogue-to-Video Retrieval","date":"2023-03-23","arxiv_id":"2303.16761","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-calibration-for-counterfactual","slug":"uncertainty-calibration-for-counterfactual","title":"Uncertainty Calibration for Counterfactual Propensity Estimation in Recommendation","date":"2023-03-23","arxiv_id":"2303.12973","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-causal-inference-for","slug":"a-survey-on-causal-inference-for","title":"A Survey on Causal Inference for Recommendation","date":"2023-03-21","arxiv_id":"2303.11666","repositories_listed":1,"syntology":null},{"url":"/paper/debiased-contrastive-learning-for-sequential","slug":"debiased-contrastive-learning-for-sequential","title":"Debiased Contrastive Learning for Sequential Recommendation","date":"2023-03-21","arxiv_id":"2303.11780","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/debiased-contrastive-learning-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2303.11780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11780"}},"official":{"repos":["hkuds/dcrec"],"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/dynamically-expandable-graph-convolution-for","slug":"dynamically-expandable-graph-convolution-for","title":"Dynamically Expandable Graph Convolution for Streaming Recommendation","date":"2023-03-21","arxiv_id":"2303.11700","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/dynamically-expandable-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2303.11700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11700"}},"official":{"repos":["bokwaiho/degc"],"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/itm-rec-an-open-data-set-for-educational","slug":"itm-rec-an-open-data-set-for-educational","title":"ITM-Rec: An Open Data Set for Educational Recommender Systems","date":"2023-03-17","arxiv_id":"2303.10230","repositories_listed":1,"syntology":null},{"url":"/paper/dually-enhanced-propensity-score-estimation","slug":"dually-enhanced-propensity-score-estimation","title":"Dually Enhanced Propensity Score Estimation in Sequential Recommendation","date":"2023-03-15","arxiv_id":"2303.08722","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-graph-social-recommendation","slug":"disentangled-graph-social-recommendation","title":"Disentangled Graph Social Recommendation","date":"2023-03-14","arxiv_id":"2303.07810","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-single-items-exploring-user","slug":"beyond-single-items-exploring-user","title":"Beyond Single Items: Exploring User Preferences in Item Sets with the Conversational Playlist Curation Dataset","date":"2023-03-13","arxiv_id":"2303.06791","repositories_listed":1,"syntology":null},{"url":"/paper/neural-group-recommendation-based-on-a","slug":"neural-group-recommendation-based-on-a","title":"Neural Group Recommendation Based on a Probabilistic Semantic Aggregation","date":"2023-03-13","arxiv_id":"2303.07001","repositories_listed":1,"syntology":null},{"url":"/paper/p-mmf-provider-max-min-fairness-re-ranking-in","slug":"p-mmf-provider-max-min-fairness-re-ranking-in","title":"P-MMF: Provider Max-min Fairness Re-ranking in Recommender System","date":"2023-03-12","arxiv_id":"2303.06660","repositories_listed":1,"syntology":null},{"url":"/paper/hinet-a-novel-multi-scenario-multi-task","slug":"hinet-a-novel-multi-scenario-multi-task","title":"HiNet: Novel Multi-Scenario & Multi-Task Learning with Hierarchical Information Extraction","date":"2023-03-10","arxiv_id":"2303.06095","repositories_listed":1,"syntology":null},{"url":"/paper/communication-efficient-collaborative","slug":"communication-efficient-collaborative","title":"Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks","date":"2023-03-09","arxiv_id":"2303.05445","repositories_listed":1,"syntology":null},{"url":"/paper/discovery-and-recognition-of-formula-concepts","slug":"discovery-and-recognition-of-formula-concepts","title":"Discovery and Recognition of Formula Concepts using Machine Learning","date":"2023-03-03","arxiv_id":"2303.01994","repositories_listed":1,"syntology":null},{"url":"/paper/distillation-from-heterogeneous-models-for","slug":"distillation-from-heterogeneous-models-for","title":"Distillation from Heterogeneous Models for Top-K Recommendation","date":"2023-03-02","arxiv_id":"2303.01130","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-contrastive-learning-for","slug":"heterogeneous-graph-contrastive-learning-for","title":"Heterogeneous Graph Contrastive Learning for Recommendation","date":"2023-03-02","arxiv_id":"2303.00995","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-explorative-key-term-selection","slug":"efficient-explorative-key-term-selection","title":"Efficient Explorative Key-term Selection Strategies for Conversational Contextual Bandits","date":"2023-03-01","arxiv_id":"2303.00315","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-multi-interest-learning-for","slug":"rethinking-multi-interest-learning-for","title":"Rethinking Multi-Interest Learning for Candidate Matching in Recommender Systems","date":"2023-02-28","arxiv_id":"2302.14532","repositories_listed":1,"syntology":null},{"url":"/paper/the-elements-of-visual-art-recommendation","slug":"the-elements-of-visual-art-recommendation","title":"The Elements of Visual Art Recommendation: Learning Latent Semantic Representations of Paintings","date":"2023-02-28","arxiv_id":"2303.08182","repositories_listed":1,"syntology":null},{"url":"/paper/slate-aware-ranking-for-recommendation","slug":"slate-aware-ranking-for-recommendation","title":"Slate-Aware Ranking for Recommendation","date":"2023-02-24","arxiv_id":"2302.12427","repositories_listed":1,"syntology":null},{"url":"/paper/dual-policy-learning-for-aggregation","slug":"dual-policy-learning-for-aggregation","title":"Dual Policy Learning for Aggregation Optimization in Graph Neural Network-based Recommender Systems","date":"2023-02-21","arxiv_id":"2302.10567","repositories_listed":1,"syntology":null},{"url":"/paper/lightgcl-simple-yet-effective-graph","slug":"lightgcl-simple-yet-effective-graph","title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","date":"2023-02-16","arxiv_id":"2302.08191","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/lightgcl-simple-yet-effective-graph#ran","syntology_url":"https://syntology.ai/paper/2302.08191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08191"}},"official":{"repos":["hkuds/lightgcl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/shared-microexponents-a-little-shifting-goes","slug":"shared-microexponents-a-little-shifting-goes","title":"With Shared Microexponents, A Little Shifting Goes a Long Way","date":"2023-02-16","arxiv_id":"2302.08007","repositories_listed":1,"syntology":null},{"url":"/paper/practical-cross-system-shilling-attacks-with","slug":"practical-cross-system-shilling-attacks-with","title":"Practical Cross-System Shilling Attacks with Limited Access to Data","date":"2023-02-14","arxiv_id":"2302.07145","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/practical-cross-system-shilling-attacks-with#ran","syntology_url":"https://syntology.ai/paper/2302.07145","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07145"}},"official":{"repos":["KDEGroup/PC-Attack"],"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/improving-recommendation-fairness-via-data","slug":"improving-recommendation-fairness-via-data","title":"Improving Recommendation Fairness via Data Augmentation","date":"2023-02-13","arxiv_id":"2302.06333","repositories_listed":1,"syntology":null},{"url":"/paper/when-can-we-track-significant-preference","slug":"when-can-we-track-significant-preference","title":"When Can We Track Significant Preference Shifts in Dueling Bandits?","date":"2023-02-13","arxiv_id":"2302.06595","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-graph-structured-cross-domain","slug":"exploiting-graph-structured-cross-domain","title":"Exploiting Graph Structured Cross-Domain Representation for Multi-Domain Recommendation","date":"2023-02-12","arxiv_id":"2302.05990","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-recommendation-by-learning","slug":"debiasing-recommendation-by-learning","title":"Debiasing Recommendation by Learning Identifiable Latent Confounders","date":"2023-02-10","arxiv_id":"2302.05052","repositories_listed":1,"syntology":null},{"url":"/paper/feature-decomposition-for-reducing-negative","slug":"feature-decomposition-for-reducing-negative","title":"Feature Decomposition for Reducing Negative Transfer: A Novel Multi-task Learning Method for Recommender System","date":"2023-02-10","arxiv_id":"2302.05031","repositories_listed":1,"syntology":null},{"url":"/paper/graph-signal-sampling-for-inductive-one-bit","slug":"graph-signal-sampling-for-inductive-one-bit","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","date":"2023-02-08","arxiv_id":"2302.03933","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/graph-signal-sampling-for-inductive-one-bit#ran","syntology_url":"https://syntology.ai/paper/2302.03933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03933"}},"official":{"repos":["cchao0116/GSIMC-ICLR2023"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangled-causal-embedding-with","slug":"disentangled-causal-embedding-with","title":"Disentangled Causal Embedding With Contrastive Learning For Recommender System","date":"2023-02-07","arxiv_id":"2302.03248","repositories_listed":1,"syntology":null},{"url":"/paper/exploration-and-regularization-of-the-latent","slug":"exploration-and-regularization-of-the-latent","title":"Exploration and Regularization of the Latent Action Space in Recommendation","date":"2023-02-07","arxiv_id":"2302.03431","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-recommendations-with-reinforcement","slug":"multi-task-recommendations-with-reinforcement","title":"Multi-Task Recommendations with Reinforcement Learning","date":"2023-02-07","arxiv_id":"2302.03328","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-task-recommendations-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2302.03328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03328"}},"official":{"repos":["applied-machine-learning-lab/rmtl"],"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/on-the-theories-behind-hard-negative-sampling","slug":"on-the-theories-behind-hard-negative-sampling","title":"On the Theories Behind Hard Negative Sampling for Recommendation","date":"2023-02-07","arxiv_id":"2302.03472","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-collaborative-filtering-for-cold","slug":"contrastive-collaborative-filtering-for-cold","title":"Contrastive Collaborative Filtering for Cold-Start Item Recommendation","date":"2023-02-04","arxiv_id":"2302.02151","repositories_listed":1,"syntology":null},{"url":"/paper/two-stage-constrained-actor-critic-fo-short","slug":"two-stage-constrained-actor-critic-fo-short","title":"Two-Stage Constrained Actor-Critic for Short Video Recommendation","date":"2023-02-03","arxiv_id":"2302.01680","repositories_listed":1,"syntology":null},{"url":"/paper/pepnet-parameter-and-embedding-personalized","slug":"pepnet-parameter-and-embedding-personalized","title":"PEPNet: Parameter and Embedding Personalized Network for Infusing with Personalized Prior Information","date":"2023-02-02","arxiv_id":"2302.01115","repositories_listed":1,"syntology":null},{"url":"/paper/a-counterfactual-collaborative-session-based","slug":"a-counterfactual-collaborative-session-based","title":"A Counterfactual Collaborative Session-based Recommender System","date":"2023-01-31","arxiv_id":"2301.13364","repositories_listed":1,"syntology":null},{"url":"/paper/probably-anytime-safe-stochastic","slug":"probably-anytime-safe-stochastic","title":"Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits","date":"2023-01-31","arxiv_id":"2301.13393","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-dyadic-relations-with-homogeneous","slug":"enhancing-dyadic-relations-with-homogeneous","title":"Enhancing Dyadic Relations with Homogeneous Graphs for Multimodal Recommendation","date":"2023-01-28","arxiv_id":"2301.12097","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-recommendation-for-sparse-and","slug":"graph-based-recommendation-for-sparse-and","title":"Graph-based Recommendation for Sparse and Heterogeneous User Interactions","date":"2023-01-26","arxiv_id":"2301.11009","repositories_listed":1,"syntology":null},{"url":"/paper/federated-recommendation-with-additive","slug":"federated-recommendation-with-additive","title":"Federated Recommendation with Additive Personalization","date":"2023-01-22","arxiv_id":"2301.09109","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-advanced-computer-vision","slug":"a-survey-of-advanced-computer-vision","title":"A Survey of Advanced Computer Vision Techniques for Sports","date":"2023-01-18","arxiv_id":"2301.07583","repositories_listed":1,"syntology":null},{"url":"/paper/dual-personalization-on-federated","slug":"dual-personalization-on-federated","title":"Dual Personalization on Federated Recommendation","date":"2023-01-16","arxiv_id":"2301.08143","repositories_listed":1,"syntology":null},{"url":"/paper/hs-gcn-hamming-spatial-graph-convolutional","slug":"hs-gcn-hamming-spatial-graph-convolutional","title":"HS-GCN: Hamming Spatial Graph Convolutional Networks for Recommendation","date":"2023-01-13","arxiv_id":"2301.05430","repositories_listed":1,"syntology":null},{"url":"/paper/usersimcrs-a-user-simulation-toolkit-for","slug":"usersimcrs-a-user-simulation-toolkit-for","title":"UserSimCRS: A User Simulation Toolkit for Evaluating Conversational Recommender Systems","date":"2023-01-13","arxiv_id":"2301.05544","repositories_listed":1,"syntology":null},{"url":"/paper/data-distillation-a-survey","slug":"data-distillation-a-survey","title":"Data Distillation: A Survey","date":"2023-01-11","arxiv_id":"2301.04272","repositories_listed":1,"syntology":null},{"url":"/paper/why-people-skip-music-on-predicting-music","slug":"why-people-skip-music-on-predicting-music","title":"Why People Skip Music? On Predicting Music Skips using Deep Reinforcement Learning","date":"2023-01-10","arxiv_id":"2301.03881","repositories_listed":1,"syntology":null},{"url":"/paper/causal-inference-in-recommender-systems-a-1","slug":"causal-inference-in-recommender-systems-a-1","title":"Causal Inference in Recommender Systems: A Survey of Strategies for Bias Mitigation, Explanation, and Generalization","date":"2023-01-03","arxiv_id":"2301.00910","repositories_listed":1,"syntology":null},{"url":"/paper/effective-and-efficient-training-for-1","slug":"effective-and-efficient-training-for-1","title":"Improving Sequential Recommendation Models with an Enhanced Loss Function","date":"2023-01-03","arxiv_id":"2301.00979","repositories_listed":1,"syntology":null},{"url":"/paper/uptrendz-api-centric-real-time","slug":"uptrendz-api-centric-real-time","title":"Uptrendz: API-Centric Real-time Recommendations in Multi-Domain Settings","date":"2023-01-03","arxiv_id":"2301.01037","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-news-location-detection-using-an","slug":"multilingual-news-location-detection-using-an","title":"Multilingual News Location Detection using an Entity-Based Siamese Network with Semi-Supervised Contrastive Learning and Knowledge Base","date":"2022-12-22","arxiv_id":"2212.11856","repositories_listed":1,"syntology":null},{"url":"/paper/variational-reasoning-over-incomplete","slug":"variational-reasoning-over-incomplete","title":"Variational Reasoning over Incomplete Knowledge Graphs for Conversational Recommendation","date":"2022-12-22","arxiv_id":"2212.11868","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparison-between-tsetlin-machines-and","slug":"a-comparison-between-tsetlin-machines-and","title":"A Comparison Between Tsetlin Machines and Deep Neural Networks in the Context of Recommendation Systems","date":"2022-12-20","arxiv_id":"2212.10136","repositories_listed":1,"syntology":null},{"url":"/paper/variational-factorization-machines-for","slug":"variational-factorization-machines-for","title":"Variational Factorization Machines for Preference Elicitation in Large-Scale Recommender Systems","date":"2022-12-20","arxiv_id":"2212.09920","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-digital-echo-chambers-the-role-of","slug":"beyond-digital-echo-chambers-the-role-of","title":"Beyond Digital \"Echo Chambers\": The Role of Viewpoint Diversity in Political Discussion","date":"2022-12-18","arxiv_id":"2212.09056","repositories_listed":1,"syntology":null},{"url":"/paper/pac-man-multi-relation-network-in-social","slug":"pac-man-multi-relation-network-in-social","title":"PAC-MAN: Multi-Relation Network in Social Community for Personalized Hashtag Recommendation","date":"2022-12-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/prescriptive-process-monitoring-in","slug":"prescriptive-process-monitoring-in","title":"Prescriptive Process Monitoring in Intelligent Process Automation with Chatbot Orchestration","date":"2022-12-13","arxiv_id":"2212.06564","repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-over-different-types-of-knowledge","slug":"reasoning-over-different-types-of-knowledge","title":"A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal","date":"2022-12-12","arxiv_id":"2212.05767","repositories_listed":1,"syntology":null},{"url":"/paper/untargeted-attack-against-federated","slug":"untargeted-attack-against-federated","title":"Untargeted Attack against Federated Recommendation Systems via Poisonous Item Embeddings and the Defense","date":"2022-12-11","arxiv_id":"2212.05399","repositories_listed":1,"syntology":null},{"url":"/paper/towards-high-order-complementary","slug":"towards-high-order-complementary","title":"Towards High-Order Complementary Recommendation via Logical Reasoning Network","date":"2022-12-09","arxiv_id":"2212.04966","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-graph-neural-networks-for-social","slug":"a-survey-of-graph-neural-networks-for-social","title":"A Survey of Graph Neural Networks for Social Recommender Systems","date":"2022-12-08","arxiv_id":"2212.04481","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-spurious-correlations-for-self","slug":"mitigating-spurious-correlations-for-self","title":"Mitigating Spurious Correlations for Self-supervised Recommendation","date":"2022-12-08","arxiv_id":"2212.04282","repositories_listed":1,"syntology":null},{"url":"/paper/partial-disentanglement-with-partially","slug":"partial-disentanglement-with-partially","title":"PaDPaF: Partial Disentanglement with Partially-Federated GANs","date":"2022-12-07","arxiv_id":"2212.03836","repositories_listed":1,"syntology":null},{"url":"/paper/prefrec-preference-based-recommender-systems","slug":"prefrec-preference-based-recommender-systems","title":"PrefRec: Recommender Systems with Human Preferences for Reinforcing Long-term User Engagement","date":"2022-12-06","arxiv_id":"2212.02779","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/prefrec-preference-based-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/2212.02779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.02779"}},"official":null}},{"url":"/paper/hyperbolic-curvature-graph-neural-network","slug":"hyperbolic-curvature-graph-neural-network","title":"kHGCN: Tree-likeness Modeling via Continuous and Discrete Curvature Learning","date":"2022-12-04","arxiv_id":"2212.01793","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-reward-learning-with-interaction","slug":"personalized-reward-learning-with-interaction","title":"Personalized Reward Learning with Interaction-Grounded Learning (IGL)","date":"2022-11-28","arxiv_id":"2211.15823","repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-knowledge-distillation-for","slug":"unbiased-knowledge-distillation-for","title":"Unbiased Knowledge Distillation for Recommendation","date":"2022-11-27","arxiv_id":"2211.14729","repositories_listed":1,"syntology":null},{"url":"/paper/link-prediction-with-non-contrastive-learning","slug":"link-prediction-with-non-contrastive-learning","title":"Link Prediction with Non-Contrastive Learning","date":"2022-11-25","arxiv_id":"2211.14394","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/link-prediction-with-non-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2211.14394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14394"}},"official":{"repos":["snap-research/non-contrastive-link-prediction"],"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/incentive-aware-recommender-systems-in-two","slug":"incentive-aware-recommender-systems-in-two","title":"Incentive-Aware Recommender Systems in Two-Sided Markets","date":"2022-11-23","arxiv_id":"2211.15381","repositories_listed":1,"syntology":null},{"url":"/paper/one-for-all-all-for-one-learning-and","slug":"one-for-all-all-for-one-learning-and","title":"One for All, All for One: Learning and Transferring User Embeddings for Cross-Domain Recommendation","date":"2022-11-22","arxiv_id":"2211.11964","repositories_listed":1,"syntology":null},{"url":"/paper/directed-acyclic-graph-factorization-machines","slug":"directed-acyclic-graph-factorization-machines","title":"Directed Acyclic Graph Factorization Machines for CTR Prediction via Knowledge Distillation","date":"2022-11-21","arxiv_id":"2211.11159","repositories_listed":1,"syntology":null}],"record_sha256":"6b669ef809c564c502fb6c185b04894058c07a2419d49d6d0140ce73da9ccb73","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}