{"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/15","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":15,"pages_in_order":61,"rows_per_page":100,"rows":[1401,1500],"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/14","next":"/task/recommendation-systems/papers/16","papers":[{"url":"/paper/large-scale-personalized-video-game","slug":"large-scale-personalized-video-game","title":"Large-scale Personalized Video Game Recommendation via Social-aware Contextualized Graph Neural Network","date":"2022-02-07","arxiv_id":"2202.03392","repositories_listed":1,"syntology":null},{"url":"/paper/triangle-graph-interest-network-for-click","slug":"triangle-graph-interest-network-for-click","title":"Triangle Graph Interest Network for Click-through Rate Prediction","date":"2022-02-06","arxiv_id":"2202.02698","repositories_listed":1,"syntology":null},{"url":"/paper/rewiring-what-to-watch-next-recommendations","slug":"rewiring-what-to-watch-next-recommendations","title":"Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways","date":"2022-02-01","arxiv_id":"2202.00640","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-collaborative-filtering-via-tensor","slug":"consistent-collaborative-filtering-via-tensor","title":"Consistent Collaborative Filtering via Tensor Decomposition","date":"2022-01-28","arxiv_id":"2201.11936","repositories_listed":1,"syntology":null},{"url":"/paper/efficiently-maintaining-next-basket","slug":"efficiently-maintaining-next-basket","title":"Efficiently Maintaining Next Basket Recommendations under Additions and Deletions of Baskets and Items","date":"2022-01-27","arxiv_id":"2201.13313","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-dynamic-and-static","slug":"graph-neural-networks-with-dynamic-and-static","title":"Graph Neural Networks with Dynamic and Static Representations for Social Recommendation","date":"2022-01-26","arxiv_id":"2201.10751","repositories_listed":1,"syntology":null},{"url":"/paper/explainability-in-music-recommender-systems","slug":"explainability-in-music-recommender-systems","title":"Explainability in Music Recommender Systems","date":"2022-01-25","arxiv_id":"2201.10528","repositories_listed":1,"syntology":null},{"url":"/paper/consumer-fairness-in-recommender-systems","slug":"consumer-fairness-in-recommender-systems","title":"Consumer Fairness in Recommender Systems: Contextualizing Definitions and Mitigations","date":"2022-01-21","arxiv_id":"2201.08614","repositories_listed":1,"syntology":null},{"url":"/paper/improved-random-features-for-dot-product","slug":"improved-random-features-for-dot-product","title":"Improved Random Features for Dot Product Kernels","date":"2022-01-21","arxiv_id":"2201.08712","repositories_listed":1,"syntology":null},{"url":"/paper/gan-based-matrix-factorization-for","slug":"gan-based-matrix-factorization-for","title":"GAN-based Matrix Factorization for Recommender Systems","date":"2022-01-20","arxiv_id":"2201.08042","repositories_listed":1,"syntology":null},{"url":"/paper/emergent-instabilities-in-algorithmic","slug":"emergent-instabilities-in-algorithmic","title":"Emergent Instabilities in Algorithmic Feedback Loops","date":"2022-01-18","arxiv_id":"2201.07203","repositories_listed":1,"syntology":null},{"url":"/paper/recommendation-unlearning","slug":"recommendation-unlearning","title":"Recommendation Unlearning","date":"2022-01-18","arxiv_id":"2201.06820","repositories_listed":1,"syntology":null},{"url":"/paper/deep-unified-representation-for-heterogeneous","slug":"deep-unified-representation-for-heterogeneous","title":"Deep Unified Representation for Heterogeneous Recommendation","date":"2022-01-15","arxiv_id":"2201.05861","repositories_listed":1,"syntology":null},{"url":"/paper/on-sampling-collaborative-filtering-datasets","slug":"on-sampling-collaborative-filtering-datasets","title":"On Sampling Collaborative Filtering Datasets","date":"2022-01-13","arxiv_id":"2201.04768","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/on-sampling-collaborative-filtering-datasets#ran","syntology_url":"https://syntology.ai/paper/2201.04768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.04768"}},"official":{"repos":["noveens/sampling_cf"],"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/rgrecsys-a-toolkit-for-robustness-evaluation","slug":"rgrecsys-a-toolkit-for-robustness-evaluation","title":"RGRecSys: A Toolkit for Robustness Evaluation of Recommender Systems","date":"2022-01-12","arxiv_id":"2201.04399","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-reflection-augmented","slug":"collaborative-reflection-augmented","title":"Collaborative Reflection-Augmented Autoencoder Network for Recommender Systems","date":"2022-01-10","arxiv_id":"2201.03158","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-social-influence-based-on-users","slug":"leveraging-social-influence-based-on-users","title":"Leveraging Social Influence based on Users Activity Centers for Point-of-Interest Recommendation","date":"2022-01-10","arxiv_id":"2201.03450","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-enhanced-recommendation-with","slug":"multi-behavior-enhanced-recommendation-with","title":"Multi-Behavior Enhanced Recommendation with Cross-Interaction Collaborative Relation Modeling","date":"2022-01-07","arxiv_id":"2201.02307","repositories_listed":1,"syntology":null},{"url":"/paper/deep-causal-reasoning-for-recommendations","slug":"deep-causal-reasoning-for-recommendations","title":"Deep Causal Reasoning for Recommendations","date":"2022-01-06","arxiv_id":"2201.02088","repositories_listed":1,"syntology":null},{"url":"/paper/c2-crs-coarse-to-fine-contrastive-learning","slug":"c2-crs-coarse-to-fine-contrastive-learning","title":"C2-CRS: Coarse-to-Fine Contrastive Learning for Conversational Recommender System","date":"2022-01-04","arxiv_id":"2201.02732","repositories_listed":1,"syntology":null},{"url":"/paper/s-walk-accurate-and-scalable-session-based","slug":"s-walk-accurate-and-scalable-session-based","title":"S-Walk: Accurate and Scalable Session-based Recommendationwith Random Walks","date":"2022-01-04","arxiv_id":"2201.01091","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-compilation-of-dnn-training","slug":"context-aware-compilation-of-dnn-training","title":"Context-Aware Compilation of DNN Training Pipelines across Edge and Cloud","date":"2021-12-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-communication","slug":"graph-neural-networks-for-communication","title":"Graph Neural Networks for Communication Networks: Context, Use Cases and Opportunities","date":"2021-12-29","arxiv_id":"2112.14792","repositories_listed":1,"syntology":null},{"url":"/paper/same-scenario-adaptive-mixture-of-experts-for","slug":"same-scenario-adaptive-mixture-of-experts-for","title":"MOEF: Modeling Occasion Evolution in Frequency Domain for Promotion-Aware Click-Through Rate Prediction","date":"2021-12-27","arxiv_id":"2112.13747","repositories_listed":1,"syntology":null},{"url":"/paper/dualgnn-dual-graph-neural-network-for","slug":"dualgnn-dual-graph-neural-network-for","title":"DualGNN: Dual Graph Neural Network for Multimedia Recommendation","date":"2021-12-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/decision-support-system-for-distributed","slug":"decision-support-system-for-distributed","title":"Decision support system for distributed manufacturing based on input-output analysis and economic complexity","date":"2021-12-23","arxiv_id":"2201.00694","repositories_listed":1,"syntology":null},{"url":"/paper/graph-few-shot-class-incremental-learning","slug":"graph-few-shot-class-incremental-learning","title":"Graph Few-shot Class-incremental Learning","date":"2021-12-23","arxiv_id":"2112.12819","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":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) · 1 unverified","sample_list":"/paper/graph-few-shot-class-incremental-learning#ran","syntology_url":"https://syntology.ai/paper/2112.12819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.12819"}},"official":{"repos":["zhen-tan-dmml/gfcil"],"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/robust-recommendation-with-implicit-feedback","slug":"robust-recommendation-with-implicit-feedback","title":"Robust Recommendation with Implicit Feedback via Eliminating the Effects of Unexpected Behaviors","date":"2021-12-21","arxiv_id":"2112.11023","repositories_listed":1,"syntology":null},{"url":"/paper/degreembed-incorporating-entity-embedding","slug":"degreembed-incorporating-entity-embedding","title":"DegreEmbed: incorporating entity embedding into logic rule learning for knowledge graph reasoning","date":"2021-12-18","arxiv_id":"2112.09933","repositories_listed":1,"syntology":null},{"url":"/paper/graph-augmentation-free-contrastive-learning","slug":"graph-augmentation-free-contrastive-learning","title":"Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendation","date":"2021-12-16","arxiv_id":"2112.08679","repositories_listed":1,"syntology":null},{"url":"/paper/improving-conversational-recommendation-1","slug":"improving-conversational-recommendation-1","title":"Improving Conversational Recommendation Systems' Quality with Context-Aware Item Meta Information","date":"2021-12-15","arxiv_id":"2112.08140","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-examples-for-extreme-multilabel","slug":"adversarial-examples-for-extreme-multilabel","title":"Adversarial Examples for Extreme Multilabel Text Classification","date":"2021-12-14","arxiv_id":"2112.07512","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-with-bidirectional","slug":"sequential-recommendation-with-bidirectional","title":"Improving Sequential Recommendations via Bidirectional Temporal Data Augmentation with Pre-training","date":"2021-12-13","arxiv_id":"2112.06460","repositories_listed":1,"syntology":null},{"url":"/paper/leaping-through-time-with-gradient-based","slug":"leaping-through-time-with-gradient-based","title":"Leaping Through Time with Gradient-based Adaptation for Recommendation","date":"2021-12-11","arxiv_id":"2112.05914","repositories_listed":1,"syntology":null},{"url":"/paper/how-private-is-your-rl-policy-an-inverse-rl","slug":"how-private-is-your-rl-policy-an-inverse-rl","title":"How Private Is Your RL Policy? An Inverse RL Based Analysis Framework","date":"2021-12-10","arxiv_id":"2112.05495","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-adaptive-distributed-training-on","slug":"end-to-end-adaptive-distributed-training-on","title":"End-to-end Adaptive Distributed Training on PaddlePaddle","date":"2021-12-06","arxiv_id":"2112.02752","repositories_listed":1,"syntology":null},{"url":"/paper/fleetx","slug":"fleetx","title":"FleetX","date":"2021-12-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exploring-and-mitigating-gender-bias-in","slug":"exploring-and-mitigating-gender-bias-in","title":"Exploring and Mitigating Gender Bias in Recommender Systems with Explicit Feedback","date":"2021-12-05","arxiv_id":"2112.02530","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploring-and-mitigating-gender-bias-in#ran","syntology_url":"https://syntology.ai/paper/2112.02530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02530"}},"official":{"repos":["venomnomnom/genderbias"],"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/given-users-recommendations-based-on-reviews","slug":"given-users-recommendations-based-on-reviews","title":"Given Users Recommendations Based on Reviews on Yelp","date":"2021-12-03","arxiv_id":"2112.01762","repositories_listed":1,"syntology":null},{"url":"/paper/graph4rec-a-universal-toolkit-with-graph","slug":"graph4rec-a-universal-toolkit-with-graph","title":"Graph4Rec: A Universal Toolkit with Graph Neural Networks for Recommender Systems","date":"2021-12-02","arxiv_id":"2112.01035","repositories_listed":1,"syntology":null},{"url":"/paper/learning-robust-recommender-from-noisy","slug":"learning-robust-recommender-from-noisy","title":"Learning Robust Recommender from Noisy Implicit Feedback","date":"2021-12-02","arxiv_id":"2112.01160","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-online-bayesian-inference-for","slug":"efficient-online-bayesian-inference-for","title":"Efficient Online Bayesian Inference for Neural Bandits","date":"2021-12-01","arxiv_id":"2112.00195","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-online-bayesian-inference-for#ran","syntology_url":"https://syntology.ai/paper/2112.00195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00195"}},"official":{"repos":["probml/bandits"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-optimal-algorithm-for-finding-champions-in","slug":"an-optimal-algorithm-for-finding-champions-in","title":"An Optimal Algorithm for Finding Champions in Tournament Graphs","date":"2021-11-26","arxiv_id":"2111.13621","repositories_listed":1,"syntology":null},{"url":"/paper/soliciting-user-preferences-in-conversational","slug":"soliciting-user-preferences-in-conversational","title":"Generating Usage-related Questions for Preference Elicitation in Conversational Recommender Systems","date":"2021-11-26","arxiv_id":"2111.13463","repositories_listed":1,"syntology":null},{"url":"/paper/unbiased-pairwise-learning-to-rank-in","slug":"unbiased-pairwise-learning-to-rank-in","title":"Unbiased Pairwise Learning to Rank in Recommender Systems","date":"2021-11-25","arxiv_id":"2111.12929","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-feature-ranking-via-attribute","slug":"unsupervised-feature-ranking-via-attribute","title":"Unsupervised Feature Ranking via Attribute Networks","date":"2021-11-25","arxiv_id":"2111.13273","repositories_listed":1,"syntology":null},{"url":"/paper/it-is-different-when-items-are-older","slug":"it-is-different-when-items-are-older","title":"It Is Different When Items Are Older: Debiasing Recommendations When Selection Bias and User Preferences Are Dynamic","date":"2021-11-24","arxiv_id":"2111.12481","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/it-is-different-when-items-are-older#ran","syntology_url":"https://syntology.ai/paper/2111.12481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12481"}},"official":{"repos":["betsyhj/dancer"],"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/learning-explicit-user-interest-boundary-for","slug":"learning-explicit-user-interest-boundary-for","title":"Learning Explicit User Interest Boundary for Recommendation","date":"2021-11-22","arxiv_id":"2111.11026","repositories_listed":1,"syntology":null},{"url":"/paper/paddlerec","slug":"paddlerec","title":"PaddleRec","date":"2021-11-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/recguru-adversarial-learning-of-generalized","slug":"recguru-adversarial-learning-of-generalized","title":"RecGURU: Adversarial Learning of Generalized User Representations for Cross-Domain Recommendation","date":"2021-11-19","arxiv_id":"2111.10093","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recguru-adversarial-learning-of-generalized#ran","syntology_url":"https://syntology.ai/paper/2111.10093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.10093"}},"official":{"repos":["chain123/recguru"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-return-parity-in-markov-decision","slug":"towards-return-parity-in-markov-decision","title":"Towards Return Parity in Markov Decision Processes","date":"2021-11-19","arxiv_id":"2111.10476","repositories_listed":1,"syntology":null},{"url":"/paper/study-of-keyword-extraction-techniques-for","slug":"study-of-keyword-extraction-techniques-for","title":"Study of keyword extraction techniques for Electric Double Layer Capacitor domain using text similarity indexes: An experimental analysis","date":"2021-11-13","arxiv_id":"2111.07068","repositories_listed":1,"syntology":null},{"url":"/paper/persia-a-hybrid-system-scaling-deep-learning","slug":"persia-a-hybrid-system-scaling-deep-learning","title":"Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameters","date":"2021-11-10","arxiv_id":"2111.05897","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/persia-a-hybrid-system-scaling-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2111.05897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05897"}},"official":{"repos":["persiaml/persia"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-an-adaptive-meta-model-generator-for","slug":"learning-an-adaptive-meta-model-generator-for","title":"Learning an Adaptive Meta Model-Generator for Incrementally Updating Recommender Systems","date":"2021-11-08","arxiv_id":"2111.04282","repositories_listed":1,"syntology":null},{"url":"/paper/ghrs-graph-based-hybrid-recommendation-system","slug":"ghrs-graph-based-hybrid-recommendation-system","title":"GHRS: Graph-based Hybrid Recommendation System with Application to Movie Recommendation","date":"2021-11-06","arxiv_id":"2111.11293","repositories_listed":1,"syntology":null},{"url":"/paper/finn-no-slates-dataset-a-new-sequential","slug":"finn-no-slates-dataset-a-new-sequential","title":"FINN.no Slates Dataset: A new Sequential Dataset Logging Interactions, allViewed Items and Click Responses/No-Click for Recommender Systems Research","date":"2021-11-05","arxiv_id":"2111.03340","repositories_listed":1,"syntology":null},{"url":"/paper/the-impact-of-batch-learning-in-stochastic","slug":"the-impact-of-batch-learning-in-stochastic","title":"The Impact of Batch Learning in Stochastic Bandits","date":"2021-11-03","arxiv_id":"2111.02071","repositories_listed":1,"syntology":null},{"url":"/paper/dealing-with-misspecification-in-fixed","slug":"dealing-with-misspecification-in-fixed","title":"Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification","date":"2021-11-02","arxiv_id":"2111.01479","repositories_listed":1,"syntology":null},{"url":"/paper/it-doesnt-look-good-for-a-date-transforming","slug":"it-doesnt-look-good-for-a-date-transforming","title":"“It doesn’t look good for a date”: Transforming Critiques into Preferences for Conversational Recommendation Systems","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kers-a-knowledge-enhanced-framework-for","slug":"kers-a-knowledge-enhanced-framework-for","title":"KERS: A Knowledge-Enhanced Framework for Recommendation Dialog Systems with Multiple Subgoals","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-personal-food-preferences-via-food","slug":"learning-personal-food-preferences-via-food","title":"Learning Personal Food Preferences via Food Logs Embedding","date":"2021-10-29","arxiv_id":"2110.15498","repositories_listed":1,"syntology":null},{"url":"/paper/privacy-preserving-multi-target-multi-domain","slug":"privacy-preserving-multi-target-multi-domain","title":"Decentralized Multi-Target Cross-Domain Recommendation for Multi-Organization Collaborations","date":"2021-10-26","arxiv_id":"2110.13340","repositories_listed":1,"syntology":null},{"url":"/paper/learning-speaker-representation-with-semi","slug":"learning-speaker-representation-with-semi","title":"Learning Speaker Representation with Semi-supervised Learning approach for Speaker Profiling","date":"2021-10-24","arxiv_id":"2110.13653","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-transfer-of-user-preferences-for","slug":"personalized-transfer-of-user-preferences-for","title":"Personalized Transfer of User Preferences for Cross-domain Recommendation","date":"2021-10-21","arxiv_id":"2110.11154","repositories_listed":1,"syntology":null},{"url":"/paper/propensity-scored-probabilistic-label-trees","slug":"propensity-scored-probabilistic-label-trees","title":"Propensity-scored Probabilistic Label Trees","date":"2021-10-20","arxiv_id":"2110.10803","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/propensity-scored-probabilistic-label-trees#ran","syntology_url":"https://syntology.ai/paper/2110.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10803"}},"official":{"repos":["mwydmuch/napkinXC"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/show-me-the-whole-world-towards-entire-item","slug":"show-me-the-whole-world-towards-entire-item","title":"Show Me the Whole World: Towards Entire Item Space Exploration for Interactive Personalized Recommendations","date":"2021-10-19","arxiv_id":"2110.09905","repositories_listed":1,"syntology":null},{"url":"/paper/rl4rs-a-real-world-benchmark-for","slug":"rl4rs-a-real-world-benchmark-for","title":"RL4RS: A Real-World Dataset for Reinforcement Learning based Recommender System","date":"2021-10-18","arxiv_id":"2110.11073","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-feedbacks-are-not-always-favorable","slug":"implicit-feedbacks-are-not-always-favorable","title":"Implicit Feedbacks are Not Always Favorable: Iterative Relabeled One-Class Collaborative Filtering against Noisy Interactions","date":"2021-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-meta-path-aware-embeddings-for","slug":"learning-meta-path-aware-embeddings-for","title":"Learning Meta-path-aware Embeddings for Recommender Systems","date":"2021-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-with-learnable-1","slug":"graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","arxiv_id":"2110.07875","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-networks-with-learnable-1#ran","syntology_url":"https://syntology.ai/paper/2110.07875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07875"}},"official":{"repos":["vijaydwivedi75/gnn-lspe"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deconfounded-causal-collaborative-filtering","slug":"deconfounded-causal-collaborative-filtering","title":"Deconfounded Causal Collaborative Filtering","date":"2021-10-14","arxiv_id":"2110.07122","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-enhanced-sampling-for","slug":"knowledge-graph-enhanced-sampling-for","title":"Knowledge Graph-enhanced Sampling for Conversational Recommender System","date":"2021-10-13","arxiv_id":"2110.06637","repositories_listed":1,"syntology":null},{"url":"/paper/user-experiences-oriented-sightseeing-spot","slug":"user-experiences-oriented-sightseeing-spot","title":"Recommending POIs for Tourists by User Behavior Modeling and Pseudo-Rating","date":"2021-10-13","arxiv_id":"2110.06523","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-for-recommender-systems","slug":"feature-selection-for-recommender-systems","title":"Feature Selection for Recommender Systems with Quantum Computing","date":"2021-10-11","arxiv_id":"2110.05089","repositories_listed":1,"syntology":null},{"url":"/paper/global-context-enhanced-social-recommendation","slug":"global-context-enhanced-social-recommendation","title":"Global Context Enhanced Social Recommendation with Hierarchical Graph Neural Networks","date":"2021-10-08","arxiv_id":"2110.04039","repositories_listed":1,"syntology":null},{"url":"/paper/graph-meta-network-for-multi-behavior","slug":"graph-meta-network-for-multi-behavior","title":"Graph Meta Network for Multi-Behavior Recommendation","date":"2021-10-08","arxiv_id":"2110.03969","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-coupled-graph-neural-network","slug":"knowledge-aware-coupled-graph-neural-network","title":"Knowledge-aware Coupled Graph Neural Network for Social Recommendation","date":"2021-10-08","arxiv_id":"2110.03987","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enhanced-hierarchical-graph","slug":"knowledge-enhanced-hierarchical-graph","title":"Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation","date":"2021-10-08","arxiv_id":"2110.04000","repositories_listed":1,"syntology":null},{"url":"/paper/multiplex-behavioral-relation-learning-for","slug":"multiplex-behavioral-relation-learning-for","title":"Multiplex Behavioral Relation Learning for Recommendation via Memory Augmented Transformer Network","date":"2021-10-08","arxiv_id":"2110.04002","repositories_listed":1,"syntology":null},{"url":"/paper/social-recommendation-with-self-supervised","slug":"social-recommendation-with-self-supervised","title":"Social Recommendation with Self-Supervised Metagraph Informax Network","date":"2021-10-08","arxiv_id":"2110.03958","repositories_listed":1,"syntology":null},{"url":"/paper/optimized-recommender-systems-with-deep","slug":"optimized-recommender-systems-with-deep","title":"Optimized Recommender Systems with Deep Reinforcement Learning","date":"2021-10-06","arxiv_id":"2110.03039","repositories_listed":1,"syntology":null},{"url":"/paper/an-energy-based-model-for-neuro-symbolic","slug":"an-energy-based-model-for-neuro-symbolic","title":"An energy-based model for neuro-symbolic reasoning on knowledge graphs","date":"2021-10-04","arxiv_id":"2110.01639","repositories_listed":1,"syntology":null},{"url":"/paper/fast-multi-resolution-transformer-fine-tuning","slug":"fast-multi-resolution-transformer-fine-tuning","title":"Fast Multi-Resolution Transformer Fine-tuning for Extreme Multi-label Text Classification","date":"2021-10-01","arxiv_id":"2110.00685","repositories_listed":1,"syntology":null},{"url":"/paper/causal-matrix-completion","slug":"causal-matrix-completion","title":"Causal Matrix Completion","date":"2021-09-30","arxiv_id":"2109.15154","repositories_listed":1,"syntology":null},{"url":"/paper/know-your-action-set-learning-action","slug":"know-your-action-set-learning-action","title":"Know Your Action Set: Learning Action Relations for Reinforcement Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/boost-rs-boosted-embeddings-for-recommender","slug":"boost-rs-boosted-embeddings-for-recommender","title":"Boost-RS: Boosted Embeddings for Recommender Systems and its Application to Enzyme-Substrate Interaction Prediction","date":"2021-09-28","arxiv_id":"2109.14766","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-ranking-with-the-btl-model-a-nearest","slug":"dynamic-ranking-with-the-btl-model-a-nearest","title":"Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method","date":"2021-09-28","arxiv_id":"2109.13743","repositories_listed":1,"syntology":null},{"url":"/paper/simplex-a-simple-and-strong-baseline-for","slug":"simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","arxiv_id":"2109.12613","repositories_listed":1,"syntology":null},{"url":"/paper/learning-neural-templates-for-recommender","slug":"learning-neural-templates-for-recommender","title":"Learning Neural Templates for Recommender Dialogue System","date":"2021-09-25","arxiv_id":"2109.12302","repositories_listed":1,"syntology":null},{"url":"/paper/learning-through-structure-towards-deep","slug":"learning-through-structure-towards-deep","title":"Learning through structure: towards deep neuromorphic knowledge graph embeddings","date":"2021-09-21","arxiv_id":"2109.10376","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-the-user-item-graph-with-textual","slug":"augmenting-the-user-item-graph-with-textual","title":"Augmenting the User-Item Graph with Textual Similarity Models","date":"2021-09-20","arxiv_id":"2109.09358","repositories_listed":1,"syntology":null},{"url":"/paper/deviation-based-learning","slug":"deviation-based-learning","title":"Deviation-Based Learning: Training Recommender Systems Using Informed User Choice","date":"2021-09-20","arxiv_id":"2109.09816","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-systems-based-on-graph-embedding","slug":"recommender-systems-based-on-graph-embedding","title":"Recommender systems based on graph embedding techniques: A comprehensive review","date":"2021-09-20","arxiv_id":"2109.09587","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-semantic-lexicons-using-word","slug":"augmenting-semantic-lexicons-using-word","title":"Augmenting semantic lexicons using word embeddings and transfer learning","date":"2021-09-18","arxiv_id":"2109.09010","repositories_listed":1,"syntology":null},{"url":"/paper/a-qualitative-evaluation-of-user-preference","slug":"a-qualitative-evaluation-of-user-preference","title":"A Qualitative Evaluation of User Preference for Link-based vs. Text-based Recommendations of Wikipedia Articles","date":"2021-09-16","arxiv_id":"2109.07791","repositories_listed":1,"syntology":null},{"url":"/paper/membership-inference-attacks-against","slug":"membership-inference-attacks-against","title":"Membership Inference Attacks Against Recommender Systems","date":"2021-09-16","arxiv_id":"2109.08045","repositories_listed":1,"syntology":null},{"url":"/paper/it-doesn-t-look-good-for-a-date-transforming","slug":"it-doesn-t-look-good-for-a-date-transforming","title":"\"It doesn't look good for a date\": Transforming Critiques into Preferences for Conversational Recommendation Systems","date":"2021-09-15","arxiv_id":"2109.07576","repositories_listed":1,"syntology":null},{"url":"/paper/graph-algorithms-for-multiparallel-word","slug":"graph-algorithms-for-multiparallel-word","title":"Graph Algorithms for Multiparallel Word Alignment","date":"2021-09-13","arxiv_id":"2109.06283","repositories_listed":1,"syntology":null},{"url":"/paper/region-invariant-normalizing-flows-for","slug":"region-invariant-normalizing-flows-for","title":"Region Invariant Normalizing Flows for Mobility Transfer","date":"2021-09-13","arxiv_id":"2109.05738","repositories_listed":1,"syntology":null},{"url":"/paper/existence-conditions-for-hidden-feedback","slug":"existence-conditions-for-hidden-feedback","title":"Existence conditions for hidden feedback loops in online recommender systems","date":"2021-09-11","arxiv_id":"2109.05278","repositories_listed":1,"syntology":null}],"record_sha256":"8201eaa569a5805af909d22a3719d3993706e8624dd9bd2290af9f0e8c2d33f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}