{"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/13","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":13,"pages_in_order":61,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/recommendation-systems/papers/14","papers":[{"url":"/paper/mutually-regularized-dual-collaborative","slug":"mutually-regularized-dual-collaborative","title":"Mutually-Regularized Dual Collaborative Variational Auto-encoder for Recommendation Systems","date":"2022-11-21","arxiv_id":"2211.11662","repositories_listed":1,"syntology":null},{"url":"/paper/dgrec-graph-neural-network-for-recommendation","slug":"dgrec-graph-neural-network-for-recommendation","title":"DGRec: Graph Neural Network for Recommendation with Diversified Embedding Generation","date":"2022-11-18","arxiv_id":"2211.10486","repositories_listed":1,"syntology":null},{"url":"/paper/a-bird-s-eye-view-of-reranking-from-list","slug":"a-bird-s-eye-view-of-reranking-from-list","title":"A Bird's-eye View of Reranking: from List Level to Page Level","date":"2022-11-17","arxiv_id":"2211.09303","repositories_listed":1,"syntology":null},{"url":"/paper/perturbation-recovery-method-for","slug":"perturbation-recovery-method-for","title":"Blurring-Sharpening Process Models for Collaborative Filtering","date":"2022-11-17","arxiv_id":"2211.09324","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/perturbation-recovery-method-for#ran","syntology_url":"https://syntology.ai/paper/2211.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09324"}},"official":{"repos":["jeongwhanchoi/bspm"],"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/adaptkeybert-an-attention-based-approach","slug":"adaptkeybert-an-attention-based-approach","title":"AdaptKeyBERT: An Attention-Based approach towards Few-Shot & Zero-Shot Domain Adaptation of KeyBERT","date":"2022-11-14","arxiv_id":"2211.07499","repositories_listed":1,"syntology":null},{"url":"/paper/metakrec-collaborative-meta-knowledge","slug":"metakrec-collaborative-meta-knowledge","title":"MetaKRec: Collaborative Meta-Knowledge Enhanced Recommender System","date":"2022-11-14","arxiv_id":"2211.07104","repositories_listed":1,"syntology":null},{"url":"/paper/talent-recommendation-on-linkedin-user","slug":"talent-recommendation-on-linkedin-user","title":"Talent Recommendation on LinkedIn User Profiles","date":"2022-11-14","arxiv_id":"2211.07297","repositories_listed":1,"syntology":null},{"url":"/paper/star-a-session-based-time-aware-recommender","slug":"star-a-session-based-time-aware-recommender","title":"STAR: A Session-Based Time-Aware Recommender System","date":"2022-11-11","arxiv_id":"2211.06394","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-graph-transfer-learning-via-item","slug":"debiasing-graph-transfer-learning-via-item","title":"Debiasing Graph Transfer Learning via Item Semantic Clustering for Cross-Domain Recommendations","date":"2022-11-07","arxiv_id":"2211.03390","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-nonlinear-graph-classifiers-in-the","slug":"unlearning-nonlinear-graph-classifiers-in-the","title":"Unlearning Graph Classifiers with Limited Data Resources","date":"2022-11-06","arxiv_id":"2211.03216","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/unlearning-nonlinear-graph-classifiers-in-the#ran","syntology_url":"https://syntology.ai/paper/2211.03216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03216"}},"official":null}},{"url":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","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/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}},"official":{"repos":["ibpa/kglm"],"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/forget-embedding-layers-representation","slug":"forget-embedding-layers-representation","title":"FELRec: Efficient Handling of Item Cold-Start With Dynamic Representation Learning in Recommender Systems","date":"2022-10-30","arxiv_id":"2210.16928","repositories_listed":1,"syntology":null},{"url":"/paper/resus-warm-up-cold-users-via-meta-learning","slug":"resus-warm-up-cold-users-via-meta-learning","title":"RESUS: Warm-Up Cold Users via Meta-Learning Residual User Preferences in CTR Prediction","date":"2022-10-28","arxiv_id":"2210.16080","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-past-future-modeling-in","slug":"disentangling-past-future-modeling-in","title":"Disentangling Past-Future Modeling in Sequential Recommendation via Dual Networks","date":"2022-10-26","arxiv_id":"2210.14577","repositories_listed":1,"syntology":null},{"url":"/paper/reading-between-the-lines-modeling-user","slug":"reading-between-the-lines-modeling-user","title":"Reading Between the Lines: Modeling User Behavior and Costs in AI-Assisted Programming","date":"2022-10-25","arxiv_id":"2210.14306","repositories_listed":1,"syntology":null},{"url":"/paper/learning-vector-quantized-item-representation","slug":"learning-vector-quantized-item-representation","title":"Learning Vector-Quantized Item Representation for Transferable Sequential Recommenders","date":"2022-10-22","arxiv_id":"2210.12316","repositories_listed":1,"syntology":null},{"url":"/paper/towards-human-centered-explainable-ai-user","slug":"towards-human-centered-explainable-ai-user","title":"Towards Human-centered Explainable AI: A Survey of User Studies for Model Explanations","date":"2022-10-20","arxiv_id":"2210.11584","repositories_listed":1,"syntology":null},{"url":"/paper/diversely-regularized-matrix-factorization","slug":"diversely-regularized-matrix-factorization","title":"Diversely Regularized Matrix Factorization for Accurate and Aggregately Diversified Recommendation","date":"2022-10-19","arxiv_id":"2211.01328","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multi-representation-model-for-click","slug":"deep-multi-representation-model-for-click","title":"Deep Multi-Representation Model for Click-Through Rate Prediction","date":"2022-10-18","arxiv_id":"2210.10664","repositories_listed":1,"syntology":null},{"url":"/paper/a-gpu-specialized-inference-parameter-server","slug":"a-gpu-specialized-inference-parameter-server","title":"A GPU-specialized Inference Parameter Server for Large-Scale Deep Recommendation Models","date":"2022-10-17","arxiv_id":"2210.08804","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-gpu-specialized-inference-parameter-server#ran","syntology_url":"https://syntology.ai/paper/2210.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08804"}},"official":{"repos":["nvidia-merlin/hugectr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mdgcf-multi-dependency-graph-collaborative","slug":"mdgcf-multi-dependency-graph-collaborative","title":"MDGCF: Multi-Dependency Graph Collaborative Filtering with Neighborhood- and Homogeneous-level Dependencies","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-the-user-behavior-leakage-from-recommender","slug":"on-the-user-behavior-leakage-from-recommender","title":"On the User Behavior Leakage from Recommender System Exposure","date":"2022-10-16","arxiv_id":"2210.08435","repositories_listed":1,"syntology":null},{"url":"/paper/code-recommendation-for-open-source-software","slug":"code-recommendation-for-open-source-software","title":"Code Recommendation for Open Source Software Developers","date":"2022-10-15","arxiv_id":"2210.08332","repositories_listed":1,"syntology":null},{"url":"/paper/sapling-similarity-outperforms-other-local","slug":"sapling-similarity-outperforms-other-local","title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","date":"2022-10-13","arxiv_id":"2210.07039","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-embedding-tables-without-first","slug":"clustering-embedding-tables-without-first","title":"Clustering the Sketch: A Novel Approach to Embedding Table Compression","date":"2022-10-12","arxiv_id":"2210.05974","repositories_listed":1,"syntology":null},{"url":"/paper/equal-experience-in-recommender-systems-1","slug":"equal-experience-in-recommender-systems-1","title":"Equal Experience in Recommender Systems","date":"2022-10-12","arxiv_id":"2210.05936","repositories_listed":1,"syntology":null},{"url":"/paper/joint-multi-grained-popularity-aware-graph","slug":"joint-multi-grained-popularity-aware-graph","title":"Joint Multi-grained Popularity-aware Graph Convolution Collaborative Filtering for Recommendation","date":"2022-10-10","arxiv_id":"2210.04614","repositories_listed":1,"syntology":null},{"url":"/paper/topicvae-topic-aware-disentanglement","slug":"topicvae-topic-aware-disentanglement","title":"TopicVAE: Topic-aware Disentanglement Representation Learning for Enhanced Recommendation","date":"2022-10-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kernel-based-substructure-exploration-for","slug":"kernel-based-substructure-exploration-for","title":"Kernel-based Substructure Exploration for Next POI Recommendation","date":"2022-10-08","arxiv_id":"2210.03969","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-graph-representation-learning-with-1","slug":"empowering-graph-representation-learning-with-1","title":"Empowering Graph Representation Learning with Test-Time Graph Transformation","date":"2022-10-07","arxiv_id":"2210.03561","repositories_listed":1,"syntology":null},{"url":"/paper/why-should-i-choose-you-autoxai-a-framework","slug":"why-should-i-choose-you-autoxai-a-framework","title":"Why Should I Choose You? AutoXAI: A Framework for Selecting and Tuning eXplainable AI Solutions","date":"2022-10-06","arxiv_id":"2210.02795","repositories_listed":1,"syntology":null},{"url":"/paper/dreamshard-generalizable-embedding-table","slug":"dreamshard-generalizable-embedding-table","title":"DreamShard: Generalizable Embedding Table Placement for Recommender Systems","date":"2022-10-05","arxiv_id":"2210.02023","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dreamshard-generalizable-embedding-table#ran","syntology_url":"https://syntology.ai/paper/2210.02023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02023"}},"official":{"repos":["daochenzha/dreamshard"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/resbemf-improving-prediction-coverage-of","slug":"resbemf-improving-prediction-coverage-of","title":"Restricted Bernoulli Matrix Factorization: Balancing the trade-off between prediction accuracy and coverage in classification based collaborative filtering","date":"2022-10-05","arxiv_id":"2210.10619","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-large-scale-synthetic-graph","slug":"a-framework-for-large-scale-synthetic-graph","title":"A Framework for Large Scale Synthetic Graph Dataset Generation","date":"2022-10-04","arxiv_id":"2210.01944","repositories_listed":1,"syntology":null},{"url":"/paper/the-long-tail-of-context-does-it-exist-and","slug":"the-long-tail-of-context-does-it-exist-and","title":"The Long Tail of Context: Does it Exist and Matter?","date":"2022-10-03","arxiv_id":"2210.01023","repositories_listed":1,"syntology":null},{"url":"/paper/the-minority-matters-a-diversity-promoting","slug":"the-minority-matters-a-diversity-promoting","title":"The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm","date":"2022-09-30","arxiv_id":"2209.15292","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-on-device-session-based","slug":"efficient-on-device-session-based","title":"Efficient On-Device Session-Based Recommendation","date":"2022-09-27","arxiv_id":"2209.13422","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-synthetic-data-generation","slug":"privacy-preserving-synthetic-data-generation","title":"Privacy-Preserving Synthetic Data Generation for Recommendation Systems","date":"2022-09-27","arxiv_id":"2209.13133","repositories_listed":1,"syntology":null},{"url":"/paper/bounded-simplex-structured-matrix","slug":"bounded-simplex-structured-matrix","title":"Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and Applications","date":"2022-09-26","arxiv_id":"2209.12638","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-and-leveraging-prerequisite-context","slug":"modeling-and-leveraging-prerequisite-context","title":"Modeling and Leveraging Prerequisite Context in Recommendation","date":"2022-09-23","arxiv_id":"2209.11471","repositories_listed":1,"syntology":null},{"url":"/paper/closing-the-gender-wage-gap-adversarial","slug":"closing-the-gender-wage-gap-adversarial","title":"Closing the Gender Wage Gap: Adversarial Fairness in Job Recommendation","date":"2022-09-20","arxiv_id":"2209.09592","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-vicious-attacks-on-graph-neural","slug":"sparse-vicious-attacks-on-graph-neural","title":"Sparse Vicious Attacks on Graph Neural Networks","date":"2022-09-20","arxiv_id":"2209.09688","repositories_listed":1,"syntology":null},{"url":"/paper/pfeddef-defending-grey-box-attacks-for","slug":"pfeddef-defending-grey-box-attacks-for","title":"Characterizing Internal Evasion Attacks in Federated Learning","date":"2022-09-17","arxiv_id":"2209.08412","repositories_listed":1,"syntology":null},{"url":"/paper/parsrec-explainable-personalized-attention","slug":"parsrec-explainable-personalized-attention","title":"PARSRec: Explainable Personalized Attention-fused Recurrent Sequential Recommendation Using Session Partial Actions","date":"2022-09-16","arxiv_id":"2209.13015","repositories_listed":1,"syntology":null},{"url":"/paper/serialized-interacting-mixed-membership","slug":"serialized-interacting-mixed-membership","title":"Serialized Interacting Mixed Membership Stochastic Block Model","date":"2022-09-16","arxiv_id":"2209.07813","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-learning-from-next-item-sequential","slug":"beyond-learning-from-next-item-sequential","title":"Beyond Learning from Next Item: Sequential Recommendation via Personalized Interest Sustainability","date":"2022-09-14","arxiv_id":"2209.06644","repositories_listed":1,"syntology":null},{"url":"/paper/some-other-poor-soul-s-problems-a-peer","slug":"some-other-poor-soul-s-problems-a-peer","title":"Peer Recommendation Interventions for Health-related Social Support: a Feasibility Assessment","date":"2022-09-12","arxiv_id":"2209.04973","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-recommendation-reasoning","slug":"reinforcement-recommendation-reasoning","title":"Reinforcement Recommendation Reasoning through Knowledge Graphs for Explanation Path Quality","date":"2022-09-11","arxiv_id":"2209.04954","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-based-deep-learning-for-modeling","slug":"knowledge-based-deep-learning-for-modeling","title":"Knowledge-based Deep Learning for Modeling Chaotic Systems","date":"2022-09-09","arxiv_id":"2209.04259","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-the-effect-of-sampling-in-gnns-on","slug":"analyzing-the-effect-of-sampling-in-gnns-on","title":"Analyzing the Effect of Sampling in GNNs on Individual Fairness","date":"2022-09-08","arxiv_id":"2209.03904","repositories_listed":1,"syntology":null},{"url":"/paper/w-transformers-a-wavelet-based-transformer","slug":"w-transformers-a-wavelet-based-transformer","title":"W-Transformers : A Wavelet-based Transformer Framework for Univariate Time Series Forecasting","date":"2022-09-08","arxiv_id":"2209.03945","repositories_listed":1,"syntology":null},{"url":"/paper/decoding-demographic-un-fairness-from-indian","slug":"decoding-demographic-un-fairness-from-indian","title":"Decoding Demographic un-fairness from Indian Names","date":"2022-09-07","arxiv_id":"2209.03089","repositories_listed":1,"syntology":null},{"url":"/paper/infact-an-online-human-evaluation-framework","slug":"infact-an-online-human-evaluation-framework","title":"INFACT: An Online Human Evaluation Framework for Conversational Recommendation","date":"2022-09-07","arxiv_id":"2209.03213","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-attentional-neural-network","slug":"knowledge-aware-attentional-neural-network","title":"Knowledge-aware attentional neural network for review-based movie recommendation with explanations","date":"2022-09-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-understanding-the-overfitting","slug":"towards-understanding-the-overfitting","title":"Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Models","date":"2022-09-04","arxiv_id":"2209.06053","repositories_listed":1,"syntology":null},{"url":"/paper/federated-online-clustering-of-bandits","slug":"federated-online-clustering-of-bandits","title":"Federated Online Clustering of Bandits","date":"2022-08-31","arxiv_id":"2208.14865","repositories_listed":1,"syntology":null},{"url":"/paper/one-class-recommendation-systems-with-the","slug":"one-class-recommendation-systems-with-the","title":"One-class Recommendation Systems with the Hinge Pairwise Distance Loss and Orthogonal Representations","date":"2022-08-31","arxiv_id":"2208.14594","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-conversational-recommendations-is","slug":"rethinking-conversational-recommendations-is","title":"Rethinking Conversational Recommendations: Is Decision Tree All You Need?","date":"2022-08-31","arxiv_id":"2208.14614","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-diversity-in-session-based","slug":"understanding-diversity-in-session-based","title":"Understanding Diversity in Session-Based Recommendation","date":"2022-08-29","arxiv_id":"2208.13453","repositories_listed":1,"syntology":null},{"url":"/paper/contrastvae-contrastive-variational","slug":"contrastvae-contrastive-variational","title":"ContrastVAE: Contrastive Variational AutoEncoder for Sequential Recommendation","date":"2022-08-27","arxiv_id":"2209.00456","repositories_listed":1,"syntology":null},{"url":"/paper/causal-inference-in-recommender-systems-a","slug":"causal-inference-in-recommender-systems-a","title":"Causal Inference in Recommender Systems: A Survey and Future Directions","date":"2022-08-26","arxiv_id":"2208.12397","repositories_listed":1,"syntology":null},{"url":"/paper/svd-gcn-a-simplified-graph-convolution","slug":"svd-gcn-a-simplified-graph-convolution","title":"SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendation","date":"2022-08-26","arxiv_id":"2208.12689","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-causal-collaborative-filtering","slug":"dynamic-causal-collaborative-filtering","title":"Dynamic Causal Collaborative Filtering","date":"2022-08-23","arxiv_id":"2208.11094","repositories_listed":1,"syntology":null},{"url":"/paper/jointly-learning-propagating-features-on-the","slug":"jointly-learning-propagating-features-on-the","title":"Jointly Learning Propagating Features on the Knowledge Graph for Movie Recommendation","date":"2022-08-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/comparison-based-conversational-recommender","slug":"comparison-based-conversational-recommender","title":"Comparison-based Conversational Recommender System with Relative Bandit Feedback","date":"2022-08-21","arxiv_id":"2208.09837","repositories_listed":1,"syntology":null},{"url":"/paper/towards-principled-user-side-recommender","slug":"towards-principled-user-side-recommender","title":"Towards Principled User-side Recommender Systems","date":"2022-08-21","arxiv_id":"2208.09864","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-principled-user-side-recommender#ran","syntology_url":"https://syntology.ai/paper/2208.09864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.09864"}},"official":{"repos":["joisino/consul"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-session-contexts-for-next-item","slug":"implicit-session-contexts-for-next-item","title":"Implicit Session Contexts for Next-Item Recommendations","date":"2022-08-18","arxiv_id":"2208.09076","repositories_listed":1,"syntology":null},{"url":"/paper/kuairand-an-unbiased-sequential","slug":"kuairand-an-unbiased-sequential","title":"KuaiRand: An Unbiased Sequential Recommendation Dataset with Randomly Exposed Videos","date":"2022-08-18","arxiv_id":"2208.08696","repositories_listed":1,"syntology":null},{"url":"/paper/brain-topography-adaptive-network-for","slug":"brain-topography-adaptive-network-for","title":"Brain Topography Adaptive Network for Satisfaction Modeling in Interactive Information Access System","date":"2022-08-17","arxiv_id":"2208.08097","repositories_listed":1,"syntology":null},{"url":"/paper/re4-learning-to-re-contrast-re-attend-re","slug":"re4-learning-to-re-contrast-re-attend-re","title":"Re4: Learning to Re-contrast, Re-attend, Re-construct for Multi-interest Recommendation","date":"2022-08-17","arxiv_id":"2208.08011","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-action-recommendation-for-smart-home","slug":"accurate-action-recommendation-for-smart-home","title":"Accurate Action Recommendation for Smart Home via Two-Level Encoders and Commonsense Knowledge","date":"2022-08-12","arxiv_id":"2208.06089","repositories_listed":1,"syntology":null},{"url":"/paper/autoshard-automated-embedding-table-sharding","slug":"autoshard-automated-embedding-table-sharding","title":"AutoShard: Automated Embedding Table Sharding for Recommender Systems","date":"2022-08-12","arxiv_id":"2208.06399","repositories_listed":1,"syntology":null},{"url":"/paper/dvr-micro-video-recommendation-optimizing","slug":"dvr-micro-video-recommendation-optimizing","title":"DVR: Micro-Video Recommendation Optimizing Watch-Time-Gain under Duration Bias","date":"2022-08-10","arxiv_id":"2208.05190","repositories_listed":1,"syntology":null},{"url":"/paper/optembed-learning-optimal-embedding-table-for","slug":"optembed-learning-optimal-embedding-table-for","title":"OptEmbed: Learning Optimal Embedding Table for Click-through Rate Prediction","date":"2022-08-09","arxiv_id":"2208.04482","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/optembed-learning-optimal-embedding-table-for#ran","syntology_url":"https://syntology.ai/paper/2208.04482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04482"}},"official":{"repos":["fuyuanlyu/optembed"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/inspired2-an-improved-dataset-for-sociable","slug":"inspired2-an-improved-dataset-for-sociable","title":"INSPIRED2: An Improved Dataset for Sociable Conversational Recommendation","date":"2022-08-08","arxiv_id":"2208.04104","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-attentive-memory-network-for-click","slug":"sparse-attentive-memory-network-for-click","title":"Sparse Attentive Memory Network for Click-through Rate Prediction with Long Sequences","date":"2022-08-08","arxiv_id":"2208.04022","repositories_listed":1,"syntology":null},{"url":"/paper/croloss-towards-a-customizable-loss-for","slug":"croloss-towards-a-customizable-loss-for","title":"CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systems","date":"2022-08-05","arxiv_id":"2208.02971","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/croloss-towards-a-customizable-loss-for#ran","syntology_url":"https://syntology.ai/paper/2208.02971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.02971"}},"official":{"repos":["WDdeBWT/CROLoss"],"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/nrbdmf-a-recommendation-algorithm-for","slug":"nrbdmf-a-recommendation-algorithm-for","title":"NRBdMF: A recommendation algorithm for predicting drug effects considering directionality","date":"2022-08-05","arxiv_id":"2208.04312","repositories_listed":1,"syntology":null},{"url":"/paper/streaming-algorithms-for-diversity","slug":"streaming-algorithms-for-diversity","title":"Streaming Algorithms for Diversity Maximization with Fairness Constraints","date":"2022-07-30","arxiv_id":"2208.00194","repositories_listed":1,"syntology":null},{"url":"/paper/improving-few-shot-news-recommendation-via","slug":"improving-few-shot-news-recommendation-via","title":"Few-shot News Recommendation via Cross-lingual Transfer","date":"2022-07-28","arxiv_id":"2207.14370","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-hypergraph-transformer-for","slug":"self-supervised-hypergraph-transformer-for","title":"Self-Supervised Hypergraph Transformer for Recommender Systems","date":"2022-07-28","arxiv_id":"2207.14338","repositories_listed":1,"syntology":null},{"url":"/paper/victor-visual-incompatibility-detection-with","slug":"victor-visual-incompatibility-detection-with","title":"VICTOR: Visual Incompatibility Detection with Transformers and Fashion-specific contrastive pre-training","date":"2022-07-27","arxiv_id":"2207.13458","repositories_listed":1,"syntology":null},{"url":"/paper/bilateral-self-unbiased-learning-from-biased","slug":"bilateral-self-unbiased-learning-from-biased","title":"Bilateral Self-unbiased Learning from Biased Implicit Feedback","date":"2022-07-26","arxiv_id":"2207.12660","repositories_listed":1,"syntology":null},{"url":"/paper/bundle-mcr-towards-conversational-bundle","slug":"bundle-mcr-towards-conversational-bundle","title":"Bundle MCR: Towards Conversational Bundle Recommendation","date":"2022-07-26","arxiv_id":"2207.12628","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-impact-of-temporal-bias-in","slug":"exploring-the-impact-of-temporal-bias-in","title":"Exploring the Impact of Temporal Bias in Point-of-Interest Recommendation","date":"2022-07-23","arxiv_id":"2207.11609","repositories_listed":1,"syntology":null},{"url":"/paper/defending-substitution-based-profile","slug":"defending-substitution-based-profile","title":"Defending Substitution-Based Profile Pollution Attacks on Sequential Recommenders","date":"2022-07-19","arxiv_id":"2207.11237","repositories_listed":1,"syntology":null},{"url":"/paper/hicf-hyperbolic-informative-collaborative","slug":"hicf-hyperbolic-informative-collaborative","title":"HICF: Hyperbolic Informative Collaborative Filtering","date":"2022-07-19","arxiv_id":"2207.09051","repositories_listed":1,"syntology":null},{"url":"/paper/every-preference-changes-differently-neural","slug":"every-preference-changes-differently-neural","title":"Everyone's Preference Changes Differently: Weighted Multi-Interest Retrieval Model","date":"2022-07-14","arxiv_id":"2207.06652","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":6,"n_ran_checked":9,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"14 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/every-preference-changes-differently-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06652"}},"official":{"repos":["shihui2010/mip"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":6,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-scalable-recommendation-via","slug":"efficient-and-scalable-recommendation-via","title":"Fine-tuning Partition-aware Item Similarities for Efficient and Scalable Recommendation","date":"2022-07-13","arxiv_id":"2207.05959","repositories_listed":1,"syntology":null},{"url":"/paper/the-impact-of-feature-quantity-on","slug":"the-impact-of-feature-quantity-on","title":"The Impact of Feature Quantity on Recommendation Algorithm Performance: A Movielens-100K Case Study","date":"2022-07-13","arxiv_id":"2207.08713","repositories_listed":1,"syntology":null},{"url":"/paper/contextual-bandits-with-smooth-regret","slug":"contextual-bandits-with-smooth-regret","title":"Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces","date":"2022-07-12","arxiv_id":"2207.05849","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contextual-bandits-with-smooth-regret#ran","syntology_url":"https://syntology.ai/paper/2207.05849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05849"}},"official":{"repos":["pmineiro/smoothcb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/evalrs-a-rounded-evaluation-of-recommender","slug":"evalrs-a-rounded-evaluation-of-recommender","title":"EvalRS: a Rounded Evaluation of Recommender Systems","date":"2022-07-12","arxiv_id":"2207.05772","repositories_listed":1,"syntology":null},{"url":"/paper/an-approach-to-ensure-fairness-in-news","slug":"an-approach-to-ensure-fairness-in-news","title":"An Approach to Ensure Fairness in News Articles","date":"2022-07-08","arxiv_id":"2207.03938","repositories_listed":1,"syntology":null},{"url":"/paper/evolution-of-popularity-bias-empirical-study","slug":"evolution-of-popularity-bias-empirical-study","title":"Evolution of Popularity Bias: Empirical Study and Debiasing","date":"2022-07-07","arxiv_id":"2207.03372","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-combinatorial-bandits-balancing","slug":"interactive-combinatorial-bandits-balancing","title":"Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback","date":"2022-07-07","arxiv_id":"2207.03091","repositories_listed":1,"syntology":null},{"url":"/paper/effective-and-efficient-training-for","slug":"effective-and-efficient-training-for","title":"Effective and Efficient Training for Sequential Recommendation using Recency Sampling","date":"2022-07-06","arxiv_id":"2207.02643","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-model-for-next","slug":"sequential-recommendation-model-for-next","title":"Sequential Recommendation Model for Next Purchase Prediction","date":"2022-07-06","arxiv_id":"2207.06225","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-ranking-and-translation","slug":"dynamic-ranking-and-translation","title":"Dynamic Ranking and Translation Synchronization","date":"2022-07-04","arxiv_id":"2207.01455","repositories_listed":1,"syntology":null},{"url":"/paper/collaboration-aware-graph-convolutional","slug":"collaboration-aware-graph-convolutional","title":"Collaboration-Aware Graph Convolutional Network for Recommender Systems","date":"2022-07-03","arxiv_id":"2207.06221","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/collaboration-aware-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/2207.06221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06221"}},"official":{"repos":["yuwvandy/cagcn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/modelling-users-with-item-metadata-for","slug":"modelling-users-with-item-metadata-for","title":"Modelling Users with Item Metadata for Explainable and Interactive Recommendation","date":"2022-07-01","arxiv_id":"2207.00350","repositories_listed":1,"syntology":null}],"record_sha256":"315bf0f8cc3cafb11ce18ddd69845bede845bd853ebec358910c8c057240a6ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}