{"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/14","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":14,"pages_in_order":61,"rows_per_page":100,"rows":[1301,1400],"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/13","next":"/task/recommendation-systems/papers/15","papers":[{"url":"/paper/ranking-in-contextual-multi-armed-bandits","slug":"ranking-in-contextual-multi-armed-bandits","title":"Ranking In Generalized Linear Bandits","date":"2022-06-30","arxiv_id":"2207.00109","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-retriever-and-ranker-in-deep","slug":"cooperative-retriever-and-ranker-in-deep","title":"Cooperative Retriever and Ranker in Deep Recommenders","date":"2022-06-28","arxiv_id":"2206.14649","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-arbitrary-order-beneficial-feature","slug":"detecting-arbitrary-order-beneficial-feature","title":"Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems","date":"2022-06-28","arxiv_id":"2206.13764","repositories_listed":1,"syntology":null},{"url":"/paper/supply-side-equilibria-in-recommender-systems","slug":"supply-side-equilibria-in-recommender-systems","title":"Supply-Side Equilibria in Recommender Systems","date":"2022-06-27","arxiv_id":"2206.13489","repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-leveraging-multi-level-user","slug":"efficiently-leveraging-multi-level-user","title":"Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network","date":"2022-06-26","arxiv_id":"2206.12781","repositories_listed":1,"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":4,"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/efficiently-leveraging-multi-level-user#ran","syntology_url":"https://syntology.ai/paper/2206.12781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12781"}},"official":{"repos":["Peiyance/Atten-Mixer-torch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/the-bandwagon-effect-not-just-another-bias","slug":"the-bandwagon-effect-not-just-another-bias","title":"The Bandwagon Effect: Not Just Another Bias","date":"2022-06-25","arxiv_id":"2206.12701","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-learning-for-membership-inference","slug":"debiasing-learning-for-membership-inference","title":"Debiasing Learning for Membership Inference Attacks Against Recommender Systems","date":"2022-06-24","arxiv_id":"2206.12401","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-generalizability-and-predictability-of","slug":"on-the-generalizability-and-predictability-of","title":"On the Generalizability and Predictability of Recommender Systems","date":"2022-06-23","arxiv_id":"2206.11886","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-generalizability-and-predictability-of#ran","syntology_url":"https://syntology.ai/paper/2206.11886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11886"}},"official":{"repos":["naszilla/reczilla"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-collaborative-metric-learning","slug":"rethinking-collaborative-metric-learning","title":"Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Sampling","date":"2022-06-23","arxiv_id":"2206.11549","repositories_listed":1,"syntology":null},{"url":"/paper/reuseknn-neighborhood-reuse-for-privacy-aware","slug":"reuseknn-neighborhood-reuse-for-privacy-aware","title":"ReuseKNN: Neighborhood Reuse for Differentially-Private KNN-Based Recommendations","date":"2022-06-23","arxiv_id":"2206.11561","repositories_listed":1,"syntology":null},{"url":"/paper/towards-unified-conversational-recommender","slug":"towards-unified-conversational-recommender","title":"Towards Unified Conversational Recommender Systems via Knowledge-Enhanced Prompt Learning","date":"2022-06-19","arxiv_id":"2206.09363","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-factorization-machines-via-saliency","slug":"boosting-factorization-machines-via-saliency","title":"Boosting Factorization Machines via Saliency-Guided Mixup","date":"2022-06-17","arxiv_id":"2206.08661","repositories_listed":1,"syntology":null},{"url":"/paper/why-here-and-not-there-diverse-contrasting","slug":"why-here-and-not-there-diverse-contrasting","title":"\"Why Here and Not There?\" -- Diverse Contrasting Explanations of Dimensionality Reduction","date":"2022-06-15","arxiv_id":"2206.07391","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-rank-rationales-for-explainable","slug":"learning-to-rank-rationales-for-explainable","title":"Learning to Rank Rationales for Explainable Recommendation","date":"2022-06-10","arxiv_id":"2206.05368","repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-fair-meta-learned-recommender","slug":"comprehensive-fair-meta-learned-recommender","title":"Comprehensive Fair Meta-learned Recommender System","date":"2022-06-09","arxiv_id":"2206.04789","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/comprehensive-fair-meta-learned-recommender#ran","syntology_url":"https://syntology.ai/paper/2206.04789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04789"}},"official":{"repos":["weitianxin/CLOVER"],"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/learning-backward-compatible-embeddings","slug":"learning-backward-compatible-embeddings","title":"Learning Backward Compatible Embeddings","date":"2022-06-07","arxiv_id":"2206.03040","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-sequential-recommendation-with","slug":"multi-behavior-sequential-recommendation-with","title":"Multi-Behavior Sequential Recommendation with Temporal Graph Transformer","date":"2022-06-06","arxiv_id":"2206.02687","repositories_listed":1,"syntology":null},{"url":"/paper/a-federated-graph-neural-network-framework","slug":"a-federated-graph-neural-network-framework","title":"A federated graph neural network framework for privacy-preserving personalization","date":"2022-06-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deepref-a-framework-for-optimized-deep","slug":"deepref-a-framework-for-optimized-deep","title":"DeepREF: A Framework for Optimized Deep Learning-based Relation Classification","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalized-delayed-feedback-model-with-post","slug":"generalized-delayed-feedback-model-with-post","title":"Generalized Delayed Feedback Model with Post-Click Information in Recommender Systems","date":"2022-06-01","arxiv_id":"2206.00407","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/generalized-delayed-feedback-model-with-post#ran","syntology_url":"https://syntology.ai/paper/2206.00407","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00407"}},"official":{"repos":["ThyrixYang/gdfm_nips22"],"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/the-engage-corpus-a-social-media-dataset-for","slug":"the-engage-corpus-a-social-media-dataset-for","title":"The Engage Corpus: A Social Media Dataset for Text-Based Recommender Systems","date":"2022-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semantically-enhanced-topic-recommendation","slug":"semantically-enhanced-topic-recommendation","title":"Semantically-enhanced Topic Recommendation System for Software Projects","date":"2022-05-31","arxiv_id":"2206.00085","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-in-the-first-stage-of-two-stage","slug":"fairness-in-the-first-stage-of-two-stage","title":"Uncertainty Quantification for Fairness in Two-Stage Recommender Systems","date":"2022-05-30","arxiv_id":"2205.15436","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-in-the-first-stage-of-two-stage#ran","syntology_url":"https://syntology.ai/paper/2205.15436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15436"}},"official":{"repos":["lequnwang/fair-two-stage-recommender"],"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/deep-deconfounded-content-based-tag","slug":"deep-deconfounded-content-based-tag","title":"Deep Deconfounded Content-based Tag Recommendation for UGC with Causal Intervention","date":"2022-05-28","arxiv_id":"2205.14380","repositories_listed":1,"syntology":null},{"url":"/paper/improving-item-cold-start-recommendation-via","slug":"improving-item-cold-start-recommendation-via","title":"Improving Item Cold-start Recommendation via Model-agnostic Conditional Variational Autoencoder","date":"2022-05-27","arxiv_id":"2205.13795","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-nature-of-recommender-systems","slug":"sequential-nature-of-recommender-systems","title":"Sequential Nature of Recommender Systems Disrupts the Evaluation Process","date":"2022-05-26","arxiv_id":"2205.13681","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-nature-of-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/2205.13681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13681"}},"official":{"repos":["alishiraligit/augmented-boosting-attack"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mealrec-a-meal-recommendation-dataset","slug":"mealrec-a-meal-recommendation-dataset","title":"MealRec: A Meal Recommendation Dataset","date":"2022-05-24","arxiv_id":"2205.12133","repositories_listed":1,"syntology":null},{"url":"/paper/meta-policy-learning-for-cold-start","slug":"meta-policy-learning-for-cold-start","title":"Meta Policy Learning for Cold-Start Conversational Recommendation","date":"2022-05-24","arxiv_id":"2205.11788","repositories_listed":1,"syntology":null},{"url":"/paper/recommenderlab-an-r-framework-for-developing","slug":"recommenderlab-an-r-framework-for-developing","title":"recommenderlab: An R Framework for Developing and Testing Recommendation Algorithms","date":"2022-05-24","arxiv_id":"2205.12371","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-research-on-fair-recommender","slug":"a-survey-of-research-on-fair-recommender","title":"Fairness in Recommender Systems: Research Landscape and Future Directions","date":"2022-05-23","arxiv_id":"2205.11127","repositories_listed":1,"syntology":null},{"url":"/paper/ada-ranker-a-data-distribution-adaptive","slug":"ada-ranker-a-data-distribution-adaptive","title":"Ada-Ranker: A Data Distribution Adaptive Ranking Paradigm for Sequential Recommendation","date":"2022-05-22","arxiv_id":"2205.10775","repositories_listed":1,"syntology":null},{"url":"/paper/calibration-matters-tackling-maximization","slug":"calibration-matters-tackling-maximization","title":"Calibration Matters: Tackling Maximization Bias in Large-scale Advertising Recommendation Systems","date":"2022-05-19","arxiv_id":"2205.09809","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/calibration-matters-tackling-maximization#ran","syntology_url":"https://syntology.ai/paper/2205.09809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09809"}},"official":{"repos":["tofuwen/vad"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/experiments-on-generalizability-of-user","slug":"experiments-on-generalizability-of-user","title":"Experiments on Generalizability of User-Oriented Fairness in Recommender Systems","date":"2022-05-17","arxiv_id":"2205.08289","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-confounding-feature-issue-for","slug":"addressing-confounding-feature-issue-for","title":"Addressing Confounding Feature Issue for Causal Recommendation","date":"2022-05-13","arxiv_id":"2205.06532","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-based-collaborative-filtering-with","slug":"tensor-based-collaborative-filtering-with","title":"Tensor-based Collaborative Filtering With Smooth Ratings Scale","date":"2022-05-10","arxiv_id":"2205.05070","repositories_listed":1,"syntology":null},{"url":"/paper/are-quantum-computers-practical-yet-a-case","slug":"are-quantum-computers-practical-yet-a-case","title":"Are Quantum Computers Practical Yet? A Case for Feature Selection in Recommender Systems using Tensor Networks","date":"2022-05-09","arxiv_id":"2205.04490","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-image-based-fashion-recommendation","slug":"end-to-end-image-based-fashion-recommendation","title":"End-to-End Image-Based Fashion Recommendation","date":"2022-05-05","arxiv_id":"2205.02923","repositories_listed":1,"syntology":null},{"url":"/paper/greendb-toward-a-product-by-product","slug":"greendb-toward-a-product-by-product","title":"GreenDB: Toward a Product-by-Product Sustainability Database","date":"2022-05-05","arxiv_id":"2205.02908","repositories_listed":1,"syntology":null},{"url":"/paper/spiking-graph-convolutional-networks-1","slug":"spiking-graph-convolutional-networks-1","title":"Spiking Graph Convolutional Networks","date":"2022-05-05","arxiv_id":"2205.02767","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-and-simulating-user-utterance","slug":"analyzing-and-simulating-user-utterance","title":"Analyzing and Simulating User Utterance Reformulation in Conversational Recommender Systems","date":"2022-05-03","arxiv_id":"2205.01763","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-contrastive-learning-for","slug":"knowledge-graph-contrastive-learning-for","title":"Knowledge Graph Contrastive Learning for Recommendation","date":"2022-05-02","arxiv_id":"2205.00976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-graph-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2205.00976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00976"}},"official":{"repos":["yuh-yang/kgcl-sigir22"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/escaping-spurious-local-minima-of-low-rank","slug":"escaping-spurious-local-minima-of-low-rank","title":"Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition","date":"2022-04-29","arxiv_id":"2204.14067","repositories_listed":1,"syntology":null},{"url":"/paper/user-controllable-recommendation-against","slug":"user-controllable-recommendation-against","title":"User-controllable Recommendation Against Filter Bubbles","date":"2022-04-29","arxiv_id":"2204.13844","repositories_listed":1,"syntology":null},{"url":"/paper/autolossgen-automatic-loss-function","slug":"autolossgen-automatic-loss-function","title":"AutoLossGen: Automatic Loss Function Generation for Recommender Systems","date":"2022-04-27","arxiv_id":"2204.13160","repositories_listed":1,"syntology":null},{"url":"/paper/a-review-aware-graph-contrastive-learning","slug":"a-review-aware-graph-contrastive-learning","title":"A Review-aware Graph Contrastive Learning Framework for Recommendation","date":"2022-04-26","arxiv_id":"2204.12063","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-review-aware-graph-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2204.12063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12063"}},"official":{"repos":["JarenceSJ/ReviewGraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-pairwise-ranking-for-unbiased-item","slug":"cross-pairwise-ranking-for-unbiased-item","title":"Cross Pairwise Ranking for Unbiased Item Recommendation","date":"2022-04-26","arxiv_id":"2204.12176","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-contrastive-collaborative","slug":"hypergraph-contrastive-collaborative","title":"Hypergraph Contrastive Collaborative Filtering","date":"2022-04-26","arxiv_id":"2204.12200","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-accuracy-novelty-performance","slug":"investigating-accuracy-novelty-performance","title":"Investigating Accuracy-Novelty Performance for Graph-based Collaborative Filtering","date":"2022-04-26","arxiv_id":"2204.12326","repositories_listed":1,"syntology":null},{"url":"/paper/poisoning-deep-learning-based-recommender","slug":"poisoning-deep-learning-based-recommender","title":"Poisoning Deep Learning Based Recommender Model in Federated Learning Scenarios","date":"2022-04-26","arxiv_id":"2204.13594","repositories_listed":1,"syntology":null},{"url":"/paper/determinantal-point-process-likelihoods-for","slug":"determinantal-point-process-likelihoods-for","title":"Determinantal Point Process Likelihoods for Sequential Recommendation","date":"2022-04-25","arxiv_id":"2204.11562","repositories_listed":1,"syntology":null},{"url":"/paper/fairgan-gans-based-fairness-aware-learning","slug":"fairgan-gans-based-fairness-aware-learning","title":"FairGAN: GANs-based Fairness-aware Learning for Recommendations with Implicit Feedback","date":"2022-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/less-is-more-reweighting-important-spectral","slug":"less-is-more-reweighting-important-spectral","title":"Less is More: Reweighting Important Spectral Graph Features for Recommendation","date":"2022-04-24","arxiv_id":"2204.11346","repositories_listed":1,"syntology":null},{"url":"/paper/post-processing-recommender-systems-with","slug":"post-processing-recommender-systems-with","title":"Post Processing Recommender Systems with Knowledge Graphs for Recency, Popularity, and Diversity of Explanations","date":"2022-04-24","arxiv_id":"2204.11241","repositories_listed":1,"syntology":null},{"url":"/paper/on-device-next-item-recommendation-with-self","slug":"on-device-next-item-recommendation-with-self","title":"On-Device Next-Item Recommendation with Self-Supervised Knowledge Distillation","date":"2022-04-23","arxiv_id":"2204.11091","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-session-information-in-bert-based","slug":"exploiting-session-information-in-bert-based","title":"Exploiting Session Information in BERT-based Session-aware Sequential Recommendation","date":"2022-04-22","arxiv_id":"2204.10851","repositories_listed":1,"syntology":null},{"url":"/paper/subscriptions-and-external-links-help-drive","slug":"subscriptions-and-external-links-help-drive","title":"Subscriptions and external links help drive resentful users to alternative and extremist YouTube videos","date":"2022-04-22","arxiv_id":"2204.10921","repositories_listed":1,"syntology":null},{"url":"/paper/broad-recommender-system-an-efficient","slug":"broad-recommender-system-an-efficient","title":"Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach","date":"2022-04-20","arxiv_id":"2204.11602","repositories_listed":1,"syntology":null},{"url":"/paper/multi-level-interaction-reranking-with-user","slug":"multi-level-interaction-reranking-with-user","title":"Multi-Level Interaction Reranking with User Behavior History","date":"2022-04-20","arxiv_id":"2204.09370","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-level-interaction-reranking-with-user#ran","syntology_url":"https://syntology.ai/paper/2204.09370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09370"}},"official":{"repos":["YunjiaXi/Multi-Level-Interaction-Reranking"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/user-centric-conversational-recommendation","slug":"user-centric-conversational-recommendation","title":"User-Centric Conversational Recommendation with Multi-Aspect User Modeling","date":"2022-04-20","arxiv_id":"2204.09263","repositories_listed":1,"syntology":null},{"url":"/paper/autofield-automating-feature-selection-in","slug":"autofield-automating-feature-selection-in","title":"AutoField: Automating Feature Selection in Deep Recommender Systems","date":"2022-04-19","arxiv_id":"2204.09078","repositories_listed":1,"syntology":null},{"url":"/paper/multi-level-cross-view-contrastive-learning","slug":"multi-level-cross-view-contrastive-learning","title":"Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System","date":"2022-04-19","arxiv_id":"2204.08807","repositories_listed":1,"syntology":null},{"url":"/paper/hrcf-enhancing-collaborative-filtering-via","slug":"hrcf-enhancing-collaborative-filtering-via","title":"HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric Regularization","date":"2022-04-18","arxiv_id":"2204.08176","repositories_listed":1,"syntology":null},{"url":"/paper/cpfair-personalized-consumer-and-producer","slug":"cpfair-personalized-consumer-and-producer","title":"CPFair: Personalized Consumer and Producer Fairness Re-ranking for Recommender Systems","date":"2022-04-17","arxiv_id":"2204.08085","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-multi-task-learning-framework-for","slug":"a-unified-multi-task-learning-framework-for","title":"A Unified Multi-task Learning Framework for Multi-goal Conversational Recommender Systems","date":"2022-04-14","arxiv_id":"2204.06923","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-may-not-favor-loyal-users","slug":"recommender-may-not-favor-loyal-users","title":"Do Loyal Users Enjoy Better Recommendations? Understanding Recommender Accuracy from a Time Perspective","date":"2022-04-12","arxiv_id":"2204.05927","repositories_listed":1,"syntology":null},{"url":"/paper/hakg-hierarchy-aware-knowledge-gated-network","slug":"hakg-hierarchy-aware-knowledge-gated-network","title":"HAKG: Hierarchy-Aware Knowledge Gated Network for Recommendation","date":"2022-04-11","arxiv_id":"2204.04959","repositories_listed":1,"syntology":null},{"url":"/paper/picasso-unleashing-the-potential-of-gpu","slug":"picasso-unleashing-the-potential-of-gpu","title":"PICASSO: Unleashing the Potential of GPU-centric Training for Wide-and-deep Recommender Systems","date":"2022-04-11","arxiv_id":"2204.04903","repositories_listed":1,"syntology":null},{"url":"/paper/ia-gcn-interactive-graph-convolutional","slug":"ia-gcn-interactive-graph-convolutional","title":"IA-GCN: Interactive Graph Convolutional Network for Recommendation","date":"2022-04-08","arxiv_id":"2204.03827","repositories_listed":1,"syntology":null},{"url":"/paper/cirs-bursting-filter-bubbles-by","slug":"cirs-bursting-filter-bubbles-by","title":"CIRS: Bursting Filter Bubbles by Counterfactual Interactive Recommender System","date":"2022-04-04","arxiv_id":"2204.01266","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cirs-bursting-filter-bubbles-by#ran","syntology_url":"https://syntology.ai/paper/2204.01266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01266"}},"official":{"repos":["chongminggao/cirs-codes"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/escm-2-entire-space-counterfactual-multi-task","slug":"escm-2-entire-space-counterfactual-multi-task","title":"ESCM$^2$: Entire Space Counterfactual Multi-Task Model for Post-Click Conversion Rate Estimation","date":"2022-04-03","arxiv_id":"2204.05125","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/escm-2-entire-space-counterfactual-multi-task#ran","syntology_url":"https://syntology.ai/paper/2204.05125","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05125"}},"official":null}},{"url":"/paper/virtual-relational-knowledge-graphs-for","slug":"virtual-relational-knowledge-graphs-for","title":"VRKG4Rec: Virtual Relational Knowledge Graphs for Recommendation","date":"2022-04-03","arxiv_id":"2204.01089","repositories_listed":1,"syntology":null},{"url":"/paper/generating-recommendations-for-entity","slug":"generating-recommendations-for-entity","title":"Entity-Centric Query Refinement","date":"2022-04-02","arxiv_id":"2204.00743","repositories_listed":1,"syntology":null},{"url":"/paper/fedrecattack-model-poisoning-attack-to","slug":"fedrecattack-model-poisoning-attack-to","title":"FedRecAttack: Model Poisoning Attack to Federated Recommendation","date":"2022-04-01","arxiv_id":"2204.01499","repositories_listed":1,"syntology":null},{"url":"/paper/i-razor-a-neural-input-razor-for-feature","slug":"i-razor-a-neural-input-razor-for-feature","title":"i-Razor: A Differentiable Neural Input Razor for Feature Selection and Dimension Search in DNN-Based Recommender Systems","date":"2022-04-01","arxiv_id":"2204.00281","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-recommendation-to-cold-start","slug":"cross-domain-recommendation-to-cold-start","title":"Cross-Domain Recommendation to Cold-Start Users via Variational Information Bottleneck","date":"2022-03-31","arxiv_id":"2203.16863","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cross-domain-recommendation-to-cold-start#ran","syntology_url":"https://syntology.ai/paper/2203.16863","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16863"}},"official":{"repos":["cjx96/cdrib"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-learning-for-recommender","slug":"self-supervised-learning-for-recommender","title":"Self-Supervised Learning for Recommender Systems: A Survey","date":"2022-03-29","arxiv_id":"2203.15876","repositories_listed":1,"syntology":null},{"url":"/paper/specialized-document-embeddings-for-aspect","slug":"specialized-document-embeddings-for-aspect","title":"Specialized Document Embeddings for Aspect-based Similarity of Research Papers","date":"2022-03-28","arxiv_id":"2203.14541","repositories_listed":1,"syntology":null},{"url":"/paper/effectively-leveraging-multi-modal-features","slug":"effectively-leveraging-multi-modal-features","title":"Movie Genre Classification by Language Augmentation and Shot Sampling","date":"2022-03-24","arxiv_id":"2203.13281","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-personalized-fitness","slug":"privacy-preserving-personalized-fitness","title":"Privacy-Preserving Personalized Fitness Recommender System (P3FitRec): A Multi-level Deep Learning Approach","date":"2022-03-23","arxiv_id":"2203.12200","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-online-update-of","slug":"meta-learning-for-online-update-of","title":"Meta-Learning for Online Update of Recommender Systems","date":"2022-03-19","arxiv_id":"2203.10354","repositories_listed":1,"syntology":null},{"url":"/paper/arerec-attentive-local-interaction-model-for","slug":"arerec-attentive-local-interaction-model-for","title":"ARERec: Attentive Local Interaction Model for Sequential Recommendation","date":"2022-03-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ranking-social-media-news-feeds-a-comparative","slug":"ranking-social-media-news-feeds-a-comparative","title":"Ranking Social Media News Feeds: A Comparative Study of Personalized and Non-personalized Prediction Models","date":"2022-03-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/balancing-consumer-and-business-value-of","slug":"balancing-consumer-and-business-value-of","title":"Balancing Consumer and Business Value of Recommender Systems: A Simulation-based Analysis","date":"2022-03-10","arxiv_id":"2203.05952","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-multimodal-representation","slug":"disentangled-multimodal-representation","title":"Disentangled Multimodal Representation Learning for Recommendation","date":"2022-03-10","arxiv_id":"2203.05406","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disentangled-multimodal-representation#ran","syntology_url":"https://syntology.ai/paper/2203.05406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05406"}},"official":{"repos":["liufancs/dmrl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-bayesian-optimization","slug":"sparse-bayesian-optimization","title":"Sparse Bayesian Optimization","date":"2022-03-03","arxiv_id":"2203.01900","repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-way-for-cross-market","slug":"an-effective-way-for-cross-market","title":"An Effective Way for Cross-Market Recommendation with Hybrid Pre-Ranking and Ranking Models","date":"2022-03-02","arxiv_id":"2203.00897","repositories_listed":1,"syntology":null},{"url":"/paper/region-or-global-a-principle-for-negative","slug":"region-or-global-a-principle-for-negative","title":"Region or Global? A Principle for Negative Sampling in Graph-based Recommendation","date":"2022-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-unfairness-of-active-users-and-popularity","slug":"the-unfairness-of-active-users-and-popularity","title":"The Unfairness of Active Users and Popularity Bias in Point-of-Interest Recommendation","date":"2022-02-27","arxiv_id":"2202.13307","repositories_listed":1,"syntology":null},{"url":"/paper/learning-over-no-preferred-and-preferred-1","slug":"learning-over-no-preferred-and-preferred-1","title":"Learning over No-Preferred and Preferred Sequence of Items for Robust Recommendation (Extended Abstract)","date":"2022-02-26","arxiv_id":"2202.13240","repositories_listed":1,"syntology":null},{"url":"/paper/a-semi-synthetic-dataset-generation-framework","slug":"a-semi-synthetic-dataset-generation-framework","title":"A Semi-Synthetic Dataset Generation Framework for Causal Inference in Recommender Systems","date":"2022-02-23","arxiv_id":"2202.11351","repositories_listed":1,"syntology":null},{"url":"/paper/tee-based-decentralized-recommender-systems","slug":"tee-based-decentralized-recommender-systems","title":"TEE-based decentralized recommender systems: The raw data sharing redemption","date":"2022-02-23","arxiv_id":"2202.11655","repositories_listed":1,"syntology":null},{"url":"/paper/an-implicit-trust-network-construction","slug":"an-implicit-trust-network-construction","title":"An Implicit Trust-Network construction approach and a Recommendation Methodology for recommender systems","date":"2022-02-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-recommender-system-for-automatic-picking-of","slug":"a-recommender-system-for-automatic-picking-of","title":"A recommender system for automatic picking of subsurface formation tops","date":"2022-02-17","arxiv_id":"2202.08869","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-prompt-learning-for-explainable","slug":"personalized-prompt-learning-for-explainable","title":"Personalized Prompt Learning for Explainable Recommendation","date":"2022-02-15","arxiv_id":"2202.07371","repositories_listed":1,"syntology":null},{"url":"/paper/neural-re-ranking-in-multi-stage-recommender","slug":"neural-re-ranking-in-multi-stage-recommender","title":"Neural Re-ranking in Multi-stage Recommender Systems: A Review","date":"2022-02-14","arxiv_id":"2202.06602","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-re-ranking-in-multi-stage-recommender#ran","syntology_url":"https://syntology.ai/paper/2202.06602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06602"}},"official":{"repos":["librerank-community/librerank"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ua-fedrec-untargeted-attack-on-federated-news","slug":"ua-fedrec-untargeted-attack-on-federated-news","title":"UA-FedRec: Untargeted Attack on Federated News Recommendation","date":"2022-02-14","arxiv_id":"2202.06701","repositories_listed":1,"syntology":null},{"url":"/paper/choices-risks-and-reward-reports-charting","slug":"choices-risks-and-reward-reports-charting","title":"Choices, Risks, and Reward Reports: Charting Public Policy for Reinforcement Learning Systems","date":"2022-02-11","arxiv_id":"2202.05716","repositories_listed":1,"syntology":null},{"url":"/paper/a-model-agnostic-causal-learning-framework","slug":"a-model-agnostic-causal-learning-framework","title":"A Model-Agnostic Causal Learning Framework for Recommendation using Search Data","date":"2022-02-09","arxiv_id":"2202.04514","repositories_listed":1,"syntology":null},{"url":"/paper/causpref-causal-preference-learning-for-out","slug":"causpref-causal-preference-learning-for-out","title":"CausPref: Causal Preference Learning for Out-of-Distribution Recommendation","date":"2022-02-08","arxiv_id":"2202.03984","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-linear-bandits-for-large-scale","slug":"bayesian-linear-bandits-for-large-scale","title":"Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems","date":"2022-02-07","arxiv_id":"2202.03167","repositories_listed":1,"syntology":null}],"record_sha256":"75e15e326d37b99499adf67017b6b5b9ac4274f771eb84cf865d75eeec62ad46","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}