{"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/collaborative-filtering/papers/5","list_of":"/task/collaborative-filtering","task":"Collaborative Filtering","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":5,"pages_in_order":14,"rows_per_page":100,"rows":[401,500],"of":1309,"counts":{"archive_papers_tagged":1309,"with_a_code_link":461,"where_syntology_ran_a_sample":63,"not_listed_spam_title":0,"listed":1309,"listed_where_code_ran":63,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":4,"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/collaborative-filtering","prev":"/task/collaborative-filtering/papers/4","next":"/task/collaborative-filtering/papers/6","papers":[{"url":"/paper/190600150","slug":"190600150","title":"Why Not to Use Zero Imputation? Correcting Sparsity Bias in Training Neural Networks","date":"2019-06-01","arxiv_id":"1906.00150","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-effectiveness-of-low-rank","slug":"on-the-effectiveness-of-low-rank","title":"On the Effectiveness of Low-rank Approximations for Collaborative Filtering compared to Neural Networks","date":"2019-05-30","arxiv_id":"1905.12967","repositories_listed":1,"syntology":null},{"url":"/paper/190503752","slug":"190503752","title":"Compositional Coding for Collaborative Filtering","date":"2019-05-09","arxiv_id":"1905.03752","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generative-models-for-sparse-high","slug":"deep-generative-models-for-sparse-high","title":"Variational Autoencoders for Sparse and Overdispersed Discrete Data","date":"2019-05-02","arxiv_id":"1905.00616","repositories_listed":1,"syntology":null},{"url":"/paper/190411800","slug":"190411800","title":"Adaptive Matrix Completion for the Users and the Items in Tail","date":"2019-04-22","arxiv_id":"1904.11800","repositories_listed":1,"syntology":null},{"url":"/paper/dual-graph-attention-networks-for-deep-latent","slug":"dual-graph-attention-networks-for-deep-latent","title":"Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems","date":"2019-03-25","arxiv_id":"1903.10433","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-session-based-recommender-systems","slug":"a-survey-on-session-based-recommender-systems","title":"A Survey on Session-based Recommender Systems","date":"2019-02-13","arxiv_id":"1902.04864","repositories_listed":1,"syntology":null},{"url":"/paper/federated-collaborative-filtering-for-privacy","slug":"federated-collaborative-filtering-for-privacy","title":"Federated Collaborative Filtering for Privacy-Preserving Personalized Recommendation System","date":"2019-01-29","arxiv_id":"1901.09888","repositories_listed":1,"syntology":null},{"url":"/paper/learning-vertex-representations-for-bipartite","slug":"learning-vertex-representations-for-bipartite","title":"Learning Vertex Representations for Bipartite Networks","date":"2019-01-16","arxiv_id":"1901.09676","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-recommender-systems-a-systematic","slug":"hybrid-recommender-systems-a-systematic","title":"Hybrid Recommender Systems: A Systematic Literature Review","date":"2019-01-12","arxiv_id":"1901.03888","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-topic-sentiment-preference-in-an-hdp","slug":"unifying-topic-sentiment-preference-in-an-hdp","title":"Unifying Topic, Sentiment & Preference in an HDP-Based Rating Regression Model for Online Reviews","date":"2018-12-19","arxiv_id":"1812.07805","repositories_listed":1,"syntology":null},{"url":"/paper/movie-recommendation-system-using-sentiment","slug":"movie-recommendation-system-using-sentiment","title":"Movie Recommendation System using Sentiment Analysis from Microblogging Data","date":"2018-11-27","arxiv_id":"1811.10804","repositories_listed":1,"syntology":null},{"url":"/paper/mv-rnn-a-multi-view-recurrent-neural-network","slug":"mv-rnn-a-multi-view-recurrent-neural-network","title":"MV-RNN: A Multi-View Recurrent Neural Network for Sequential Recommendation","date":"2018-11-20","arxiv_id":"1611.06668","repositories_listed":1,"syntology":null},{"url":"/paper/deep-item-based-collaborative-filtering-for","slug":"deep-item-based-collaborative-filtering-for","title":"Deep Item-based Collaborative Filtering for Top-N Recommendation","date":"2018-11-11","arxiv_id":"1811.04392","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-virtual-and-real-person-for","slug":"leveraging-virtual-and-real-person-for","title":"Leveraging Virtual and Real Person for Unsupervised Person Re-identification","date":"2018-11-05","arxiv_id":"1811.02074","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-computational-reproducibility-of","slug":"predicting-computational-reproducibility-of","title":"Predicting computational reproducibility of data analysis pipelines in large population studies using collaborative filtering","date":"2018-09-26","arxiv_id":"1809.10139","repositories_listed":1,"syntology":null},{"url":"/paper/learning-consumer-and-producer-embeddings-for","slug":"learning-consumer-and-producer-embeddings-for","title":"Learning Consumer and Producer Embeddings for User-Generated Content Recommendation","date":"2018-09-25","arxiv_id":"1809.09739","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-deterministic-framework-for-non","slug":"a-novel-deterministic-framework-for-non","title":"A Novel Deterministic Framework for Non-probabilistic Recommender Systems","date":"2018-09-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/spectral-collaborative-filtering","slug":"spectral-collaborative-filtering","title":"Spectral Collaborative Filtering","date":"2018-08-30","arxiv_id":"1808.10523","repositories_listed":1,"syntology":null},{"url":"/paper/towards-large-scale-training-of-autoencoders","slug":"towards-large-scale-training-of-autoencoders","title":"Towards Large Scale Training Of Autoencoders For Collaborative Filtering","date":"2018-08-30","arxiv_id":"1809.00999","repositories_listed":1,"syntology":null},{"url":"/paper/outer-product-based-neural-collaborative","slug":"outer-product-based-neural-collaborative","title":"Outer Product-based Neural Collaborative Filtering","date":"2018-08-12","arxiv_id":"1808.03912","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-factorization-on-gpus-with-memory","slug":"matrix-factorization-on-gpus-with-memory","title":"Matrix Factorization on GPUs with Memory Optimization and Approximate Computing","date":"2018-08-11","arxiv_id":"1808.03843","repositories_listed":1,"syntology":null},{"url":"/paper/oboe-collaborative-filtering-for-automl","slug":"oboe-collaborative-filtering-for-automl","title":"OBOE: Collaborative Filtering for AutoML Model Selection","date":"2018-08-09","arxiv_id":"1808.03233","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/oboe-collaborative-filtering-for-automl#ran","syntology_url":"https://syntology.ai/paper/1808.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.03233"}},"official":{"repos":["udellgroup/oboe"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-knowledge-based-filtering-story-recommender","slug":"a-knowledge-based-filtering-story-recommender","title":"An Ontology-Based Recommender System with an Application to the Star Trek Television Franchise","date":"2018-07-31","arxiv_id":"1808.00103","repositories_listed":1,"syntology":null},{"url":"/paper/personalizing-similar-product-recommendations","slug":"personalizing-similar-product-recommendations","title":"Personalizing Similar Product Recommendations in Fashion E-commerce","date":"2018-06-29","arxiv_id":"1806.11371","repositories_listed":1,"syntology":null},{"url":"/paper/next-check-ins-prediction-via-history-and","slug":"next-check-ins-prediction-via-history-and","title":"Next Check-ins Prediction via History and Friendship on Location-Based Social Networks","date":"2018-06-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/npe-neural-personalized-embedding-for","slug":"npe-neural-personalized-embedding-for","title":"NPE: Neural Personalized Embedding for Collaborative Filtering","date":"2018-05-17","arxiv_id":"1805.06563","repositories_listed":1,"syntology":null},{"url":"/paper/learning-over-knowledge-base-embeddings-for","slug":"learning-over-knowledge-base-embeddings-for","title":"Learning over Knowledge-Base Embeddings for Recommendation","date":"2018-03-17","arxiv_id":"1803.06540","repositories_listed":1,"syntology":null},{"url":"/paper/deep-models-of-interactions-across-sets","slug":"deep-models-of-interactions-across-sets","title":"Deep Models of Interactions Across Sets","date":"2018-03-07","arxiv_id":"1803.02879","repositories_listed":1,"syntology":null},{"url":"/paper/citytransfer-transferring-inter-and-intra","slug":"citytransfer-transferring-inter-and-intra","title":"CityTransfer: Transferring Inter- and Intra-City Knowledge for Chain Store Site Recommendation based on Multi-Source Urban Data","date":"2018-01-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-with-heterogeneous-side-information","slug":"learning-with-heterogeneous-side-information","title":"Side Information Fusion for Recommender Systems over Heterogeneous Information Network","date":"2018-01-08","arxiv_id":"1801.02411","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-norm-estimation-from-a-few-entries","slug":"matrix-norm-estimation-from-a-few-entries","title":"Matrix Norm Estimation from a Few Entries","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixture-rank-matrix-approximation-for","slug":"mixture-rank-matrix-approximation-for","title":"Mixture-Rank Matrix Approximation for Collaborative Filtering","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-collaborative-recommendation-via-semi","slug":"hybrid-collaborative-recommendation-via-semi","title":"Hybrid Collaborative Recommendation via Semi-AutoEncoder","date":"2017-08-16","arxiv_id":"1706.04453","repositories_listed":1,"syntology":null},{"url":"/paper/the-sample-complexity-of-online-one-class","slug":"the-sample-complexity-of-online-one-class","title":"The Sample Complexity of Online One-Class Collaborative Filtering","date":"2017-05-31","arxiv_id":"1706.00061","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-parity-fairness-objectives-for","slug":"beyond-parity-fairness-objectives-for","title":"Beyond Parity: Fairness Objectives for Collaborative Filtering","date":"2017-05-24","arxiv_id":"1705.08804","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-matrix-factorization-for","slug":"probabilistic-matrix-factorization-for","title":"Probabilistic Matrix Factorization for Automated Machine Learning","date":"2017-05-15","arxiv_id":"1705.05355","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/probabilistic-matrix-factorization-for#ran","syntology_url":"https://syntology.ai/paper/1705.05355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.05355"}},"official":{"repos":["rsheth80/pmf-automl"],"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/representation-learning-and-pairwise-ranking","slug":"representation-learning-and-pairwise-ranking","title":"Representation Learning and Pairwise Ranking for Implicit Feedback in Recommendation Systems","date":"2017-04-29","arxiv_id":"1705.00105","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-pairwise-relations-with-neural","slug":"predicting-pairwise-relations-with-neural","title":"Predicting Pairwise Relations with Neural Similarity Encoders","date":"2017-02-06","arxiv_id":"1702.01824","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-filtering-with-user-item-co","slug":"collaborative-filtering-with-user-item-co","title":"Collaborative Filtering with User-Item Co-Autoregressive Models","date":"2016-12-21","arxiv_id":"1612.07146","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-sparsity-to-build-efficient-kernel","slug":"exploiting-sparsity-to-build-efficient-kernel","title":"Exploiting sparsity to build efficient kernel based collaborative filtering for top-N item recommendation","date":"2016-12-17","arxiv_id":"1612.05729","repositories_listed":1,"syntology":null},{"url":"/paper/top-n-recommendation-on-graphs","slug":"top-n-recommendation-on-graphs","title":"Top-N Recommendation on Graphs","date":"2016-09-27","arxiv_id":"1609.08264","repositories_listed":1,"syntology":null},{"url":"/paper/dictionary-learning-for-massive-matrix","slug":"dictionary-learning-for-massive-matrix","title":"Dictionary Learning for Massive Matrix Factorization","date":"2016-05-03","arxiv_id":"1605.00937","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-scalable-social-recommendation","slug":"accurate-and-scalable-social-recommendation","title":"Accurate and scalable social recommendation using mixed-membership stochastic block models","date":"2016-04-05","arxiv_id":"1604.01170","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-collaborative-filtering-with","slug":"hybrid-collaborative-filtering-with","title":"Hybrid Collaborative Filtering with Autoencoders","date":"2016-03-02","arxiv_id":"1603.00806","repositories_listed":1,"syntology":null},{"url":"/paper/algorithmic-acceleration-of-parallel-als-for","slug":"algorithmic-acceleration-of-parallel-als-for","title":"Algorithmic Acceleration of Parallel ALS for Collaborative Filtering: Speeding up Distributed Big Data Recommendation in Spark","date":"2016-01-10","arxiv_id":"1508.03110","repositories_listed":1,"syntology":null},{"url":"/paper/song-recommendation-with-non-negative-matrix","slug":"song-recommendation-with-non-negative-matrix","title":"Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation","date":"2016-01-08","arxiv_id":"1601.01892","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-matrix-completion-via-adaptive","slug":"bayesian-matrix-completion-via-adaptive","title":"Bayesian Matrix Completion via Adaptive Relaxed Spectral Regularization","date":"2015-12-03","arxiv_id":"1512.01110","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-user-exposure-in-recommendation","slug":"modeling-user-exposure-in-recommendation","title":"Modeling User Exposure in Recommendation","date":"2015-10-23","arxiv_id":"1510.07025","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-matrix-factorization-with-priors-on","slug":"dynamic-matrix-factorization-with-priors-on","title":"Dynamic Matrix Factorization with Priors on Unknown Values","date":"2015-07-23","arxiv_id":"1507.06452","repositories_listed":1,"syntology":null},{"url":"/paper/preference-completion-large-scale","slug":"preference-completion-large-scale","title":"Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons","date":"2015-07-16","arxiv_id":"1507.04457","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/preference-completion-large-scale#ran","syntology_url":"https://syntology.ai/paper/1507.04457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.04457"}},"official":null}},{"url":"/paper/attention-please-a-hybrid-resource","slug":"attention-please-a-hybrid-resource","title":"Attention Please! A Hybrid Resource Recommender Mimicking Attention-Interpretation Dynamics","date":"2015-01-30","arxiv_id":"1501.07716","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-deep-learning-for-recommender","slug":"collaborative-deep-learning-for-recommender","title":"Collaborative Deep Learning for Recommender Systems","date":"2014-09-10","arxiv_id":"1409.2944","repositories_listed":1,"syntology":null},{"url":"/paper/a-random-walk-approach-to-selectional","slug":"a-random-walk-approach-to-selectional","title":"A Random Walk Approach to Selectional Preferences Based on Preference Ranking and Propagation","date":"2013-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-filtering-and-the-missing-at","slug":"collaborative-filtering-and-the-missing-at","title":"Collaborative Filtering and the Missing at Random Assumption","date":"2012-06-20","arxiv_id":"1206.5267","repositories_listed":1,"syntology":null},{"url":"/paper/robust-pca-via-outlier-pursuit","slug":"robust-pca-via-outlier-pursuit","title":"Robust PCA via Outlier Pursuit","date":"2010-10-20","arxiv_id":"1010.4237","repositories_listed":1,"syntology":null},{"url":"/paper/a-gradient-descent-algorithm-on-the-grassman","slug":"a-gradient-descent-algorithm-on-the-grassman","title":"A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion","date":"2009-10-27","arxiv_id":"0910.5260","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-from-noisy-entries","slug":"matrix-completion-from-noisy-entries","title":"Matrix Completion from Noisy Entries","date":"2009-06-11","arxiv_id":"0906.2027","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/matrix-completion-from-noisy-entries#ran","syntology_url":"https://syntology.ai/paper/0906.2027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0906.2027"}},"official":null}},{"url":"/paper/empirical-evaluation-of-four-tensor","slug":"empirical-evaluation-of-four-tensor","title":"Empirical Evaluation of Four Tensor Decomposition Algorithms","date":"2007-11-13","arxiv_id":"0711.2023","repositories_listed":1,"syntology":null},{"url":"/paper/restricted-boltzmann-machines-for","slug":"restricted-boltzmann-machines-for","title":"Restricted Boltzmann Machines for Collaborative Filtering","date":"2007-06-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/slope-one-predictors-for-online-rating-based","slug":"slope-one-predictors-for-online-rating-based","title":"Slope One Predictors for Online Rating-Based Collaborative Filtering","date":"2007-02-24","arxiv_id":"cs/0702144","repositories_listed":1,"syntology":null},{"url":null,"slug":"sgcl-unifying-self-supervised-and-supervised","title":"SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation","date":"2025-07-17","arxiv_id":"2507.13336","repositories_listed":0,"syntology":null},{"url":null,"slug":"corona-a-coarse-to-fine-framework-for-graph","title":"CORONA: A Coarse-to-Fine Framework for Graph-based Recommendation with Large Language Models","date":"2025-06-14","arxiv_id":"2506.17281","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-gap-between-semantic-and-user","title":"Bridging the Gap Between Semantic and User Preference Spaces for Multi-modal Music Representation Learning","date":"2025-05-29","arxiv_id":"2505.23298","repositories_listed":0,"syntology":null},{"url":null,"slug":"light-distillation-for-incremental-graph","title":"Light distillation for Incremental Graph Convolution Collaborative Filtering","date":"2025-05-26","arxiv_id":"2505.19810","repositories_listed":0,"syntology":null},{"url":null,"slug":"lightweight-embeddings-with-graph-rewiring","title":"Lightweight Embeddings with Graph Rewiring for Collaborative Filtering","date":"2025-05-25","arxiv_id":"2505.18999","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictively-combatting-toxicity-in-health","title":"Predictively Combatting Toxicity in Health-related Online Discussions through Machine Learning","date":"2025-05-19","arxiv_id":"2505.17068","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-11318","title":"On the Role of Weight Decay in Collaborative Filtering: A Popularity Perspective","date":"2025-05-16","arxiv_id":"2505.11318","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-and-recommender-behavior-over-time","title":"User and Recommender Behavior Over Time: Contextualizing Activity, Effectiveness, Diversity, and Fairness in Book Recommendation","date":"2025-05-07","arxiv_id":"2505.04518","repositories_listed":0,"syntology":null},{"url":null,"slug":"preserving-privacy-and-utility-in-llm-based","title":"Preserving Privacy and Utility in LLM-Based Product Recommendations","date":"2025-05-02","arxiv_id":"2505.00951","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-universal-user-representations","title":"Learning Universal User Representations Leveraging Cross-domain User Intent at Snapchat","date":"2025-04-30","arxiv_id":"2504.21838","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-sequential-recommendations-exploiting","title":"Optimal Sequential Recommendations: Exploiting User and Item Structure","date":"2025-04-28","arxiv_id":"2504.19476","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-llm-based-recommendation-through","title":"Enhancing LLM-based Recommendation through Semantic-Aligned Collaborative Knowledge","date":"2025-04-14","arxiv_id":"2504.10107","repositories_listed":0,"syntology":null},{"url":null,"slug":"epistemic-uncertainty-aware-recommendation","title":"Epistemic Uncertainty-aware Recommendation Systems via Bayesian Deep Ensemble Learning","date":"2025-04-14","arxiv_id":"2504.10753","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-diffusion-model-for-collaborative","title":"Graph-based Diffusion Model for Collaborative Filtering","date":"2025-04-07","arxiv_id":"2504.05029","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-evaluation-of-large-language-models","title":"Efficient Evaluation of Large Language Models via Collaborative Filtering","date":"2025-04-05","arxiv_id":"2504.08781","repositories_listed":0,"syntology":null},{"url":null,"slug":"fease-shallow-autoencoding-recommender-with","title":"Shallow AutoEncoding Recommender with Cold Start Handling via Side Features","date":"2025-04-03","arxiv_id":"2504.02288","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphs-are-everywhere-psst-in-music","title":"Graphs are everywhere -- Psst! In Music Recommendation too","date":"2025-04-03","arxiv_id":"2504.02598","repositories_listed":0,"syntology":null},{"url":null,"slug":"get-the-agents-drunk-memory-perturbations-in","title":"DrunkAgent: Stealthy Memory Corruption in LLM-Powered Recommender Agents","date":"2025-03-31","arxiv_id":"2503.23804","repositories_listed":0,"syntology":null},{"url":null,"slug":"combigcn-an-effective-gcn-model-for","title":"CombiGCN: An effective GCN model for Recommender System","date":"2025-03-27","arxiv_id":"2503.21471","repositories_listed":0,"syntology":null},{"url":null,"slug":"belightrec-a-lightweight-recommender-system","title":"BeLightRec: A lightweight recommender system enhanced with BERT","date":"2025-03-26","arxiv_id":"2503.20206","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-relevance-an-adaptive-exploration","title":"Beyond Relevance: An Adaptive Exploration-Based Framework for Personalized Recommendations","date":"2025-03-25","arxiv_id":"2503.19525","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-augmented-graph-contrastive","title":"Diffusion-augmented Graph Contrastive Learning for Collaborative Filter","date":"2025-03-20","arxiv_id":"2503.16290","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-tensor-decompositions-for-context","title":"Weighted Tensor Decompositions for Context-aware Collaborative Filtering","date":"2025-03-11","arxiv_id":"2503.08393","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-should-we-expect-non-decreasing-returns","title":"When Should we Expect Non-Decreasing Returns from Data in Prediction Tasks?","date":"2025-03-05","arxiv_id":"2503.03602","repositories_listed":0,"syntology":null},{"url":"/paper/2503-01658","slug":"2503-01658","title":"CoPL: Collaborative Preference Learning for Personalizing LLMs","date":"2025-03-03","arxiv_id":"2503.01658","repositories_listed":0,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/2503-01658#ran","syntology_url":"https://syntology.ai/paper/2503.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01658"}},"official":null}},{"url":null,"slug":"2503-01814","title":"LLMInit: A Free Lunch from Large Language Models for Selective Initialization of Recommendation","date":"2025-03-03","arxiv_id":"2503.01814","repositories_listed":0,"syntology":null},{"url":null,"slug":"hi-series-algorithms-a-hybrid-of-substance","title":"HI-Series Algorithms A Hybrid of Substance Diffusion Algorithm and Collaborative Filtering","date":"2025-03-03","arxiv_id":"2503.01305","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-collaborative-filtering-based","title":"Enhancing Collaborative Filtering-Based Course Recommendations by Exploiting Time-to-Event Information with Survival Analysis","date":"2025-02-27","arxiv_id":"2503.00072","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-large-recommendation-models-via","title":"Training Large Recommendation Models via Graph-Language Token Alignment","date":"2025-02-26","arxiv_id":"2502.18757","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-similarity-item-exploration-and","title":"Joint Similarity Item Exploration and Overlapped User Guidance for Multi-Modal Cross-Domain Recommendation","date":"2025-02-22","arxiv_id":"2502.16068","repositories_listed":0,"syntology":null},{"url":null,"slug":"supergpqa-scaling-llm-evaluation-across-285","title":"SuperGPQA: Scaling LLM Evaluation across 285 Graduate Disciplines","date":"2025-02-20","arxiv_id":"2502.14739","repositories_listed":0,"syntology":null},{"url":null,"slug":"order-agnostic-identifier-for-large-language","title":"Order-agnostic Identifier for Large Language Model-based Generative Recommendation","date":"2025-02-15","arxiv_id":"2502.10833","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-this-model-also-recognize-dogs-zero-shot","title":"Can this Model Also Recognize Dogs? Zero-Shot Model Search from Weights","date":"2025-02-13","arxiv_id":"2502.09619","repositories_listed":0,"syntology":null},{"url":null,"slug":"mim-multi-modal-content-interest-modeling","title":"MIM: Multi-modal Content Interest Modeling Paradigm for User Behavior Modeling","date":"2025-02-01","arxiv_id":"2502.00321","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-diffusion-for-high-order","title":"Hypergraph Diffusion for High-Order Recommender Systems","date":"2025-01-28","arxiv_id":"2501.16722","repositories_listed":0,"syntology":null},{"url":null,"slug":"airtown-a-privacy-preserving-mobile-app-for","title":"AirTOWN: A Privacy-Preserving Mobile App for Real-time Pollution-Aware POI Suggestion","date":"2025-01-23","arxiv_id":"2501.13608","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-user-intent-for-recommendation","title":"Enhancing User Intent for Recommendation Systems via Large Language Models","date":"2025-01-18","arxiv_id":"2501.10871","repositories_listed":0,"syntology":null},{"url":null,"slug":"kgif-optimizing-relation-aware","title":"KGIF: Optimizing Relation-Aware Recommendations with Knowledge Graph Information Fusion","date":"2025-01-07","arxiv_id":"2501.04161","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-application-of-large-language-models-in","title":"The Application of Large Language Models in Recommendation Systems","date":"2025-01-04","arxiv_id":"2501.02178","repositories_listed":0,"syntology":null}],"record_sha256":"daf3a371b5fbdb8d9b752794cf584ba0040b2bdb8c9a97a40de3648fa6925d5b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}