{"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/31","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":31,"pages_in_order":61,"rows_per_page":100,"rows":[3001,3100],"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/30","next":"/task/recommendation-systems/papers/32","papers":[{"url":null,"slug":"ppm-a-pre-trained-plug-in-model-for-click","title":"PPM : A Pre-trained Plug-in Model for Click-through Rate Prediction","date":"2024-03-15","arxiv_id":"2403.10049","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-and-search-an-elegant-technique-for","title":"Learn and Search: An Elegant Technique for Object Lookup using Contrastive Learning","date":"2024-03-12","arxiv_id":"2403.07231","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-contrastive-learning-for-8","title":"Self-supervised Contrastive Learning for Implicit Collaborative Filtering","date":"2024-03-12","arxiv_id":"2403.07265","repositories_listed":0,"syntology":null},{"url":null,"slug":"coral-collaborative-retrieval-augmented-large","title":"CoRAL: Collaborative Retrieval-Augmented Large Language Models Improve Long-tail Recommendation","date":"2024-03-11","arxiv_id":"2403.06447","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-movie-selection-using-multi-channel","title":"Group Movie Selection using Multi-channel Emotion Recognition","date":"2024-03-11","arxiv_id":"2403.12087","repositories_listed":0,"syntology":null},{"url":null,"slug":"kellmrec-knowledge-enhanced-large-language","title":"TRAWL: External Knowledge-Enhanced Recommendation with LLM Assistance","date":"2024-03-11","arxiv_id":"2403.06642","repositories_listed":0,"syntology":null},{"url":null,"slug":"post-training-attribute-unlearning-in","title":"Post-Training Attribute Unlearning in Recommender Systems","date":"2024-03-11","arxiv_id":"2403.06737","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-is-all-you-need-for-boosting-graph","title":"Attention is all you need for boosting graph convolutional neural network","date":"2024-03-10","arxiv_id":"2403.15419","repositories_listed":0,"syntology":null},{"url":null,"slug":"control-strategies-for-recommendation-systems","title":"Control Strategies for Recommendation Systems in Social Networks","date":"2024-03-10","arxiv_id":"2403.06152","repositories_listed":0,"syntology":null},{"url":null,"slug":"cfairllm-consumer-fairness-evaluation-in","title":"CFaiRLLM: Consumer Fairness Evaluation in Large-Language Model Recommender System","date":"2024-03-08","arxiv_id":"2403.05668","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-tower-multi-interest-recommendation","title":"Multi-Tower Multi-Interest Recommendation with User Representation Repel","date":"2024-03-08","arxiv_id":"2403.05122","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-news-recommendation-in-the-era","title":"Benchmarking News Recommendation in the Era of Green AI","date":"2024-03-07","arxiv_id":"2403.04736","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-small-language-models-be-good-reasoners","title":"Can Small Language Models be Good Reasoners for Sequential Recommendation?","date":"2024-03-07","arxiv_id":"2403.04260","repositories_listed":0,"syntology":null},{"url":"/paper/dgr-a-general-graph-desmoothing-framework-for","slug":"dgr-a-general-graph-desmoothing-framework-for","title":"DGR: A General Graph Desmoothing Framework for Recommendation via Global and Local Perspectives","date":"2024-03-07","arxiv_id":"2403.04287","repositories_listed":0,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/dgr-a-general-graph-desmoothing-framework-for#ran","syntology_url":"https://syntology.ai/paper/2403.04287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04287"}},"official":null}},{"url":null,"slug":"improving-matrix-completion-by-exploiting","title":"Improving Matrix Completion by Exploiting Rating Ordinality in Graph Neural Networks","date":"2024-03-07","arxiv_id":"2403.04504","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-2nd-workshop-on-recommendation-with","title":"The 2nd Workshop on Recommendation with Generative Models","date":"2024-03-07","arxiv_id":"2403.04399","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncovering-the-deep-filter-bubble-narrow","title":"Uncovering the Deep Filter Bubble: Narrow Exposure in Short-Video Recommendation","date":"2024-03-07","arxiv_id":"2403.04511","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-disentanglement-for-regulating-social","title":"Causal Disentanglement for Regulating Social Influence Bias in Social Recommendation","date":"2024-03-06","arxiv_id":"2403.03578","repositories_listed":0,"syntology":null},{"url":null,"slug":"intent-aware-recommendation-via-disentangled","title":"Intent-aware Recommendation via Disentangled Graph Contrastive Learning","date":"2024-03-06","arxiv_id":"2403.03714","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adversarial-mdps-with-stochastic","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","date":"2024-03-06","arxiv_id":"2403.03672","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-negative-reservoir-for","title":"Personalized Negative Reservoir for Incremental Learning in Recommender Systems","date":"2024-03-06","arxiv_id":"2403.03993","repositories_listed":0,"syntology":null},{"url":null,"slug":"emerging-synergies-between-large-language","title":"Emerging Synergies Between Large Language Models and Machine Learning in Ecommerce Recommendations","date":"2024-03-05","arxiv_id":"2403.02760","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-federated-learning-and-edge","title":"Leveraging Federated Learning and Edge Computing for Recommendation Systems within Cloud Computing Networks","date":"2024-03-05","arxiv_id":"2403.03165","repositories_listed":0,"syntology":null},{"url":null,"slug":"kenet-knowledge-enhanced-doc-label-attention","title":"KeNet:Knowledge-enhanced Doc-Label Attention Network for Multi-label text classification","date":"2024-03-04","arxiv_id":"2403.01767","repositories_listed":0,"syntology":null},{"url":null,"slug":"supplier-recommendation-in-online-procurement","title":"Supplier Recommendation in Online Procurement","date":"2024-03-02","arxiv_id":"2403.01301","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-graph-sequential-representation","title":"End-to-End Graph-Sequential Representation Learning for Accurate Recommendations","date":"2024-03-01","arxiv_id":"2403.00895","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-user-representations-for-transfer","title":"Generalized User Representations for Transfer Learning","date":"2024-03-01","arxiv_id":"2403.00584","repositories_listed":0,"syntology":null},{"url":null,"slug":"impact-of-decentralized-learning-on-player","title":"Impact of Decentralized Learning on Player Utilities in Stackelberg Games","date":"2024-02-29","arxiv_id":"2403.00188","repositories_listed":0,"syntology":null},{"url":null,"slug":"influencing-bandits-arm-selection-for","title":"Influencing Bandits: Arm Selection for Preference Shaping","date":"2024-02-29","arxiv_id":"2403.00036","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-left-partial-auc-an-effective-and","title":"Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendation","date":"2024-02-29","arxiv_id":"2403.00844","repositories_listed":0,"syntology":null},{"url":null,"slug":"negative-sampling-in-knowledge-graph","title":"Negative Sampling in Knowledge Graph Representation Learning: A Review","date":"2024-02-29","arxiv_id":"2402.19195","repositories_listed":0,"syntology":null},{"url":null,"slug":"stop-relying-on-no-choice-and-do-not-repeat","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","date":"2024-02-29","arxiv_id":"2402.18917","repositories_listed":0,"syntology":null},{"url":null,"slug":"bivrec-bidirectional-view-based-multimodal","title":"BiVRec: Bidirectional View-based Multimodal Sequential Recommendation","date":"2024-02-27","arxiv_id":"2402.17334","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-negative-sampling-matter-a-review-with","title":"Does Negative Sampling Matter? A Review with Insights into its Theory and Applications","date":"2024-02-27","arxiv_id":"2402.17238","repositories_listed":0,"syntology":null},{"url":null,"slug":"against-filter-bubbles-diversified-music","title":"Against Filter Bubbles: Diversified Music Recommendation via Weighted Hypergraph Embedding Learning","date":"2024-02-26","arxiv_id":"2402.16299","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-calibration-for-recommender","title":"Confidence Calibration for Recommender Systems and Its Applications","date":"2024-02-26","arxiv_id":"2402.16325","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-under-distribution-shifts-a","title":"Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning","date":"2024-02-26","arxiv_id":"2402.16374","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-large-language-models-with","title":"Integrating Large Language Models with Graphical Session-Based Recommendation","date":"2024-02-26","arxiv_id":"2402.16539","repositories_listed":0,"syntology":null},{"url":null,"slug":"interarec-interactive-recommendations-using","title":"InteraRec: Screenshot Based Recommendations Using Multimodal Large Language Models","date":"2024-02-26","arxiv_id":"2403.00822","repositories_listed":0,"syntology":null},{"url":null,"slug":"rate-optimal-rank-aggregation-with-private","title":"Rate-Optimal Rank Aggregation with Private Pairwise Rankings","date":"2024-02-26","arxiv_id":"2402.16792","repositories_listed":0,"syntology":null},{"url":null,"slug":"pfeed-generating-near-real-time-personalized","title":"Pfeed: Generating near real-time personalized feeds using precomputed embedding similarities","date":"2024-02-25","arxiv_id":"2402.16073","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-understanding-and-generation-using","title":"Text Understanding and Generation Using Transformer Models for Intelligent E-commerce Recommendations","date":"2024-02-25","arxiv_id":"2402.16035","repositories_listed":0,"syntology":null},{"url":null,"slug":"debiased-model-based-interactive","title":"Debiased Model-based Interactive Recommendation","date":"2024-02-24","arxiv_id":"2402.15819","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-user-interaction-in-operating","title":"Enhanced User Interaction in Operating Systems through Machine Learning Language Models","date":"2024-02-24","arxiv_id":"2403.00806","repositories_listed":0,"syntology":null},{"url":null,"slug":"artful-path-to-healing-using-machine-learning","title":"Artful Path to Healing: Using Machine Learning for Visual Art Recommendation to Prevent and Reduce Post-Intensive Care","date":"2024-02-23","arxiv_id":"2402.15643","repositories_listed":0,"syntology":null},{"url":null,"slug":"limaml-personalization-of-deep-recommender","title":"LiMAML: Personalization of Deep Recommender Models via Meta Learning","date":"2024-02-23","arxiv_id":"2403.00803","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-theoretical-understanding-of-two","title":"Towards a Theoretical Understanding of Two-Stage Recommender Systems","date":"2024-02-23","arxiv_id":"2403.00802","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensure-timeliness-and-accuracy-a-novel","title":"Ensure Timeliness and Accuracy: A Novel Sliding Window Data Stream Paradigm for Live Streaming Recommendation","date":"2024-02-22","arxiv_id":"2402.14399","repositories_listed":0,"syntology":null},{"url":null,"slug":"filter-bubble-or-homogenization-disentangling","title":"Filter Bubble or Homogenization? Disentangling the Long-Term Effects of Recommendations on User Consumption Patterns","date":"2024-02-22","arxiv_id":"2402.15013","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-under-heterophily-a-physics","title":"Link Prediction with Physics-Inspired Graph Neural Networks","date":"2024-02-22","arxiv_id":"2402.14802","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-for-its-purpose-repeat-and","title":"Recommender for Its Purpose: Repeat and Exploration in Food Delivery Recommendations","date":"2024-02-22","arxiv_id":"2402.14440","repositories_listed":0,"syntology":null},{"url":null,"slug":"unleashing-the-power-of-ai-a-systematic","title":"Unleashing the Power of AI. A Systematic Review of Cutting-Edge Techniques in AI-Enhanced Scientometrics, Webometrics, and Bibliometrics","date":"2024-02-22","arxiv_id":"2403.18838","repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-the-barrier-utilizing-large-language","title":"Breaking the Barrier: Utilizing Large Language Models for Industrial Recommendation Systems through an Inferential Knowledge Graph","date":"2024-02-21","arxiv_id":"2402.13750","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-one-embedding-fit-all-a-multi-interest","title":"Can One Embedding Fit All? A Multi-Interest Learning Paradigm Towards Improving User Interest Diversity Fairness","date":"2024-02-21","arxiv_id":"2402.13495","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-aware-k-maximum-inner-product","title":"Diversity-Aware $k$-Maximum Inner Product Search Revisited","date":"2024-02-21","arxiv_id":"2402.13858","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-retrieve-for-job-matching","title":"Learning to Retrieve for Job Matching","date":"2024-02-21","arxiv_id":"2402.13435","repositories_listed":0,"syntology":null},{"url":null,"slug":"misalignment-learning-and-ranking-harnessing","title":"Misalignment, Learning, and Ranking: Harnessing Users Limited Attention","date":"2024-02-21","arxiv_id":"2402.14013","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-mlops-a-devops-tools-recommender","title":"Towards MLOps: A DevOps Tools Recommender System for Machine Learning System","date":"2024-02-20","arxiv_id":"2402.12867","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-the-why-of-buying-introducing-a-new","title":"Unlocking the `Why' of Buying: Introducing a New Dataset and Benchmark for Purchase Reason and Post-Purchase Experience","date":"2024-02-20","arxiv_id":"2402.13417","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneity-aware-cross-school-electives","title":"Heterogeneity-aware Cross-school Electives Recommendation: a Hybrid Federated Approach","date":"2024-02-19","arxiv_id":"2402.12202","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-opposite-gender-interaction-ratio","title":"Leveraging Opposite Gender Interaction Ratio as a Path towards Fairness in Online Dating Recommendations Based on User Sexual Orientation","date":"2024-02-19","arxiv_id":"2402.12541","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-as-data-augmenters-for","title":"Large Language Models as Data Augmenters for Cold-Start Item Recommendation","date":"2024-02-18","arxiv_id":"2402.11724","repositories_listed":0,"syntology":null},{"url":null,"slug":"pattern-wise-transparent-sequential","title":"Pattern-wise Transparent Sequential Recommendation","date":"2024-02-18","arxiv_id":"2402.11480","repositories_listed":0,"syntology":null},{"url":null,"slug":"poisoning-federated-recommender-systems-with","title":"Poisoning Federated Recommender Systems with Fake Users","date":"2024-02-18","arxiv_id":"2402.11637","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundation-models-for-recommender-systems-a","title":"Foundation Models for Recommender Systems: A Survey and New Perspectives","date":"2024-02-17","arxiv_id":"2402.11143","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-based-session-recommendation","title":"Knowledge Graph-based Session Recommendation with Adaptive Propagation","date":"2024-02-17","arxiv_id":"2402.11302","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequential-recommendation-on-temporal","title":"Sequential Recommendation on Temporal Proximities with Contrastive Learning and Self-Attention","date":"2024-02-15","arxiv_id":"2402.09784","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-modeling-and-user-profiling-a","title":"User Modeling and User Profiling: A Comprehensive Survey","date":"2024-02-15","arxiv_id":"2402.09660","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-aware-fine-tuning-of-sequential","title":"Confidence-aware Fine-tuning of Sequential Recommendation Systems via Conformal Prediction","date":"2024-02-14","arxiv_id":"2402.08976","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-model-interaction-simulator","title":"Large Language Model Simulator for Cold-Start Recommendation","date":"2024-02-14","arxiv_id":"2402.09176","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendation-algorithm-based-on","title":"Recommendation Algorithm Based on Recommendation Sessions","date":"2024-02-14","arxiv_id":"2402.09130","repositories_listed":0,"syntology":null},{"url":null,"slug":"review-incorporated-model-agnostic-profile","title":"Review-Incorporated Model-Agnostic Profile Injection Attacks on Recommender Systems","date":"2024-02-14","arxiv_id":"2402.09023","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-learning-for-trustworthy-recommender","title":"Causal Learning for Trustworthy Recommender Systems: A Survey","date":"2024-02-13","arxiv_id":"2402.08241","repositories_listed":0,"syntology":null},{"url":null,"slug":"helping-university-students-to-choose","title":"Helping university students to choose elective courses by using a hybrid multi-criteria recommendation system with genetic optimization","date":"2024-02-13","arxiv_id":"2402.08371","repositories_listed":0,"syntology":null},{"url":null,"slug":"implementation-of-recommendation-algorithm","title":"Implementation of Recommendation Algorithm based on Recommendation Sessions in E-commerce IT System","date":"2024-02-13","arxiv_id":"2402.08275","repositories_listed":0,"syntology":null},{"url":null,"slug":"sagman-stability-analysis-of-graph-neural","title":"SAGMAN: Stability Analysis of Graph Neural Networks on the Manifolds","date":"2024-02-13","arxiv_id":"2402.08653","repositories_listed":0,"syntology":null},{"url":null,"slug":"food-recommendation-as-language-processing-f","title":"Food Recommendation as Language Processing (F-RLP): A Personalized and Contextual Paradigm","date":"2024-02-12","arxiv_id":"2402.07477","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-data-to-decisions-the-transformational","title":"From Data to Decisions: The Transformational Power of Machine Learning in Business Recommendations","date":"2024-02-12","arxiv_id":"2402.08109","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-impact-of-large-language-models","title":"Exploring the Impact of Large Language Models on Recommender Systems: An Extensive Review","date":"2024-02-11","arxiv_id":"2402.18590","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-autoregressive-generative-models-for","title":"Non-autoregressive Generative Models for Reranking Recommendation","date":"2024-02-10","arxiv_id":"2402.06871","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-k-nearest-neighbor","title":"Collaborative filtering, K-nearest neighbor and cosine similarity in home decor recommender systems","date":"2024-02-09","arxiv_id":"2402.06233","repositories_listed":0,"syntology":null},{"url":null,"slug":"counterclr-counterfactual-contrastive","title":"CounterCLR: Counterfactual Contrastive Learning with Non-random Missing Data in Recommendation","date":"2024-02-08","arxiv_id":"2402.05740","repositories_listed":0,"syntology":null},{"url":null,"slug":"eugene-explainable-unsupervised-approximation","title":"EUGENE: Explainable Unsupervised Approximation of Graph Edit Distance with Generalized Edit Costs","date":"2024-02-08","arxiv_id":"2402.05885","repositories_listed":0,"syntology":null},{"url":null,"slug":"ra-rec-an-efficient-id-representation","title":"RA-Rec: An Efficient ID Representation Alignment Framework for LLM-based Recommendation","date":"2024-02-07","arxiv_id":"2402.04527","repositories_listed":0,"syntology":null},{"url":null,"slug":"heam-hashed-embedding-acceleration-using","title":"ProactivePIM: Accelerating Weight-Sharing Embedding Layer with PIM for Scalable Recommendation System","date":"2024-02-06","arxiv_id":"2402.04032","repositories_listed":0,"syntology":null},{"url":null,"slug":"reliability-quality-measures-for-recommender","title":"Reliability quality measures for recommender systems","date":"2024-02-06","arxiv_id":"2402.04457","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-potential-of-automl-for-recommender","title":"The Potential of AutoML for Recommender Systems","date":"2024-02-06","arxiv_id":"2402.04453","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-topic-modelling-approaches-in","title":"Comparison of Topic Modelling Approaches in the Banking Context","date":"2024-02-05","arxiv_id":"2402.03176","repositories_listed":0,"syntology":null},{"url":null,"slug":"denoising-time-cycle-modeling-for","title":"Denoising Time Cycle Modeling for Recommendation","date":"2024-02-05","arxiv_id":"2402.02718","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-sparse-learning-a-novel-paradigm-for","title":"Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation","date":"2024-02-05","arxiv_id":"2402.02855","repositories_listed":0,"syntology":null},{"url":null,"slug":"event-based-product-carousel-recommendation","title":"Event-based Product Carousel Recommendation with Query-Click Graph","date":"2024-02-05","arxiv_id":"2402.03277","repositories_listed":0,"syntology":null},{"url":null,"slug":"finest-stabilizing-recommendations-by-rank","title":"FINEST: Stabilizing Recommendations by Rank-Preserving Fine-Tuning","date":"2024-02-05","arxiv_id":"2402.03481","repositories_listed":0,"syntology":null},{"url":null,"slug":"harnessing-pubmed-user-query-logs-for-post","title":"Harnessing PubMed User Query Logs for Post Hoc Explanations of Recommended Similar Articles","date":"2024-02-05","arxiv_id":"2402.03484","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendation-fairness-in-social-networks","title":"Recommendation Fairness in Social Networks Over Time","date":"2024-02-05","arxiv_id":"2402.03450","repositories_listed":0,"syntology":null},{"url":null,"slug":"trinity-syncretizing-multi-long-tail-long","title":"Trinity: Syncretizing Multi-/Long-tail/Long-term Interests All in One","date":"2024-02-05","arxiv_id":"2402.02842","repositories_listed":0,"syntology":null},{"url":null,"slug":"position-paper-why-the-shooting-in-the-dark","title":"Position Paper: Why the Shooting in the Dark Method Dominates Recommender Systems Practice; A Call to Abandon Anti-Utopian Thinking","date":"2024-02-03","arxiv_id":"2402.02152","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multi-agent-conversational-recommender","title":"A Multi-Agent Conversational Recommender System","date":"2024-02-02","arxiv_id":"2402.01135","repositories_listed":0,"syntology":null},{"url":null,"slug":"himirec-modeling-hierarchical-multi-interest","title":"RimiRec: Modeling Refined Multi-interest in Hierarchical Structure for Recommendation","date":"2024-02-02","arxiv_id":"2402.01253","repositories_listed":0,"syntology":null},{"url":null,"slug":"preference-poisoning-attacks-on-reward-model","title":"Preference Poisoning Attacks on Reward Model Learning","date":"2024-02-02","arxiv_id":"2402.01920","repositories_listed":0,"syntology":null},{"url":null,"slug":"cumulative-distribution-function-based","title":"Cumulative Distribution Function based General Temporal Point Processes","date":"2024-02-01","arxiv_id":"2402.00388","repositories_listed":0,"syntology":null}],"record_sha256":"e59742d0b9059eddeafd63f07490b826923919e2295dad008fc2b7288e8400e2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}