{"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/4","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":4,"pages_in_order":61,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/recommendation-systems/papers/5","papers":[{"url":"/paper/using-posters-to-recommend-anime-and-mangas","slug":"using-posters-to-recommend-anime-and-mangas","title":"Using Posters to Recommend Anime and Mangas in a Cold-Start Scenario","date":"2017-09-03","arxiv_id":"1709.01584","repositories_listed":2,"syntology":null},{"url":"/paper/binary-latent-representations-for-efficient","slug":"binary-latent-representations-for-efficient","title":"Binary Latent Representations for Efficient Ranking: Empirical Assessment","date":"2017-06-22","arxiv_id":"1706.07479","repositories_listed":2,"syntology":null},{"url":"/paper/parvecmf-a-paragraph-vector-based-matrix","slug":"parvecmf-a-paragraph-vector-based-matrix","title":"ParVecMF: A Paragraph Vector-based Matrix Factorization Recommender System","date":"2017-06-22","arxiv_id":"1706.07513","repositories_listed":2,"syntology":null},{"url":"/paper/geometric-matrix-completion-with-recurrent","slug":"geometric-matrix-completion-with-recurrent","title":"Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks","date":"2017-04-22","arxiv_id":"1704.06803","repositories_listed":2,"syntology":null},{"url":"/paper/ranking-with-fairness-constraints","slug":"ranking-with-fairness-constraints","title":"Ranking with Fairness Constraints","date":"2017-04-22","arxiv_id":"1704.06840","repositories_listed":2,"syntology":null},{"url":"/paper/transnets-learning-to-transform-for","slug":"transnets-learning-to-transform-for","title":"TransNets: Learning to Transform for Recommendation","date":"2017-04-07","arxiv_id":"1704.02298","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-metric-learning","slug":"collaborative-metric-learning","title":"Collaborative Metric Learning","date":"2017-04-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/cumf_sgd-fast-and-scalable-matrix","slug":"cumf_sgd-fast-and-scalable-matrix","title":"CuMF_SGD: Fast and Scalable Matrix Factorization","date":"2016-10-19","arxiv_id":"1610.05838","repositories_listed":2,"syntology":null},{"url":"/paper/fifty-shades-of-ratings-how-to-benefit-from-a","slug":"fifty-shades-of-ratings-how-to-benefit-from-a","title":"Fifty Shades of Ratings: How to Benefit from a Negative Feedback in Top-N Recommendations Tasks","date":"2016-07-14","arxiv_id":"1607.04228","repositories_listed":2,"syntology":null},{"url":"/paper/yum-me-a-personalized-nutrient-based-meal","slug":"yum-me-a-personalized-nutrient-based-meal","title":"Yum-me: A Personalized Nutrient-based Meal Recommender System","date":"2016-05-25","arxiv_id":"1605.07722","repositories_listed":2,"syntology":null},{"url":"/paper/science-concierge-a-fast-content-based","slug":"science-concierge-a-fast-content-based","title":"Science Concierge: A fast content-based recommendation system for scientific publications","date":"2016-04-04","arxiv_id":"1604.01070","repositories_listed":2,"syntology":null},{"url":"/paper/from-word-embeddings-to-item-recommendation","slug":"from-word-embeddings-to-item-recommendation","title":"From Word Embeddings to Item Recommendation","date":"2016-01-07","arxiv_id":"1601.01356","repositories_listed":2,"syntology":null},{"url":"/paper/deep-reinforcement-learning-in-large-discrete","slug":"deep-reinforcement-learning-in-large-discrete","title":"Deep Reinforcement Learning in Large Discrete Action Spaces","date":"2015-12-24","arxiv_id":"1512.07679","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-filtering-with-graph","slug":"collaborative-filtering-with-graph","title":"Collaborative Filtering with Graph Information: Consistency and Scalable Methods","date":"2015-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/inferring-networks-of-substitutable-and","slug":"inferring-networks-of-substitutable-and","title":"Inferring Networks of Substitutable and Complementary Products","date":"2015-06-29","arxiv_id":"1506.08839","repositories_listed":2,"syntology":null},{"url":"/paper/autorec-autoencoders-meet-collaborative","slug":"autorec-autoencoders-meet-collaborative","title":"AutoRec: Autoencoders Meet Collaborative Filtering","date":"2015-05-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/matrix-completion-on-graphs","slug":"matrix-completion-on-graphs","title":"Matrix Completion on Graphs","date":"2014-08-07","arxiv_id":"1408.1717","repositories_listed":2,"syntology":null},{"url":"/paper/factorization-machines","slug":"factorization-machines","title":"Factorization Machines","date":"2011-01-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/a-reproducibility-study-of-product-side","slug":"a-reproducibility-study-of-product-side","title":"A Reproducibility Study of Product-side Fairness in Bundle Recommendation","date":"2025-07-18","arxiv_id":"2507.14352","repositories_listed":1,"syntology":null},{"url":"/paper/nlgcl-naturally-existing-neighbor-layers","slug":"nlgcl-naturally-existing-neighbor-layers","title":"NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation","date":"2025-07-10","arxiv_id":"2507.07522","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-parameter-efficiency-in-llm-based","slug":"boosting-parameter-efficiency-in-llm-based","title":"Boosting Parameter Efficiency in LLM-Based Recommendation through Sophisticated Pruning","date":"2025-07-09","arxiv_id":"2507.07064","repositories_listed":1,"syntology":null},{"url":"/paper/kamae-bridging-spark-and-keras-for-seamless","slug":"kamae-bridging-spark-and-keras-for-seamless","title":"Kamae: Bridging Spark and Keras for Seamless ML Preprocessing","date":"2025-07-08","arxiv_id":"2507.06021","repositories_listed":1,"syntology":null},{"url":"/paper/findrec-stein-guided-entropic-flow-for-multi","slug":"findrec-stein-guided-entropic-flow-for-multi","title":"FindRec: Stein-Guided Entropic Flow for Multi-Modal Sequential Recommendation","date":"2025-07-07","arxiv_id":"2507.04651","repositories_listed":1,"syntology":null},{"url":"/paper/thought-augmented-planning-for-llm-powered","slug":"thought-augmented-planning-for-llm-powered","title":"Thought-Augmented Planning for LLM-Powered Interactive Recommender Agent","date":"2025-06-30","arxiv_id":"2506.23485","repositories_listed":1,"syntology":null},{"url":"/paper/reccot-enhancing-recommendation-via-chain-of","slug":"reccot-enhancing-recommendation-via-chain-of","title":"RecCoT: Enhancing Recommendation via Chain-of-Thought","date":"2025-06-26","arxiv_id":"2506.21032","repositories_listed":1,"syntology":null},{"url":"/paper/iranker-towards-ranking-foundation-model","slug":"iranker-towards-ranking-foundation-model","title":"IRanker: Towards Ranking Foundation Model","date":"2025-06-25","arxiv_id":"2506.21638","repositories_listed":1,"syntology":null},{"url":"/paper/rag-visualrec-an-open-resource-for-vision-and","slug":"rag-visualrec-an-open-resource-for-vision-and","title":"RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation","date":"2025-06-25","arxiv_id":"2506.20817","repositories_listed":1,"syntology":null},{"url":"/paper/cove-compressed-vocabulary-expansion-makes","slug":"cove-compressed-vocabulary-expansion-makes","title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","date":"2025-06-24","arxiv_id":"2506.19993","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cove-compressed-vocabulary-expansion-makes#ran","syntology_url":"https://syntology.ai/paper/2506.19993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.19993"}},"official":{"repos":["haochenzhang717/cove-official-repo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/c-tlsan-content-enhanced-time-aware-long-and","slug":"c-tlsan-content-enhanced-time-aware-long-and","title":"C-TLSAN: Content-Enhanced Time-Aware Long- and Short-Term Attention Network for Personalized Recommendation","date":"2025-06-16","arxiv_id":"2506.13021","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-matrix-completion-with-denoising","slug":"contrastive-matrix-completion-with-denoising","title":"Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation","date":"2025-06-12","arxiv_id":"2506.10658","repositories_listed":1,"syntology":null},{"url":"/paper/lightkg-efficient-knowledge-aware","slug":"lightkg-efficient-knowledge-aware","title":"LightKG: Efficient Knowledge-Aware Recommendations with Simplified GNN Architecture","date":"2025-06-12","arxiv_id":"2506.10347","repositories_listed":1,"syntology":null},{"url":"/paper/discrete-scale-invariant-metric-learning-for","slug":"discrete-scale-invariant-metric-learning-for","title":"Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering","date":"2025-06-11","arxiv_id":"2506.09898","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08743","slug":"2506-08743","title":"Bridging RDF Knowledge Graphs with Graph Neural Networks for Semantically-Rich Recommender Systems","date":"2025-06-10","arxiv_id":"2506.08743","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-correlated-latent-exogenous","slug":"addressing-correlated-latent-exogenous","title":"Addressing Correlated Latent Exogenous Variables in Debiased Recommender Systems","date":"2025-06-09","arxiv_id":"2506.07517","repositories_listed":1,"syntology":null},{"url":"/paper/llamarec-lkg-rag-a-single-pass-learnable","slug":"llamarec-lkg-rag-a-single-pass-learnable","title":"LlamaRec-LKG-RAG: A Single-Pass, Learnable Knowledge Graph-RAG Framework for LLM-Based Ranking","date":"2025-06-09","arxiv_id":"2506.07449","repositories_listed":1,"syntology":null},{"url":"/paper/moe-mlora-for-multi-domain-ctr-prediction","slug":"moe-mlora-for-multi-domain-ctr-prediction","title":"MoE-MLoRA for Multi-Domain CTR Prediction: Efficient Adaptation with Expert Specialization","date":"2025-06-09","arxiv_id":"2506.07563","repositories_listed":1,"syntology":null},{"url":"/paper/recgpt-a-foundation-model-for-sequential","slug":"recgpt-a-foundation-model-for-sequential","title":"RecGPT: A Foundation Model for Sequential Recommendation","date":"2025-06-06","arxiv_id":"2506.06270","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/recgpt-a-foundation-model-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2506.06270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.06270"}},"official":{"repos":["hkuds/recgpt"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/user-altruism-in-recommendation-systems","slug":"user-altruism-in-recommendation-systems","title":"User Altruism in Recommendation Systems","date":"2025-06-05","arxiv_id":"2506.04525","repositories_listed":1,"syntology":null},{"url":"/paper/n-2-a-unified-python-package-and-test-bench","slug":"n-2-a-unified-python-package-and-test-bench","title":"N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion","date":"2025-06-04","arxiv_id":"2506.04166","repositories_listed":1,"syntology":null},{"url":"/paper/augment-or-not-a-comparative-study-of-pure","slug":"augment-or-not-a-comparative-study-of-pure","title":"Augment or Not? A Comparative Study of Pure and Augmented Large Language Model Recommenders","date":"2025-05-29","arxiv_id":"2505.23053","repositories_listed":1,"syntology":null},{"url":"/paper/shapley-value-driven-data-pruning-for","slug":"shapley-value-driven-data-pruning-for","title":"Shapley Value-driven Data Pruning for Recommender Systems","date":"2025-05-28","arxiv_id":"2505.22057","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-multi-player-bandits-for","slug":"counterfactual-multi-player-bandits-for","title":"Counterfactual Multi-player Bandits for Explainable Recommendation Diversification","date":"2025-05-27","arxiv_id":"2505.21165","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-power-of-diffusion-models-in","slug":"unlocking-the-power-of-diffusion-models-in","title":"Unlocking the Power of Diffusion Models in Sequential Recommendation: A Simple and Effective Approach","date":"2025-05-26","arxiv_id":"2505.19544","repositories_listed":1,"syntology":null},{"url":"/paper/win-fast-or-lose-slow-balancing-speed-and","slug":"win-fast-or-lose-slow-balancing-speed-and","title":"Win Fast or Lose Slow: Balancing Speed and Accuracy in Latency-Sensitive Decisions of LLMs","date":"2025-05-26","arxiv_id":"2505.19481","repositories_listed":1,"syntology":null},{"url":"/paper/dlf-enhancing-explicit-implicit-interaction","slug":"dlf-enhancing-explicit-implicit-interaction","title":"DLF: Enhancing Explicit-Implicit Interaction via Dynamic Low-Order-Aware Fusion for CTR Prediction","date":"2025-05-25","arxiv_id":"2505.19182","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-feature-interactions-from-the","slug":"revisiting-feature-interactions-from-the","title":"Revisiting Feature Interactions from the Perspective of Quadratic Neural Networks for Click-through Rate Prediction","date":"2025-05-23","arxiv_id":"2505.17999","repositories_listed":1,"syntology":null},{"url":"/paper/graph-foundation-models-a-comprehensive","slug":"graph-foundation-models-a-comprehensive","title":"Graph Foundation Models: A Comprehensive Survey","date":"2025-05-21","arxiv_id":"2505.15116","repositories_listed":1,"syntology":null},{"url":"/paper/kerl-knowledge-enhanced-personalized-recipe","slug":"kerl-knowledge-enhanced-personalized-recipe","title":"KERL: Knowledge-Enhanced Personalized Recipe Recommendation using Large Language Models","date":"2025-05-20","arxiv_id":"2505.14629","repositories_listed":1,"syntology":null},{"url":"/paper/i-ll-believe-it-when-i-see-it-images-increase","slug":"i-ll-believe-it-when-i-see-it-images-increase","title":"I'll believe it when I see it: Images increase misinformation sharing in Vision-Language Models","date":"2025-05-19","arxiv_id":"2505.13302","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11388","slug":"2505-11388","title":"The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems","date":"2025-05-16","arxiv_id":"2505.11388","repositories_listed":1,"syntology":null},{"url":"/paper/do-llms-memorize-recommendation-datasets-a","slug":"do-llms-memorize-recommendation-datasets-a","title":"Do LLMs Memorize Recommendation Datasets? A Preliminary Study on MovieLens-1M","date":"2025-05-15","arxiv_id":"2505.10212","repositories_listed":1,"syntology":null},{"url":"/paper/adaptively-weighted-nearest-neighbors-for","slug":"adaptively-weighted-nearest-neighbors-for","title":"Adaptively-weighted Nearest Neighbors for Matrix Completion","date":"2025-05-14","arxiv_id":"2505.09612","repositories_listed":1,"syntology":null},{"url":"/paper/vimrhp-a-vietnamese-benchmark-dataset-for","slug":"vimrhp-a-vietnamese-benchmark-dataset-for","title":"ViMRHP: A Vietnamese Benchmark Dataset for Multimodal Review Helpfulness Prediction via Human-AI Collaborative Annotation","date":"2025-05-12","arxiv_id":"2505.07416","repositories_listed":1,"syntology":null},{"url":"/paper/comrecgc-global-graph-counterfactual","slug":"comrecgc-global-graph-counterfactual","title":"COMRECGC: Global Graph Counterfactual Explainer through Common Recourse","date":"2025-05-11","arxiv_id":"2505.07081","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comrecgc-global-graph-counterfactual#ran","syntology_url":"https://syntology.ai/paper/2505.07081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.07081"}},"official":{"repos":["ssggreg/comrecgc"],"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","unlocated"]}}},{"url":"/paper/differentiable-fuzzy-neural-networks-for","slug":"differentiable-fuzzy-neural-networks-for","title":"Differentiable Fuzzy Neural Networks for Recommender Systems","date":"2025-05-09","arxiv_id":"2505.06000","repositories_listed":1,"syntology":null},{"url":"/paper/tweedie-regression-for-video-recommendation","slug":"tweedie-regression-for-video-recommendation","title":"Tweedie Regression for Video Recommendation System","date":"2025-05-09","arxiv_id":"2505.06445","repositories_listed":1,"syntology":null},{"url":"/paper/learning-item-representations-directly-from","slug":"learning-item-representations-directly-from","title":"Learning Item Representations Directly from Multimodal Features for Effective Recommendation","date":"2025-05-08","arxiv_id":"2505.04960","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-based-llms-for-position-bias-aware","slug":"prompt-based-llms-for-position-bias-aware","title":"Prompt-Based LLMs for Position Bias-Aware Reranking in Personalized Recommendations","date":"2025-05-08","arxiv_id":"2505.04948","repositories_listed":1,"syntology":null},{"url":"/paper/1-st-place-solution-of-www-2025-erel-mir","slug":"1-st-place-solution-of-www-2025-erel-mir","title":"1$^{st}$ Place Solution of WWW 2025 EReL@MIR Workshop Multimodal CTR Prediction Challenge","date":"2025-05-06","arxiv_id":"2505.03543","repositories_listed":1,"syntology":null},{"url":"/paper/avoid-recommending-out-of-domain-items","slug":"avoid-recommending-out-of-domain-items","title":"Avoid Recommending Out-of-Domain Items: Constrained Generative Recommendation with LLMs","date":"2025-05-06","arxiv_id":"2505.03336","repositories_listed":1,"syntology":null},{"url":"/paper/familiarizing-with-music-discovery-patterns","slug":"familiarizing-with-music-discovery-patterns","title":"Familiarizing with Music: Discovery Patterns for Different Music Discovery Needs","date":"2025-05-06","arxiv_id":"2505.03568","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-musical-genre-trajectories-through","slug":"modeling-musical-genre-trajectories-through","title":"Modeling Musical Genre Trajectories through Pathlet Learning","date":"2025-05-06","arxiv_id":"2505.03480","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-benchmarking-and-recommendation-of","slug":"multimodal-benchmarking-and-recommendation-of","title":"Multimodal Benchmarking and Recommendation of Text-to-Image Generation Models","date":"2025-05-06","arxiv_id":"2505.04650","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-in-repeated-implicit-feedback-as","slug":"uncertainty-in-repeated-implicit-feedback-as","title":"Uncertainty in Repeated Implicit Feedback as a Measure of Reliability","date":"2025-05-05","arxiv_id":"2505.02492","repositories_listed":1,"syntology":null},{"url":"/paper/wide-deep-learning-for-node-classification","slug":"wide-deep-learning-for-node-classification","title":"Wide & Deep Learning for Node Classification","date":"2025-05-04","arxiv_id":"2505.02020","repositories_listed":1,"syntology":null},{"url":"/paper/towards-explainable-temporal-user-profiling","slug":"towards-explainable-temporal-user-profiling","title":"Towards Explainable Temporal User Profiling with LLMs","date":"2025-05-01","arxiv_id":"2505.00886","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-new-item-fairness-in-dynamic","slug":"enhancing-new-item-fairness-in-dynamic","title":"Enhancing New-item Fairness in Dynamic Recommender Systems","date":"2025-04-30","arxiv_id":"2504.21362","repositories_listed":1,"syntology":null},{"url":"/paper/algorithm-performance-spaces-for-strategic","slug":"algorithm-performance-spaces-for-strategic","title":"Algorithm Performance Spaces for Strategic Dataset Selection","date":"2025-04-29","arxiv_id":"2505.01442","repositories_listed":1,"syntology":null},{"url":"/paper/feature-staleness-aware-incremental-learning","slug":"feature-staleness-aware-incremental-learning","title":"Feature Staleness Aware Incremental Learning for CTR Prediction","date":"2025-04-29","arxiv_id":"2505.02844","repositories_listed":1,"syntology":null},{"url":"/paper/recgaze-the-first-eye-tracking-and-user","slug":"recgaze-the-first-eye-tracking-and-user","title":"RecGaze: The First Eye Tracking and User Interaction Dataset for Carousel Interfaces","date":"2025-04-29","arxiv_id":"2504.20792","repositories_listed":1,"syntology":null},{"url":"/paper/feature-fusion-revisited-multimodal-ctr","slug":"feature-fusion-revisited-multimodal-ctr","title":"Feature Fusion Revisited: Multimodal CTR Prediction for MMCTR Challenge","date":"2025-04-26","arxiv_id":"2504.18961","repositories_listed":1,"syntology":null},{"url":"/paper/quadratic-interest-network-for-multimodal","slug":"quadratic-interest-network-for-multimodal","title":"Quadratic Interest Network for Multimodal Click-Through Rate Prediction","date":"2025-04-24","arxiv_id":"2504.17699","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-and-generating-modalities-for","slug":"disentangling-and-generating-modalities-for","title":"Disentangling and Generating Modalities for Recommendation in Missing Modality Scenarios","date":"2025-04-23","arxiv_id":"2504.16352","repositories_listed":1,"syntology":null},{"url":"/paper/mmhcl-multi-modal-hypergraph-contrastive","slug":"mmhcl-multi-modal-hypergraph-contrastive","title":"MMHCL: Multi-Modal Hypergraph Contrastive Learning for Recommendation","date":"2025-04-23","arxiv_id":"2504.16576","repositories_listed":1,"syntology":null},{"url":"/paper/teach-me-how-to-denoise-a-universal-framework","slug":"teach-me-how-to-denoise-a-universal-framework","title":"Teach Me How to Denoise: A Universal Framework for Denoising Multi-modal Recommender Systems via Guided Calibration","date":"2025-04-19","arxiv_id":"2504.14214","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-long-term-embedding-with-denoising","slug":"adaptive-long-term-embedding-with-denoising","title":"Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation","date":"2025-04-18","arxiv_id":"2504.13614","repositories_listed":1,"syntology":null},{"url":"/paper/should-we-tailor-the-talk-understanding-the","slug":"should-we-tailor-the-talk-understanding-the","title":"Should We Tailor the Talk? Understanding the Impact of Conversational Styles on Preference Elicitation in Conversational Recommender Systems","date":"2025-04-17","arxiv_id":"2504.13095","repositories_listed":1,"syntology":null},{"url":"/paper/federated-spectral-graph-transformers-meet","slug":"federated-spectral-graph-transformers-meet","title":"Federated Spectral Graph Transformers Meet Neural Ordinary Differential Equations for Non-IID Graphs","date":"2025-04-16","arxiv_id":"2504.11808","repositories_listed":1,"syntology":null},{"url":"/paper/mscrs-multi-modal-semantic-graph-prompt","slug":"mscrs-multi-modal-semantic-graph-prompt","title":"MSCRS: Multi-modal Semantic Graph Prompt Learning Framework for Conversational Recommender Systems","date":"2025-04-15","arxiv_id":"2504.10921","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-for-temporal-link","slug":"transfer-learning-for-temporal-link","title":"Transfer Learning for Temporal Link Prediction","date":"2025-04-15","arxiv_id":"2504.10925","repositories_listed":1,"syntology":null},{"url":"/paper/crossan-towards-efficient-and-effective","slug":"crossan-towards-efficient-and-effective","title":"CROSSAN: Towards Efficient and Effective Adaptation of Multiple Multimodal Foundation Models for Sequential Recommendation","date":"2025-04-14","arxiv_id":"2504.10307","repositories_listed":1,"syntology":null},{"url":"/paper/invariance-matters-empowering-social","slug":"invariance-matters-empowering-social","title":"Invariance Matters: Empowering Social Recommendation via Graph Invariant Learning","date":"2025-04-14","arxiv_id":"2504.10432","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-textual-embeddings-from","slug":"integrating-textual-embeddings-from","title":"Integrating Textual Embeddings from Contrastive Learning with Generative Recommender for Enhanced Personalization","date":"2025-04-13","arxiv_id":"2504.10545","repositories_listed":1,"syntology":null},{"url":"/paper/double-machine-learning-for-causal-inference","slug":"double-machine-learning-for-causal-inference","title":"Double Machine Learning for Causal Inference under Shared-State Interference","date":"2025-04-10","arxiv_id":"2504.08836","repositories_listed":1,"syntology":null},{"url":"/paper/the-urban-impact-of-ai-modeling-feedback","slug":"the-urban-impact-of-ai-modeling-feedback","title":"The Urban Impact of AI: Modeling Feedback Loops in Next-Venue Recommendation","date":"2025-04-10","arxiv_id":"2504.07911","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-meta-learning-based-poisoning","slug":"exploiting-meta-learning-based-poisoning","title":"Exploiting Meta-Learning-based Poisoning Attacks for Graph Link Prediction","date":"2025-04-08","arxiv_id":"2504.06492","repositories_listed":1,"syntology":null},{"url":"/paper/retrieval-augmented-generation-with-2","slug":"retrieval-augmented-generation-with-2","title":"Retrieval Augmented Generation with Collaborative Filtering for Personalized Text Generation","date":"2025-04-08","arxiv_id":"2504.05731","repositories_listed":1,"syntology":null},{"url":"/paper/stealthrank-llm-ranking-manipulation-via","slug":"stealthrank-llm-ranking-manipulation-via","title":"StealthRank: LLM Ranking Manipulation via Stealthy Prompt Optimization","date":"2025-04-08","arxiv_id":"2504.05804","repositories_listed":1,"syntology":null},{"url":"/paper/why-is-normalization-necessary-for-linear","slug":"why-is-normalization-necessary-for-linear","title":"Why is Normalization Necessary for Linear Recommenders?","date":"2025-04-08","arxiv_id":"2504.05805","repositories_listed":1,"syntology":null},{"url":"/paper/can-llm-driven-hard-negative-sampling-empower","slug":"can-llm-driven-hard-negative-sampling-empower","title":"Can LLM-Driven Hard Negative Sampling Empower Collaborative Filtering? Findings and Potentials","date":"2025-04-07","arxiv_id":"2504.04726","repositories_listed":1,"syntology":null},{"url":"/paper/gotham-graph-class-incremental-learning","slug":"gotham-graph-class-incremental-learning","title":"GOTHAM: Graph Class Incremental Learning Framework under Weak Supervision","date":"2025-04-07","arxiv_id":"2504.04954","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-popularity-bias-amplification","slug":"investigating-popularity-bias-amplification","title":"Investigating Popularity Bias Amplification in Recommender Systems Employed in the Entertainment Domain","date":"2025-04-07","arxiv_id":"2504.04752","repositories_listed":1,"syntology":null},{"url":"/paper/squeeze-and-excitation-a-weighted-graph","slug":"squeeze-and-excitation-a-weighted-graph","title":"Squeeze and Excitation: A Weighted Graph Contrastive Learning for Collaborative Filtering","date":"2025-04-06","arxiv_id":"2504.04443","repositories_listed":1,"syntology":null},{"url":"/paper/msl-not-all-tokens-are-what-you-need-for","slug":"msl-not-all-tokens-are-what-you-need-for","title":"MSL: Not All Tokens Are What You Need for Tuning LLM as a Recommender","date":"2025-04-05","arxiv_id":"2504.04178","repositories_listed":1,"syntology":null},{"url":"/paper/short-video-segment-level-user-dynamic","slug":"short-video-segment-level-user-dynamic","title":"Short Video Segment-level User Dynamic Interests Modeling in Personalized Recommendation","date":"2025-04-05","arxiv_id":"2504.04237","repositories_listed":1,"syntology":null},{"url":"/paper/towards-principled-learning-for-re-ranking-in","slug":"towards-principled-learning-for-re-ranking-in","title":"Towards Principled Learning for Re-ranking in Recommender Systems","date":"2025-04-05","arxiv_id":"2504.04188","repositories_listed":1,"syntology":null},{"url":"/paper/crossing-boundaries-leveraging-semantic","slug":"crossing-boundaries-leveraging-semantic","title":"Crossing Boundaries: Leveraging Semantic Divergences to Explore Cultural Novelty in Cooking Recipes","date":"2025-03-31","arxiv_id":"2503.24027","repositories_listed":1,"syntology":null},{"url":"/paper/rec-r1-bridging-generative-large-language","slug":"rec-r1-bridging-generative-large-language","title":"Rec-R1: Bridging Generative Large Language Models and User-Centric Recommendation Systems via Reinforcement Learning","date":"2025-03-31","arxiv_id":"2503.24289","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rec-r1-bridging-generative-large-language#ran","syntology_url":"https://syntology.ai/paper/2503.24289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.24289"}},"official":{"repos":["linjc16/Rec-R1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-hashtag-recommendation-in-social","slug":"dynamic-hashtag-recommendation-in-social","title":"Dynamic hashtag recommendation in social media with trend shift detection and adaptation","date":"2025-03-30","arxiv_id":"2504.00044","repositories_listed":1,"syntology":null},{"url":"/paper/lavic-adapting-large-vision-language-models","slug":"lavic-adapting-large-vision-language-models","title":"LaViC: Adapting Large Vision-Language Models to Visually-Aware Conversational Recommendation","date":"2025-03-30","arxiv_id":"2503.23312","repositories_listed":1,"syntology":null}],"record_sha256":"d460a55dc7ddb44db508cb76bec2a97444baf68fb16c5b06e10cceb54a1cd35a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}