{"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/10","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":10,"pages_in_order":61,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/recommendation-systems/papers/11","papers":[{"url":"/paper/architectural-sweet-spots-for-modeling-human","slug":"architectural-sweet-spots-for-modeling-human","title":"Architectural Sweet Spots for Modeling Human Label Variation by the Example of Argument Quality: It's Best to Relate Perspectives!","date":"2023-11-06","arxiv_id":"2311.03153","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/architectural-sweet-spots-for-modeling-human#ran","syntology_url":"https://syntology.ai/paper/2311.03153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03153"}},"official":{"repos":["phhei/relateperspectives-sweetspots"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-resolution-diffusion-for-privacy","slug":"multi-resolution-diffusion-for-privacy","title":"Multi-Resolution Diffusion for Privacy-Sensitive Recommender Systems","date":"2023-11-06","arxiv_id":"2311.03488","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-federated-collaborative","slug":"heterogeneous-federated-collaborative","title":"Heterogeneous federated collaborative filtering using FAIR: Federated Averaging in Random Subspaces","date":"2023-11-03","arxiv_id":"2311.01722","repositories_listed":1,"syntology":null},{"url":"/paper/causal-structure-representation-learning-of","slug":"causal-structure-representation-learning-of","title":"Causal Structure Representation Learning of Confounders in Latent Space for Recommendation","date":"2023-11-02","arxiv_id":"2311.03382","repositories_listed":1,"syntology":null},{"url":"/paper/collaboration-and-transition-distilling-item","slug":"collaboration-and-transition-distilling-item","title":"Collaboration and Transition: Distilling Item Transitions into Multi-Query Self-Attention for Sequential Recommendation","date":"2023-11-02","arxiv_id":"2311.01056","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-large-language-model-for","slug":"collaborative-large-language-model-for","title":"Collaborative Large Language Model for Recommender Systems","date":"2023-11-02","arxiv_id":"2311.01343","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/collaborative-large-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2311.01343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01343"}},"official":{"repos":["yaochenzhu/llm4rec"],"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/evaluation-measures-of-individual-item","slug":"evaluation-measures-of-individual-item","title":"Evaluation Measures of Individual Item Fairness for Recommender Systems: A Critical Study","date":"2023-11-02","arxiv_id":"2311.01013","repositories_listed":1,"syntology":null},{"url":"/paper/vm-rec-a-variational-mapping-approach-for","slug":"vm-rec-a-variational-mapping-approach-for","title":"VM-Rec: A Variational Mapping Approach for Cold-start User Recommendation","date":"2023-11-02","arxiv_id":"2311.01304","repositories_listed":1,"syntology":null},{"url":"/paper/llmrec-large-language-models-with-graph","slug":"llmrec-large-language-models-with-graph","title":"LLMRec: Large Language Models with Graph Augmentation for Recommendation","date":"2023-11-01","arxiv_id":"2311.00423","repositories_listed":1,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":12,"n_pointer_only":6,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llmrec-large-language-models-with-graph#ran","syntology_url":"https://syntology.ai/paper/2311.00423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00423"}},"official":{"repos":["hkuds/llmrec"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-automatic-sampling-of-user-behaviors","slug":"towards-automatic-sampling-of-user-behaviors","title":"AutoSAM: Towards Automatic Sampling of User Behaviors for Sequential Recommender Systems","date":"2023-11-01","arxiv_id":"2311.00388","repositories_listed":1,"syntology":null},{"url":"/paper/lfg-a-generative-network-for-real-time","slug":"lfg-a-generative-network-for-real-time","title":"LFG: A Generative Network for Real-Time Recommendation","date":"2023-10-31","arxiv_id":"2310.20189","repositories_listed":1,"syntology":null},{"url":"/paper/pre-trained-recommender-systems-a-causal","slug":"pre-trained-recommender-systems-a-causal","title":"Pre-trained Recommender Systems: A Causal Debiasing Perspective","date":"2023-10-30","arxiv_id":"2310.19251","repositories_listed":1,"syntology":null},{"url":"/paper/raifle-reconstruction-attacks-on-interaction","slug":"raifle-reconstruction-attacks-on-interaction","title":"RAIFLE: Reconstruction Attacks on Interaction-based Federated Learning with Adversarial Data Manipulation","date":"2023-10-29","arxiv_id":"2310.19163","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-in-recommender-systems-a-survey","slug":"embedding-in-recommender-systems-a-survey","title":"Embedding in Recommender Systems: A Survey","date":"2023-10-28","arxiv_id":"2310.18608","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-collaborative-filtering-with","slug":"empowering-collaborative-filtering-with","title":"Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss","date":"2023-10-28","arxiv_id":"2310.18700","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":2,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/empowering-collaborative-filtering-with#ran","syntology_url":"https://syntology.ai/paper/2310.18700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18700"}},"official":{"repos":["lehengthu/advinfonce"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/chain-of-choice-hierarchical-policy-learning","slug":"chain-of-choice-hierarchical-policy-learning","title":"Chain-of-Choice Hierarchical Policy Learning for Conversational Recommendation","date":"2023-10-27","arxiv_id":"2310.17922","repositories_listed":1,"syntology":null},{"url":"/paper/fmmrec-fairness-aware-multimodal","slug":"fmmrec-fairness-aware-multimodal","title":"Causality-Inspired Fair Representation Learning for Multimodal Recommendation","date":"2023-10-26","arxiv_id":"2310.17373","repositories_listed":1,"syntology":null},{"url":"/paper/salespeople-vs-salesbot-exploring-the-role-of","slug":"salespeople-vs-salesbot-exploring-the-role-of","title":"Salespeople vs SalesBot: Exploring the Role of Educational Value in Conversational Recommender Systems","date":"2023-10-26","arxiv_id":"2310.17749","repositories_listed":1,"syntology":null},{"url":"/paper/defense-against-model-extraction-attacks-on","slug":"defense-against-model-extraction-attacks-on","title":"Defense Against Model Extraction Attacks on Recommender Systems","date":"2023-10-25","arxiv_id":"2310.16335","repositories_listed":1,"syntology":null},{"url":"/paper/improving-conversational-recommendation-5","slug":"improving-conversational-recommendation-5","title":"Improving Conversational Recommendation Systems via Bias Analysis and Language-Model-Enhanced Data Augmentation","date":"2023-10-25","arxiv_id":"2310.16738","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-conversational-recommendation-5#ran","syntology_url":"https://syntology.ai/paper/2310.16738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16738"}},"official":{"repos":["wangxieric/bias-crs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/torchsparse-efficient-training-and-inference","slug":"torchsparse-efficient-training-and-inference","title":"TorchSparse++: Efficient Training and Inference Framework for Sparse Convolution on GPUs","date":"2023-10-25","arxiv_id":"2311.12862","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/torchsparse-efficient-training-and-inference#ran","syntology_url":"https://syntology.ai/paper/2311.12862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.12862"}},"official":{"repos":["mit-han-lab/torchsparse"],"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/mlfmf-data-sets-for-machine-learning-for-1","slug":"mlfmf-data-sets-for-machine-learning-for-1","title":"MLFMF: Data Sets for Machine Learning for Mathematical Formalization","date":"2023-10-24","arxiv_id":"2310.16005","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mlfmf-data-sets-for-machine-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2310.16005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16005"}},"official":{"repos":["ul-fmf/mlfmf-data"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/representation-learning-with-large-language","slug":"representation-learning-with-large-language","title":"Representation Learning with Large Language Models for Recommendation","date":"2023-10-24","arxiv_id":"2310.15950","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/representation-learning-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2310.15950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15950"}},"official":{"repos":["hkuds/rlmrec"],"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/using-causality-aware-graph-neural-networks","slug":"using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","date":"2023-10-24","arxiv_id":"2310.15865","repositories_listed":1,"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":4,"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/using-causality-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"official":{"repos":["pathpy/pathpyg"],"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/conversational-recommender-system-and-large","slug":"conversational-recommender-system-and-large","title":"Conversational Recommender System and Large Language Model Are Made for Each Other in E-commerce Pre-sales Dialogue","date":"2023-10-23","arxiv_id":"2310.14626","repositories_listed":1,"syntology":null},{"url":"/paper/intent-contrastive-learning-with-cross","slug":"intent-contrastive-learning-with-cross","title":"Intent Contrastive Learning with Cross Subsequences for Sequential Recommendation","date":"2023-10-22","arxiv_id":"2310.14318","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intent-contrastive-learning-with-cross#ran","syntology_url":"https://syntology.ai/paper/2310.14318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14318"}},"official":{"repos":["qinhsiu/icsrec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/item-graph2vec-a-efficient-and-effective","slug":"item-graph2vec-a-efficient-and-effective","title":"Item-Graph2vec: a Efficient and Effective Approach using Item Co-occurrence Graph Embedding for Collaborative Filtering","date":"2023-10-22","arxiv_id":"2310.14215","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-context-enhanced-diversified","slug":"knowledge-graph-context-enhanced-diversified","title":"Knowledge Graph Context-Enhanced Diversified Recommendation","date":"2023-10-20","arxiv_id":"2310.13253","repositories_listed":1,"syntology":null},{"url":"/paper/unified-pretraining-for-recommendation-via","slug":"unified-pretraining-for-recommendation-via","title":"Unified Pretraining for Recommendation via Task Hypergraphs","date":"2023-10-20","arxiv_id":"2310.13286","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-recommendation","slug":"graph-neural-networks-for-recommendation","title":"Graph Neural Networks for Recommendation: Reproducibility, Graph Topology, and Node Representation","date":"2023-10-17","arxiv_id":"2310.11270","repositories_listed":1,"syntology":null},{"url":"/paper/on-generative-agents-in-recommendation","slug":"on-generative-agents-in-recommendation","title":"On Generative Agents in Recommendation","date":"2023-10-16","arxiv_id":"2310.10108","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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/on-generative-agents-in-recommendation#ran","syntology_url":"https://syntology.ai/paper/2310.10108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10108"}},"official":{"repos":["LehengTHU/Agent4Rec"],"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/rethinking-large-scale-pre-ranking-system","slug":"rethinking-large-scale-pre-ranking-system","title":"Rethinking Large-scale Pre-ranking System: Entire-chain Cross-domain Models","date":"2023-10-12","arxiv_id":"2310.08039","repositories_listed":1,"syntology":null},{"url":"/paper/making-users-indistinguishable-attribute-wise","slug":"making-users-indistinguishable-attribute-wise","title":"Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems","date":"2023-10-06","arxiv_id":"2310.05847","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/making-users-indistinguishable-attribute-wise#ran","syntology_url":"https://syntology.ai/paper/2310.05847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05847"}},"official":null}},{"url":"/paper/newsreclib-a-pytorch-lightning-library-for","slug":"newsreclib-a-pytorch-lightning-library-for","title":"NewsRecLib: A PyTorch-Lightning Library for Neural News Recommendation","date":"2023-10-02","arxiv_id":"2310.01146","repositories_listed":1,"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/newsreclib-a-pytorch-lightning-library-for#ran","syntology_url":"https://syntology.ai/paper/2310.01146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01146"}},"official":{"repos":["andreeaiana/newsreclib"],"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/variance-aware-regret-bounds-for-stochastic","slug":"variance-aware-regret-bounds-for-stochastic","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","date":"2023-10-02","arxiv_id":"2310.00968","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"0 ran · 5 unverified","sample_list":"/paper/variance-aware-regret-bounds-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2310.00968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00968"}},"official":{"repos":["uclaml/vacdb"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"url":"/paper/sappkg-mobile-app-recommendation-using","slug":"sappkg-mobile-app-recommendation-using","title":"SAppKG: Mobile App Recommendation Using Knowledge Graph and Side Information-A Secure Framework","date":"2023-09-29","arxiv_id":"2309.17115","repositories_listed":1,"syntology":null},{"url":"/paper/context-based-tweet-engagement-prediction","slug":"context-based-tweet-engagement-prediction","title":"Context-Based Tweet Engagement Prediction","date":"2023-09-28","arxiv_id":"2310.03147","repositories_listed":1,"syntology":null},{"url":"/paper/a-content-driven-micro-video-recommendation","slug":"a-content-driven-micro-video-recommendation","title":"A Content-Driven Micro-Video Recommendation Dataset at Scale","date":"2023-09-27","arxiv_id":"2309.15379","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-feature-fairness-in-recommendation","slug":"automatic-feature-fairness-in-recommendation","title":"Automatic Feature Fairness in Recommendation via Adversaries","date":"2023-09-27","arxiv_id":"2309.15418","repositories_listed":1,"syntology":null},{"url":"/paper/reform-removing-false-correlation-in-multi","slug":"reform-removing-false-correlation-in-multi","title":"RE-SORT: Removing Spurious Correlation in Multilevel Interaction for CTR Prediction","date":"2023-09-26","arxiv_id":"2309.14891","repositories_listed":1,"syntology":null},{"url":"/paper/the-role-of-document-embedding-in-research","slug":"the-role-of-document-embedding-in-research","title":"Facilitating Interdisciplinary Knowledge Transfer with Research Paper Recommender Systems","date":"2023-09-26","arxiv_id":"2309.14984","repositories_listed":1,"syntology":null},{"url":"/paper/touchup-g-improving-feature-representation","slug":"touchup-g-improving-feature-representation","title":"TouchUp-G: Improving Feature Representation through Graph-Centric Finetuning","date":"2023-09-25","arxiv_id":"2309.13885","repositories_listed":1,"syntology":null},{"url":"/paper/graph-enhanced-optimizers-for-structure-aware","slug":"graph-enhanced-optimizers-for-structure-aware","title":"Graph-enhanced Optimizers for Structure-aware Recommendation Embedding Evolution","date":"2023-09-24","arxiv_id":"2310.03032","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-enhanced-optimizers-for-structure-aware#ran","syntology_url":"https://syntology.ai/paper/2310.03032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03032"}},"official":{"repos":["mtandhj/sevo"],"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/everyone-s-a-winner-on-hyperparameter-tuning","slug":"everyone-s-a-winner-on-hyperparameter-tuning","title":"Everyone's a Winner! On Hyperparameter Tuning of Recommendation Models","date":"2023-09-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generative-retrieval-with-semantic-tree","slug":"generative-retrieval-with-semantic-tree","title":"Generative Retrieval with Semantic Tree-Structured Item Identifiers via Contrastive Learning","date":"2023-09-23","arxiv_id":"2309.13375","repositories_listed":1,"syntology":null},{"url":"/paper/kuaisim-a-comprehensive-simulator-for","slug":"kuaisim-a-comprehensive-simulator-for","title":"KuaiSim: A Comprehensive Simulator for Recommender Systems","date":"2023-09-22","arxiv_id":"2309.12645","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/kuaisim-a-comprehensive-simulator-for#ran","syntology_url":"https://syntology.ai/paper/2309.12645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.12645"}},"official":{"repos":["applied-machine-learning-lab/kuaisim"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/long-tail-augmented-graph-contrastive","slug":"long-tail-augmented-graph-contrastive","title":"Long-tail Augmented Graph Contrastive Learning for Recommendation","date":"2023-09-20","arxiv_id":"2309.11177","repositories_listed":1,"syntology":null},{"url":"/paper/sr-predictao-session-based-recommendation","slug":"sr-predictao-session-based-recommendation","title":"SR-PredictAO: Session-based Recommendation with High-Capability Predictor Add-On","date":"2023-09-20","arxiv_id":"2309.12218","repositories_listed":1,"syntology":null},{"url":"/paper/reformulating-sequential-recommendation","slug":"reformulating-sequential-recommendation","title":"Reformulating Sequential Recommendation: Learning Dynamic User Interest with Content-enriched Language Modeling","date":"2023-09-19","arxiv_id":"2309.10435","repositories_listed":1,"syntology":null},{"url":"/paper/feddcsr-federated-cross-domain-sequential","slug":"feddcsr-federated-cross-domain-sequential","title":"FedDCSR: Federated Cross-domain Sequential Recommendation via Disentangled Representation Learning","date":"2023-09-15","arxiv_id":"2309.08420","repositories_listed":1,"syntology":null},{"url":"/paper/a-conversation-is-worth-a-thousand","slug":"a-conversation-is-worth-a-thousand","title":"A Conversation is Worth A Thousand Recommendations: A Survey of Holistic Conversational Recommender Systems","date":"2023-09-14","arxiv_id":"2309.07682","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-approximate-nonsymmetric-autoencoder","slug":"scalable-approximate-nonsymmetric-autoencoder","title":"Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering","date":"2023-09-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-image-dataset-for-benchmarking-recommender","slug":"an-image-dataset-for-benchmarking-recommender","title":"An Image Dataset for Benchmarking Recommender Systems with Raw Pixels","date":"2023-09-13","arxiv_id":"2309.06789","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/an-image-dataset-for-benchmarking-recommender#ran","syntology_url":"https://syntology.ai/paper/2309.06789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.06789"}},"official":{"repos":["westlake-repl/pixelrec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-original-research-articles","slug":"beyond-original-research-articles","title":"Beyond original Research Articles Categorization via NLP","date":"2023-09-13","arxiv_id":"2309.07020","repositories_listed":1,"syntology":null},{"url":"/paper/a-co-design-study-for-multi-stakeholder-job","slug":"a-co-design-study-for-multi-stakeholder-job","title":"A Co-design Study for Multi-Stakeholder Job Recommender System Explanations","date":"2023-09-11","arxiv_id":"2309.05507","repositories_listed":1,"syntology":null},{"url":"/paper/formalizing-multimedia-recommendation-through","slug":"formalizing-multimedia-recommendation-through","title":"Formalizing Multimedia Recommendation through Multimodal Deep Learning","date":"2023-09-11","arxiv_id":"2309.05273","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-social-choice-mechanisms-for","slug":"exploring-social-choice-mechanisms-for","title":"Exploring Social Choice Mechanisms for Recommendation Fairness in SCRUF","date":"2023-09-10","arxiv_id":"2309.08621","repositories_listed":1,"syntology":null},{"url":"/paper/cpmr-context-aware-incremental-sequential","slug":"cpmr-context-aware-incremental-sequential","title":"CPMR: Context-Aware Incremental Sequential Recommendation with Pseudo-Multi-Task Learning","date":"2023-09-09","arxiv_id":"2309.04802","repositories_listed":1,"syntology":null},{"url":"/paper/recad-towards-a-unified-library-for","slug":"recad-towards-a-unified-library-for","title":"RecAD: Towards A Unified Library for Recommender Attack and Defense","date":"2023-09-09","arxiv_id":"2309.04884","repositories_listed":1,"syntology":null},{"url":"/paper/offline-recommender-system-evaluation-under","slug":"offline-recommender-system-evaluation-under","title":"Offline Recommender System Evaluation under Unobserved Confounding","date":"2023-09-08","arxiv_id":"2309.04222","repositories_listed":1,"syntology":null},{"url":"/paper/provider-fairness-and-beyond-accuracy-trade","slug":"provider-fairness-and-beyond-accuracy-trade","title":"Provider Fairness and Beyond-Accuracy Trade-offs in Recommender Systems","date":"2023-09-08","arxiv_id":"2309.04250","repositories_listed":1,"syntology":null},{"url":"/paper/ssig-a-visually-guided-graph-edit-distance","slug":"ssig-a-visually-guided-graph-edit-distance","title":"SSIG: A Visually-Guided Graph Edit Distance for Floor Plan Similarity","date":"2023-09-08","arxiv_id":"2309.04357","repositories_listed":1,"syntology":null},{"url":"/paper/behind-recommender-systems-the-geography-of","slug":"behind-recommender-systems-the-geography-of","title":"Behind Recommender Systems: the Geography of the ACM RecSys Community","date":"2023-09-07","arxiv_id":"2309.03512","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-chatgpt-as-a-recommender-system-a","slug":"evaluating-chatgpt-as-a-recommender-system-a","title":"Evaluating ChatGPT as a Recommender System: A Rigorous Approach","date":"2023-09-07","arxiv_id":"2309.03613","repositories_listed":1,"syntology":null},{"url":"/paper/learning-compact-compositional-embeddings-via","slug":"learning-compact-compositional-embeddings-via","title":"Learning Compact Compositional Embeddings via Regularized Pruning for Recommendation","date":"2023-09-07","arxiv_id":"2309.03518","repositories_listed":1,"syntology":null},{"url":"/paper/mvfs-multi-view-feature-selection-for","slug":"mvfs-multi-view-feature-selection-for","title":"MvFS: Multi-view Feature Selection for Recommender System","date":"2023-09-05","arxiv_id":"2309.02064","repositories_listed":1,"syntology":null},{"url":"/paper/robust-recommender-system-a-survey-and-future","slug":"robust-recommender-system-a-survey-and-future","title":"Robust Recommender System: A Survey and Future Directions","date":"2023-09-05","arxiv_id":"2309.02057","repositories_listed":1,"syntology":null},{"url":"/paper/outrank-speeding-up-automl-based-model-search","slug":"outrank-speeding-up-automl-based-model-search","title":"OutRank: Speeding up AutoML-based Model Search for Large Sparse Data sets with Cardinality-aware Feature Ranking","date":"2023-09-04","arxiv_id":"2309.01552","repositories_listed":1,"syntology":null},{"url":"/paper/multi-relational-contrastive-learning-for","slug":"multi-relational-contrastive-learning-for","title":"Multi-Relational Contrastive Learning for Recommendation","date":"2023-09-03","arxiv_id":"2309.01103","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"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) · 5 unverified","sample_list":"/paper/multi-relational-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2309.01103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.01103"}},"official":{"repos":["HKUDS/RCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/recommender-ai-agent-integrating-large","slug":"recommender-ai-agent-integrating-large","title":"Recommender AI Agent: Integrating Large Language Models for Interactive Recommendations","date":"2023-08-31","arxiv_id":"2308.16505","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-multi-modalities-fusion-in","slug":"adaptive-multi-modalities-fusion-in","title":"Adaptive Multi-Modalities Fusion in Sequential Recommendation Systems","date":"2023-08-30","arxiv_id":"2308.15980","repositories_listed":1,"syntology":null},{"url":"/paper/providing-previously-unseen-users-fair","slug":"providing-previously-unseen-users-fair","title":"Providing Previously Unseen Users Fair Recommendations Using Variational Autoencoders","date":"2023-08-29","arxiv_id":"2308.15230","repositories_listed":1,"syntology":null},{"url":"/paper/can-transformer-and-gnn-help-each-other","slug":"can-transformer-and-gnn-help-each-other","title":"TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systems","date":"2023-08-28","arxiv_id":"2308.14355","repositories_listed":1,"syntology":null},{"url":"/paper/text-matching-improves-sequential","slug":"text-matching-improves-sequential","title":"Text Matching Improves Sequential Recommendation by Reducing Popularity Biases","date":"2023-08-27","arxiv_id":"2308.14029","repositories_listed":1,"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":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/text-matching-improves-sequential#ran","syntology_url":"https://syntology.ai/paper/2308.14029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14029"}},"official":{"repos":["openmatch/taste"],"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/on-popularity-bias-of-multimodal-aware","slug":"on-popularity-bias-of-multimodal-aware","title":"On Popularity Bias of Multimodal-aware Recommender Systems: a Modalities-driven Analysis","date":"2023-08-24","arxiv_id":"2308.12911","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-consistency-of-average-embeddings-for","slug":"on-the-consistency-of-average-embeddings-for","title":"On the Consistency of Average Embeddings for Item Recommendation","date":"2023-08-24","arxiv_id":"2308.12767","repositories_listed":1,"syntology":null},{"url":"/paper/towards-communication-efficient-model","slug":"towards-communication-efficient-model","title":"Towards Communication-Efficient Model Updating for On-Device Session-Based Recommendation","date":"2023-08-24","arxiv_id":"2308.12777","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-graph-augmentation-for","slug":"counterfactual-graph-augmentation-for","title":"Counterfactual Graph Augmentation for Consumer Unfairness Mitigation in Recommender Systems","date":"2023-08-23","arxiv_id":"2308.12083","repositories_listed":1,"syntology":null},{"url":"/paper/lkpnr-llm-and-kg-for-personalized-news","slug":"lkpnr-llm-and-kg-for-personalized-news","title":"LKPNR: LLM and KG for Personalized News Recommendation Framework","date":"2023-08-23","arxiv_id":"2308.12028","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lkpnr-llm-and-kg-for-personalized-news#ran","syntology_url":"https://syntology.ai/paper/2308.12028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12028"}},"official":{"repos":["xuan-zw/lkpnr"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/llmrec-benchmarking-large-language-models-on","slug":"llmrec-benchmarking-large-language-models-on","title":"LLMRec: Benchmarking Large Language Models on Recommendation Task","date":"2023-08-23","arxiv_id":"2308.12241","repositories_listed":1,"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":5,"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/llmrec-benchmarking-large-language-models-on#ran","syntology_url":"https://syntology.ai/paper/2308.12241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12241"}},"official":{"repos":["williamliujl/llmrec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/rella-retrieval-enhanced-large-language","slug":"rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","arxiv_id":"2308.11131","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rella-retrieval-enhanced-large-language#ran","syntology_url":"https://syntology.ai/paper/2308.11131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11131"}},"official":{"repos":["lavieenrose365/rella"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/test-time-embedding-normalization-for","slug":"test-time-embedding-normalization-for","title":"Test Time Embedding Normalization for Popularity Bias Mitigation","date":"2023-08-22","arxiv_id":"2308.11288","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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/test-time-embedding-normalization-for#ran","syntology_url":"https://syntology.ai/paper/2308.11288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11288"}},"official":{"repos":["ml-postech/tten"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-topology-aware-analysis-of-graph","slug":"a-topology-aware-analysis-of-graph","title":"A Topology-aware Analysis of Graph Collaborative Filtering","date":"2023-08-21","arxiv_id":"2308.10778","repositories_listed":1,"syntology":null},{"url":"/paper/single-user-injection-for-invisible-shilling","slug":"single-user-injection-for-invisible-shilling","title":"Single-User Injection for Invisible Shilling Attack against Recommender Systems","date":"2023-08-21","arxiv_id":"2308.10467","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/single-user-injection-for-invisible-shilling#ran","syntology_url":"https://syntology.ai/paper/2308.10467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10467"}},"official":{"repos":["kdegroup/sui-attack"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-based-alignment-and-uniformity-for","slug":"graph-based-alignment-and-uniformity-for","title":"Graph-based Alignment and Uniformity for Recommendation","date":"2023-08-18","arxiv_id":"2308.09292","repositories_listed":1,"syntology":null},{"url":"/paper/muse-music-recommender-system-with-shuffle","slug":"muse-music-recommender-system-with-shuffle","title":"MUSE: Music Recommender System with Shuffle Play Recommendation Enhancement","date":"2023-08-18","arxiv_id":"2308.09649","repositories_listed":1,"syntology":null},{"url":"/paper/recon-reducing-congestion-in-job","slug":"recon-reducing-congestion-in-job","title":"ReCon: Reducing Congestion in Job Recommendation using Optimal Transport","date":"2023-08-18","arxiv_id":"2308.09516","repositories_listed":1,"syntology":null},{"url":"/paper/capturing-popularity-trends-a-simplistic-non","slug":"capturing-popularity-trends-a-simplistic-non","title":"Capturing Popularity Trends: A Simplistic Non-Personalized Approach for Enhanced Item Recommendation","date":"2023-08-17","arxiv_id":"2308.08799","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-point-of-interest-recommendations","slug":"a-survey-on-point-of-interest-recommendations","title":"A Survey on Point-of-Interest Recommendations Leveraging Heterogeneous Data","date":"2023-08-14","arxiv_id":"2308.07426","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-for-information","slug":"large-language-models-for-information","title":"Large Language Models for Information Retrieval: A Survey","date":"2023-08-14","arxiv_id":"2308.07107","repositories_listed":1,"syntology":null},{"url":"/paper/cdr-conservative-doubly-robust-learning-for","slug":"cdr-conservative-doubly-robust-learning-for","title":"CDR: Conservative Doubly Robust Learning for Debiased Recommendation","date":"2023-08-13","arxiv_id":"2308.08461","repositories_listed":1,"syntology":null},{"url":"/paper/ltp-mmf-towards-long-term-provider-max-min","slug":"ltp-mmf-towards-long-term-provider-max-min","title":"LTP-MMF: Towards Long-term Provider Max-min Fairness Under Recommendation Feedback Loops","date":"2023-08-11","arxiv_id":"2308.05902","repositories_listed":1,"syntology":null},{"url":"/paper/topic-level-bayesian-surprise-and-serendipity","slug":"topic-level-bayesian-surprise-and-serendipity","title":"Topic-Level Bayesian Surprise and Serendipity for Recommender Systems","date":"2023-08-11","arxiv_id":"2308.06368","repositories_listed":1,"syntology":null},{"url":"/paper/toward-a-better-understanding-of-loss","slug":"toward-a-better-understanding-of-loss","title":"Toward a Better Understanding of Loss Functions for Collaborative Filtering","date":"2023-08-11","arxiv_id":"2308.06091","repositories_listed":1,"syntology":null},{"url":"/paper/sslrec-a-self-supervised-learning-library-for","slug":"sslrec-a-self-supervised-learning-library-for","title":"SSLRec: A Self-Supervised Learning Framework for Recommendation","date":"2023-08-10","arxiv_id":"2308.05697","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sslrec-a-self-supervised-learning-library-for#ran","syntology_url":"https://syntology.ai/paper/2308.05697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05697"}},"official":{"repos":["hkuds/sslrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/online-distillation-enhanced-multi-modal","slug":"online-distillation-enhanced-multi-modal","title":"Online Distillation-enhanced Multi-modal Transformer for Sequential Recommendation","date":"2023-08-08","arxiv_id":"2308.04067","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-and-modeling-passive-negative","slug":"understanding-and-modeling-passive-negative","title":"Understanding and Modeling Passive-Negative Feedback for Short-video Sequential Recommendation","date":"2023-08-08","arxiv_id":"2308.04086","repositories_listed":1,"syntology":null},{"url":"/paper/a-lightweight-method-for-modeling-confidence","slug":"a-lightweight-method-for-modeling-confidence","title":"A Lightweight Method for Modeling Confidence in Recommendations with Learned Beta Distributions","date":"2023-08-06","arxiv_id":"2308.03186","repositories_listed":1,"syntology":null},{"url":"/paper/towards-personalized-prompt-model-retrieval","slug":"towards-personalized-prompt-model-retrieval","title":"GEMRec: Towards Generative Model Recommendation","date":"2023-08-04","arxiv_id":"2308.02205","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-recklessness-to-collaborative","slug":"incorporating-recklessness-to-collaborative","title":"Incorporating Recklessness to Collaborative Filtering based Recommender Systems","date":"2023-08-03","arxiv_id":"2308.02058","repositories_listed":1,"syntology":null}],"record_sha256":"4f091200d675db5a4588a679c81ad56dc6c1f387ab6eba1ba7dc8e61c1199878","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}