{"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/16","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":16,"pages_in_order":61,"rows_per_page":100,"rows":[1501,1600],"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/15","next":"/task/recommendation-systems/papers/17","papers":[{"url":"/paper/generating-self-contained-and-summary-centric","slug":"generating-self-contained-and-summary-centric","title":"Generating Self-Contained and Summary-Centric Question Answer Pairs via Differentiable Reward Imitation Learning","date":"2021-09-10","arxiv_id":"2109.04689","repositories_listed":1,"syntology":null},{"url":"/paper/dual-correction-strategy-for-ranking","slug":"dual-correction-strategy-for-ranking","title":"Dual Correction Strategy for Ranking Distillation in Top-N Recommender System","date":"2021-09-08","arxiv_id":"2109.03459","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/dual-correction-strategy-for-ranking#ran","syntology_url":"https://syntology.ai/paper/2109.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.03459"}},"official":{"repos":["dudwns511/dcd_cikm21"],"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/towards-retrieval-based-conversational","slug":"towards-retrieval-based-conversational","title":"Towards Retrieval-based Conversational Recommendation","date":"2021-09-06","arxiv_id":"2109.02311","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-recommendation-with-cross","slug":"self-supervised-recommendation-with-cross","title":"Motifs-based Recommender System via Hypergraph Convolution and Contrastive Learning","date":"2021-09-02","arxiv_id":"2109.00676","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-attacks-on-sequential-recommenders","slug":"black-box-attacks-on-sequential-recommenders","title":"Black-Box Attacks on Sequential Recommenders via Data-Free Model Extraction","date":"2021-09-01","arxiv_id":"2109.01165","repositories_listed":1,"syntology":null},{"url":"/paper/multi-sample-based-contrastive-loss-for-top-k","slug":"multi-sample-based-contrastive-loss-for-top-k","title":"Multi-Sample based Contrastive Loss for Top-k Recommendation","date":"2021-09-01","arxiv_id":"2109.00217","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-data-fusion-in-high-dimensional","slug":"multimodal-data-fusion-in-high-dimensional","title":"Multimodal Data Fusion in High-Dimensional Heterogeneous Datasets via Generative Models","date":"2021-08-27","arxiv_id":"2108.12445","repositories_listed":1,"syntology":null},{"url":"/paper/dskreg-differentiable-sampling-on-knowledge","slug":"dskreg-differentiable-sampling-on-knowledge","title":"DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN","date":"2021-08-26","arxiv_id":"2108.11883","repositories_listed":1,"syntology":null},{"url":"/paper/cmml-contextual-modulation-meta-learning-for","slug":"cmml-contextual-modulation-meta-learning-for","title":"CMML: Contextual Modulation Meta Learning for Cold-Start Recommendation","date":"2021-08-24","arxiv_id":"2108.10511","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-using-many-to-many-rnns-for","slug":"data-augmentation-using-many-to-many-rnns-for","title":"Data Augmentation Using Many-To-Many RNNs for Session-Aware Recommender Systems","date":"2021-08-22","arxiv_id":"2108.09858","repositories_listed":1,"syntology":null},{"url":"/paper/a-recommender-system-for-scientific-datasets","slug":"a-recommender-system-for-scientific-datasets","title":"A Recommender System for Scientific Datasets and Analysis Pipelines","date":"2021-08-20","arxiv_id":"2108.09275","repositories_listed":1,"syntology":null},{"url":"/paper/siren-sign-aware-recommendation-using-graph","slug":"siren-sign-aware-recommendation-using-graph","title":"SiReN: Sign-Aware Recommendation Using Graph Neural Networks","date":"2021-08-19","arxiv_id":"2108.08735","repositories_listed":1,"syntology":null},{"url":"/paper/causal-incremental-graph-convolution-for","slug":"causal-incremental-graph-convolution-for","title":"Causal Incremental Graph Convolution for Recommender System Retraining","date":"2021-08-16","arxiv_id":"2108.06889","repositories_listed":1,"syntology":null},{"url":"/paper/a-dual-augmented-two-tower-model-for-online","slug":"a-dual-augmented-two-tower-model-for-online","title":"A Dual Augmented Two-tower Model for Online Large-scale Recommendation","date":"2021-08-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-trend-networks-for-recommendations","slug":"graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","arxiv_id":"2108.05552","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/graph-trend-networks-for-recommendations#ran","syntology_url":"https://syntology.ai/paper/2108.05552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05552"}},"official":{"repos":["wenqifan03/gtn-sigir2022"],"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/retrieval-interaction-machine-for-tabular","slug":"retrieval-interaction-machine-for-tabular","title":"Retrieval & Interaction Machine for Tabular Data Prediction","date":"2021-08-11","arxiv_id":"2108.05252","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-user-behavior-retrieval-in-click","slug":"end-to-end-user-behavior-retrieval-in-click","title":"End-to-End User Behavior Retrieval in Click-Through RatePrediction Model","date":"2021-08-10","arxiv_id":"2108.04468","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-music-relistening-behavior-using","slug":"predicting-music-relistening-behavior-using","title":"Predicting Music Relistening Behavior Using the ACT-R Framework","date":"2021-08-04","arxiv_id":"2108.02138","repositories_listed":1,"syntology":null},{"url":"/paper/memorize-factorize-or-be-naive-learning","slug":"memorize-factorize-or-be-naive-learning","title":"Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction","date":"2021-08-03","arxiv_id":"2108.01265","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/memorize-factorize-or-be-naive-learning#ran","syntology_url":"https://syntology.ai/paper/2108.01265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01265"}},"official":{"repos":["fuyuanlyu/OptInter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-lottery-ticket-hypothesis-in-media","slug":"exploring-lottery-ticket-hypothesis-in-media","title":"Exploring Lottery Ticket Hypothesis in Media Recommender Systems","date":"2021-08-02","arxiv_id":"2108.00944","repositories_listed":1,"syntology":null},{"url":"/paper/personal-bias-in-prediction-of-emotions","slug":"personal-bias-in-prediction-of-emotions","title":"Personal Bias in Prediction of Emotions Elicited by Textual Opinions","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sequence-adaptation-via-reinforcement","slug":"sequence-adaptation-via-reinforcement","title":"Sequence Adaptation via Reinforcement Learning in Recommender Systems","date":"2021-07-31","arxiv_id":"2108.01442","repositories_listed":1,"syntology":null},{"url":"/paper/simple-fast-and-flexible-framework-for-matrix","slug":"simple-fast-and-flexible-framework-for-matrix","title":"Simple, Fast, and Flexible Framework for Matrix Completion with Infinite Width Neural Networks","date":"2021-07-31","arxiv_id":"2108.00131","repositories_listed":1,"syntology":null},{"url":"/paper/debiased-explainable-pairwise-ranking-from","slug":"debiased-explainable-pairwise-ranking-from","title":"Debiased Explainable Pairwise Ranking from Implicit Feedback","date":"2021-07-30","arxiv_id":"2107.14768","repositories_listed":1,"syntology":null},{"url":"/paper/deep-variational-models-for-collaborative","slug":"deep-variational-models-for-collaborative","title":"Deep Variational Models for Collaborative Filtering-based Recommender Systems","date":"2021-07-27","arxiv_id":"2107.12677","repositories_listed":1,"syntology":null},{"url":"/paper/from-implicit-to-explicit-feedback-a-deep","slug":"from-implicit-to-explicit-feedback-a-deep","title":"From Implicit to Explicit feedback: A deep neural network for modeling sequential behaviours and long-short term preferences of online users","date":"2021-07-26","arxiv_id":"2107.12325","repositories_listed":1,"syntology":null},{"url":"/paper/t-recs-a-simulation-tool-to-study-the","slug":"t-recs-a-simulation-tool-to-study-the","title":"T-RECS: A Simulation Tool to Study the Societal Impact of Recommender Systems","date":"2021-07-19","arxiv_id":"2107.08959","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-learning-for-cold-start","slug":"contrastive-learning-for-cold-start","title":"Contrastive Learning for Cold-Start Recommendation","date":"2021-07-12","arxiv_id":"2107.05315","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-representation-based-graph","slug":"inductive-representation-based-graph","title":"INMO: A Model-Agnostic and Scalable Module for Inductive Collaborative Filtering","date":"2021-07-12","arxiv_id":"2107.05247","repositories_listed":1,"syntology":null},{"url":"/paper/prgan-personalized-recommendation-with","slug":"prgan-personalized-recommendation-with","title":"PRGAN: Personalized Recommendation with Conditional Generative Adversarial Networks","date":"2021-07-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-proxy-selection-for-session","slug":"unsupervised-proxy-selection-for-session","title":"Unsupervised Proxy Selection for Session-based Recommender Systems","date":"2021-07-08","arxiv_id":"2107.03564","repositories_listed":1,"syntology":null},{"url":"/paper/neural-contextual-bandits-without-regret","slug":"neural-contextual-bandits-without-regret","title":"Neural Contextual Bandits without Regret","date":"2021-07-07","arxiv_id":"2107.03144","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/neural-contextual-bandits-without-regret#ran","syntology_url":"https://syntology.ai/paper/2107.03144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03144"}},"official":{"repos":["pkassraie/NNUCB"],"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/causalrec-causal-inference-for-visual","slug":"causalrec-causal-inference-for-visual","title":"CausalRec: Causal Inference for Visual Debiasing in Visually-Aware Recommendation","date":"2021-07-06","arxiv_id":"2107.02390","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/causalrec-causal-inference-for-visual#ran","syntology_url":"https://syntology.ai/paper/2107.02390","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02390"}},"official":{"repos":["RuihongQiu/cornac"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/improved-representation-learning-for-session","slug":"improved-representation-learning-for-session","title":"Introducing Self-Attention to Target Attentive Graph Neural Networks","date":"2021-07-04","arxiv_id":"2107.01516","repositories_listed":1,"syntology":null},{"url":"/paper/how-will-i-argue-a-dataset-for-evaluating","slug":"how-will-i-argue-a-dataset-for-evaluating","title":"How Will I Argue? A Dataset for Evaluating Recommender Systems for Argumentations","date":"2021-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-availability-and-discovery-in","slug":"quantifying-availability-and-discovery-in","title":"Quantifying Availability and Discovery in Recommender Systems via Stochastic Reachability","date":"2021-06-30","arxiv_id":"2107.00833","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/quantifying-availability-and-discovery-in#ran","syntology_url":"https://syntology.ai/paper/2107.00833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00833"}},"official":{"repos":["modestyachts/stochastic-rec-reachability"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graphconfrec-a-graph-neural-network-based","slug":"graphconfrec-a-graph-neural-network-based","title":"GraphConfRec: A Graph Neural Network-Based Conference Recommender System","date":"2021-06-23","arxiv_id":"2106.12340","repositories_listed":1,"syntology":null},{"url":"/paper/disenhan-disentangled-heterogeneous-graph","slug":"disenhan-disentangled-heterogeneous-graph","title":"DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendation","date":"2021-06-21","arxiv_id":"2106.10879","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-review-on-non-neural-networks","slug":"a-comprehensive-review-on-non-neural-networks","title":"A Comprehensive Review on Non-Neural Networks Collaborative Filtering Recommendation Systems","date":"2021-06-20","arxiv_id":"2106.10679","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-path-representation-learning","slug":"unsupervised-path-representation-learning","title":"Unsupervised Path Representation Learning with Curriculum Negative Sampling","date":"2021-06-17","arxiv_id":"2106.09373","repositories_listed":1,"syntology":null},{"url":"/paper/control-variates-for-slate-off-policy","slug":"control-variates-for-slate-off-policy","title":"Control Variates for Slate Off-Policy Evaluation","date":"2021-06-15","arxiv_id":"2106.07914","repositories_listed":1,"syntology":null},{"url":"/paper/correcting-exposure-bias-for-link","slug":"correcting-exposure-bias-for-link","title":"Correcting Exposure Bias for Link Recommendation","date":"2021-06-13","arxiv_id":"2106.07041","repositories_listed":1,"syntology":null},{"url":"/paper/deep-reinforcement-learning-based-group","slug":"deep-reinforcement-learning-based-group","title":"Deep Reinforcement Learning based Group Recommender System","date":"2021-06-13","arxiv_id":"2106.06900","repositories_listed":1,"syntology":null},{"url":"/paper/deep-position-wise-interaction-network-for","slug":"deep-position-wise-interaction-network-for","title":"Deep Position-wise Interaction Network for CTR Prediction","date":"2021-06-10","arxiv_id":"2106.05482","repositories_listed":1,"syntology":null},{"url":"/paper/mindreader-recommendation-over-knowledge","slug":"mindreader-recommendation-over-knowledge","title":"MindReader: Recommendation over Knowledge Graph Entities with Explicit User Ratings","date":"2021-06-08","arxiv_id":"2106.04209","repositories_listed":1,"syntology":null},{"url":"/paper/multi-output-gaussian-processes-for-1","slug":"multi-output-gaussian-processes-for-1","title":"Multi-output Gaussian Processes for Uncertainty-aware Recommender Systems","date":"2021-06-08","arxiv_id":"2106.04221","repositories_listed":1,"syntology":null},{"url":"/paper/review-polarity-wise-recommender","slug":"review-polarity-wise-recommender","title":"Review Polarity-wise Recommender","date":"2021-06-08","arxiv_id":"2106.04155","repositories_listed":1,"syntology":null},{"url":"/paper/a-semi-personalized-system-for-user-cold","slug":"a-semi-personalized-system-for-user-cold","title":"A Semi-Personalized System for User Cold Start Recommendation on Music Streaming Apps","date":"2021-06-07","arxiv_id":"2106.03819","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-periodicity-and-interactivity-in","slug":"exploring-periodicity-and-interactivity-in","title":"Exploring Periodicity and Interactivity in Multi-Interest Framework for Sequential Recommendation","date":"2021-06-07","arxiv_id":"2106.04415","repositories_listed":1,"syntology":null},{"url":"/paper/socially-aware-self-supervised-tri-training","slug":"socially-aware-self-supervised-tri-training","title":"Socially-Aware Self-Supervised Tri-Training for Recommendation","date":"2021-06-07","arxiv_id":"2106.03569","repositories_listed":1,"syntology":null},{"url":"/paper/multi-facet-contextual-bandits-a-neural","slug":"multi-facet-contextual-bandits-a-neural","title":"Multi-facet Contextual Bandits: A Neural Network Perspective","date":"2021-06-06","arxiv_id":"2106.03039","repositories_listed":1,"syntology":null},{"url":"/paper/bidirectional-distillation-for-top-k","slug":"bidirectional-distillation-for-top-k","title":"Bidirectional Distillation for Top-K Recommender System","date":"2021-06-05","arxiv_id":"2106.02870","repositories_listed":1,"syntology":null},{"url":"/paper/dual-attentive-sequential-learning-for-cross","slug":"dual-attentive-sequential-learning-for-cross","title":"Dual Attentive Sequential Learning for Cross-Domain Click-Through Rate Prediction","date":"2021-06-05","arxiv_id":"2106.02768","repositories_listed":1,"syntology":null},{"url":"/paper/purs-personalized-unexpected-recommender","slug":"purs-personalized-unexpected-recommender","title":"PURS: Personalized Unexpected Recommender System for Improving User Satisfaction","date":"2021-06-05","arxiv_id":"2106.02771","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-inference-for-sparse-extreme","slug":"accelerating-inference-for-sparse-extreme","title":"Enterprise-Scale Search: Accelerating Inference for Sparse Extreme Multi-Label Ranking Trees","date":"2021-06-04","arxiv_id":"2106.02697","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-virtual-kernel-experts-for-multi","slug":"mixture-of-virtual-kernel-experts-for-multi","title":"Mixture of Virtual-Kernel Experts for Multi-Objective User Profile Modeling","date":"2021-06-04","arxiv_id":"2106.07356","repositories_listed":1,"syntology":null},{"url":"/paper/new-insights-into-metric-optimization-for","slug":"new-insights-into-metric-optimization-for","title":"New Insights into Metric Optimization for Ranking-based Recommendation","date":"2021-06-04","arxiv_id":"2106.02545","repositories_listed":1,"syntology":null},{"url":"/paper/jizhi-a-fast-and-cost-effective-model-as-a","slug":"jizhi-a-fast-and-cost-effective-model-as-a","title":"JIZHI: A Fast and Cost-Effective Model-As-A-Service System for Web-Scale Online Inference at Baidu","date":"2021-06-03","arxiv_id":"2106.01674","repositories_listed":1,"syntology":null},{"url":"/paper/invariant-policy-learning-a-causal","slug":"invariant-policy-learning-a-causal","title":"Invariant Policy Learning: A Causal Perspective","date":"2021-06-01","arxiv_id":"2106.00808","repositories_listed":1,"syntology":null},{"url":"/paper/zipf-matrix-factorization-matrix","slug":"zipf-matrix-factorization-matrix","title":"Zipf Matrix Factorization : Matrix Factorization with Matthew Effect Reduction","date":"2021-06-01","arxiv_id":"2106.07347","repositories_listed":1,"syntology":null},{"url":"/paper/generating-interesting-song-to-song-segues","slug":"generating-interesting-song-to-song-segues","title":"Generating Interesting Song-to-Song Segues With Dave","date":"2021-05-31","arxiv_id":"2105.14909","repositories_listed":1,"syntology":null},{"url":"/paper/enumerating-fair-packages-for-group","slug":"enumerating-fair-packages-for-group","title":"Enumerating Fair Packages for Group Recommendations","date":"2021-05-30","arxiv_id":"2105.14423","repositories_listed":1,"syntology":null},{"url":"/paper/enhanced-doubly-robust-learning-for-debiasing","slug":"enhanced-doubly-robust-learning-for-debiasing","title":"Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimation","date":"2021-05-28","arxiv_id":"2105.13623","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/enhanced-doubly-robust-learning-for-debiasing#ran","syntology_url":"https://syntology.ai/paper/2105.13623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13623"}},"official":{"repos":["guosyjlu/MRDR-DL"],"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/private-recommender-systems-how-can-users","slug":"private-recommender-systems-how-can-users","title":"Private Recommender Systems: How Can Users Build Their Own Fair Recommender Systems without Log Data?","date":"2021-05-26","arxiv_id":"2105.12353","repositories_listed":1,"syntology":null},{"url":"/paper/submodular-kernels-for-efficient-rankings","slug":"submodular-kernels-for-efficient-rankings","title":"The Graph Cut Kernel for Ranked Data","date":"2021-05-26","arxiv_id":"2105.12356","repositories_listed":1,"syntology":null},{"url":"/paper/criterion-based-heterogeneous-collaborative","slug":"criterion-based-heterogeneous-collaborative","title":"Criterion-based Heterogeneous Collaborative Filtering for Multi-behavior Implicit Recommendation","date":"2021-05-25","arxiv_id":"2105.11876","repositories_listed":1,"syntology":null},{"url":"/paper/deconfounded-recommendation-for-alleviating","slug":"deconfounded-recommendation-for-alleviating","title":"Deconfounded Recommendation for Alleviating Bias Amplification","date":"2021-05-22","arxiv_id":"2105.10648","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-ratings-in-multi-criteria","slug":"predicting-ratings-in-multi-criteria","title":"Predicting ratings in multi-criteria recommender systems via a collective factor model","date":"2021-05-21","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-personalized-fairness-based-on-causal","slug":"towards-personalized-fairness-based-on-causal","title":"Personalized Counterfactual Fairness in Recommendation","date":"2021-05-20","arxiv_id":"2105.09829","repositories_listed":1,"syntology":null},{"url":"/paper/where-are-we-in-embedding-spaces-a","slug":"where-are-we-in-embedding-spaces-a","title":"Where are we in embedding spaces? A Comprehensive Analysis on Network Embedding Approaches for Recommender Systems","date":"2021-05-19","arxiv_id":"2105.08908","repositories_listed":1,"syntology":null},{"url":"/paper/dcap-deep-cross-attentional-product-network","slug":"dcap-deep-cross-attentional-product-network","title":"DCAP: Deep Cross Attentional Product Network for User Response Prediction","date":"2021-05-18","arxiv_id":"2105.08649","repositories_listed":1,"syntology":null},{"url":"/paper/recpipe-co-designing-models-and-hardware-to","slug":"recpipe-co-designing-models-and-hardware-to","title":"RecPipe: Co-designing Models and Hardware to Jointly Optimize Recommendation Quality and Performance","date":"2021-05-18","arxiv_id":"2105.08820","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-explainable-1-bit-matrix","slug":"scalable-and-explainable-1-bit-matrix","title":"Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning","date":"2021-05-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/choice-set-confounding-in-discrete-choice","slug":"choice-set-confounding-in-discrete-choice","title":"Choice Set Confounding in Discrete Choice","date":"2021-05-17","arxiv_id":"2105.07959","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-variational-bandwidth-auto","slug":"collaborative-variational-bandwidth-auto","title":"Variational Bandwidth Auto-encoder for Hybrid Recommender Systems","date":"2021-05-17","arxiv_id":"2105.07597","repositories_listed":1,"syntology":null},{"url":"/paper/a-methodology-for-the-offline-evaluation-of","slug":"a-methodology-for-the-offline-evaluation-of","title":"A Methodology for the Offline Evaluation of Recommender Systems in a User Interface with Multiple Carousels","date":"2021-05-13","arxiv_id":"2105.06275","repositories_listed":1,"syntology":null},{"url":"/paper/causal-intervention-for-leveraging-popularity","slug":"causal-intervention-for-leveraging-popularity","title":"Causal Intervention for Leveraging Popularity Bias in Recommendation","date":"2021-05-13","arxiv_id":"2105.06067","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/causal-intervention-for-leveraging-popularity#ran","syntology_url":"https://syntology.ai/paper/2105.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.06067"}},"official":{"repos":["zyang1580/PDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-learning-based-recommender-systems-a","slug":"graph-learning-based-recommender-systems-a","title":"Graph Learning based Recommender Systems: A Review","date":"2021-05-13","arxiv_id":"2105.06339","repositories_listed":1,"syntology":null},{"url":"/paper/looking-at-ctr-prediction-again-is-attention","slug":"looking-at-ctr-prediction-again-is-attention","title":"Looking at CTR Prediction Again: Is Attention All You Need?","date":"2021-05-12","arxiv_id":"2105.05563","repositories_listed":1,"syntology":null},{"url":"/paper/autodebias-learning-to-debias-for","slug":"autodebias-learning-to-debias-for","title":"AutoDebias: Learning to Debias for Recommendation","date":"2021-05-10","arxiv_id":"2105.04170","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/autodebias-learning-to-debias-for#ran","syntology_url":"https://syntology.ai/paper/2105.04170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04170"}},"official":{"repos":["DongHande/AutoDebias"],"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/neural-graph-matching-based-collaborative","slug":"neural-graph-matching-based-collaborative","title":"Neural Graph Matching based Collaborative Filtering","date":"2021-05-10","arxiv_id":"2105.04067","repositories_listed":1,"syntology":null},{"url":"/paper/ugrec-modeling-directed-and-undirected","slug":"ugrec-modeling-directed-and-undirected","title":"UGRec: Modeling Directed and Undirected Relations for Recommendation","date":"2021-05-10","arxiv_id":"2105.04183","repositories_listed":1,"syntology":null},{"url":"/paper/generative-actor-critic-an-off-policy","slug":"generative-actor-critic-an-off-policy","title":"Generative Actor-Critic: An Off-policy Algorithm Using the Push-forward Model","date":"2021-05-08","arxiv_id":"2105.03733","repositories_listed":1,"syntology":null},{"url":"/paper/graphformers-gnn-nested-language-models-for","slug":"graphformers-gnn-nested-language-models-for","title":"GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graph","date":"2021-05-06","arxiv_id":"2105.02605","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphformers-gnn-nested-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2105.02605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02605"}},"official":{"repos":["microsoft/graphformers"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bias-in-knowledge-graphs-an-empirical-study","slug":"bias-in-knowledge-graphs-an-empirical-study","title":"Bias in Knowledge Graphs -- an Empirical Study with Movie Recommendation and Different Language Editions of DBpedia","date":"2021-05-03","arxiv_id":"2105.00674","repositories_listed":1,"syntology":null},{"url":"/paper/learning-heterogeneous-temporal-patterns-of","slug":"learning-heterogeneous-temporal-patterns-of","title":"Learning Heterogeneous Temporal Patterns of User Preference for Timely Recommendation","date":"2021-04-29","arxiv_id":"2104.14200","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-document-representations-for","slug":"evaluating-document-representations-for","title":"Evaluating Document Representations for Content-based Legal Literature Recommendations","date":"2021-04-28","arxiv_id":"2104.13841","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-neural-recommendation-from","slug":"a-survey-on-neural-recommendation-from","title":"A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendation","date":"2021-04-27","arxiv_id":"2104.13030","repositories_listed":1,"syntology":null},{"url":"/paper/attention-on-global-local-embedding-spaces-in","slug":"attention-on-global-local-embedding-spaces-in","title":"Attention on Global-Local Representation Spaces in Recommender Systems","date":"2021-04-25","arxiv_id":"2104.12050","repositories_listed":1,"syntology":null},{"url":"/paper/xcrossnet-feature-structure-oriented-learning","slug":"xcrossnet-feature-structure-oriented-learning","title":"XCrossNet: Feature Structure-Oriented Learning for Click-Through Rate Prediction","date":"2021-04-22","arxiv_id":"2104.10907","repositories_listed":1,"syntology":null},{"url":"/paper/user-oriented-fairness-in-recommendation","slug":"user-oriented-fairness-in-recommendation","title":"User-oriented Fairness in Recommendation","date":"2021-04-21","arxiv_id":"2104.10671","repositories_listed":1,"syntology":null},{"url":"/paper/mining-latent-structures-for-multimedia","slug":"mining-latent-structures-for-multimedia","title":"Mining Latent Structures for Multimedia Recommendation","date":"2021-04-19","arxiv_id":"2104.09036","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mining-latent-structures-for-multimedia#ran","syntology_url":"https://syntology.ai/paper/2104.09036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09036"}},"official":{"repos":["CRIPAC-DIG/LATTICE"],"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/the-simpson-s-paradox-in-the-offline","slug":"the-simpson-s-paradox-in-the-offline","title":"The Simpson's Paradox in the Offline Evaluation of Recommendation Systems","date":"2021-04-18","arxiv_id":"2104.08912","repositories_listed":1,"syntology":null},{"url":"/paper/dual-metric-learning-for-effective-and","slug":"dual-metric-learning-for-effective-and","title":"Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations","date":"2021-04-17","arxiv_id":"2104.08490","repositories_listed":1,"syntology":null},{"url":"/paper/faithfully-explainable-recommendation-via","slug":"faithfully-explainable-recommendation-via","title":"Faithfully Explainable Recommendation via Neural Logic Reasoning","date":"2021-04-16","arxiv_id":"2104.07869","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/faithfully-explainable-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/2104.07869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07869"}},"official":{"repos":["orcax/LOGER"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-adversarial-imitation-click-model-for","slug":"an-adversarial-imitation-click-model-for","title":"An Adversarial Imitation Click Model for Information Retrieval","date":"2021-04-13","arxiv_id":"2104.06077","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-instability-of-embeddings-for","slug":"on-the-instability-of-embeddings-for","title":"On the instability of embeddings for recommender systems: the case of Matrix Factorization","date":"2021-04-12","arxiv_id":"2104.05796","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-modeling-of-user-preferences-for","slug":"dynamic-modeling-of-user-preferences-for","title":"Dynamic Modeling of User Preferences for Stable Recommendations","date":"2021-04-11","arxiv_id":"2104.05047","repositories_listed":1,"syntology":null},{"url":"/paper/humor-iitk-at-semeval-2021-task-7-large","slug":"humor-iitk-at-semeval-2021-task-7-large","title":"Humor@IITK at SemEval-2021 Task 7: Large Language Models for Quantifying Humor and Offensiveness","date":"2021-04-02","arxiv_id":"2104.00933","repositories_listed":1,"syntology":null},{"url":"/paper/multi-facet-recommender-networks-with","slug":"multi-facet-recommender-networks-with","title":"Multi-Facet Recommender Networks with Spherical Optimization","date":"2021-03-27","arxiv_id":"2103.14866","repositories_listed":1,"syntology":null}],"record_sha256":"dc30f751e33bc4f3412acabb274a5daa4d1efb5e64b7ec0ed2ee7faa43748293","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}