{"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/43","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":43,"pages_in_order":61,"rows_per_page":100,"rows":[4201,4300],"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/42","next":"/task/recommendation-systems/papers/44","papers":[{"url":null,"slug":"lrsvrg-imc-an-svrg-based-algorithm-for","title":"LRSVRG-IMC: An SVRG-Based Algorithm for LowRank Inductive Matrix Completion","date":"2022-01-21","arxiv_id":"2201.08516","repositories_listed":0,"syntology":null},{"url":null,"slug":"batch-versus-sequential-active-learning-for","title":"Batch versus Sequential Active Learning for Recommender Systems","date":"2022-01-19","arxiv_id":"2201.07571","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-rank-for-push-notifications-using","title":"Learning to Rank For Push Notifications Using Pairwise Expected Regret","date":"2022-01-19","arxiv_id":"2201.07681","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-analysis-framework-for-recommendation","title":"On the Opportunity of Causal Learning in Recommendation Systems: Foundation, Estimation, Prediction and Challenges","date":"2022-01-18","arxiv_id":"2201.06716","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-kg-augmented-models-leverage-knowledge-as","title":"Do KG-augmented Models Leverage Knowledge as Humans Do?","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unintended-bias-in-language-model","title":"Unintended Bias in Language Model-driven Conversational Recommendation","date":"2022-01-17","arxiv_id":"2201.06224","repositories_listed":0,"syntology":null},{"url":null,"slug":"debiased-recommendation-with-user-feature","title":"Debiased Recommendation with User Feature Balancing","date":"2022-01-16","arxiv_id":"2201.06056","repositories_listed":0,"syntology":null},{"url":null,"slug":"doing-more-with-less-overcoming-data-scarcity","title":"Doing More with Less: Overcoming Data Scarcity for POI Recommendation via Cross-Region Transfer","date":"2022-01-16","arxiv_id":"2201.06095","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-conversational-recommendation-2","title":"Improving Conversational Recommendation Systems’ Quality with Context-Aware Item Meta-Information","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-sparse-domain-collaborative","title":"Multi-Sparse-Domain Collaborative Recommendation via Enhanced Comprehensive Aspect Preference Learning","date":"2022-01-16","arxiv_id":"2201.05973","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-bot-play-for-transcript-free","title":"Self-Supervised Bot Play for Transcript-Free Conversational Recommendation with Justification","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-policy-guided-conversational","title":"Towards Policy-Guided Conversational Recommendation with Dialogue Acts","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-of-the-4th-workshop-on-online","title":"Proceedings of the 4th Workshop on Online Recommender Systems and User Modeling -- ORSUM 2021","date":"2022-01-12","arxiv_id":"2201.05156","repositories_listed":0,"syntology":null},{"url":null,"slug":"resource-recommender-system-performance","title":"Graph-Based Recommendation System Enhanced with Community Detection","date":"2022-01-10","arxiv_id":"2201.03622","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-a-mixed-initiative-research","title":"Projection: A Mixed-Initiative Research Process","date":"2022-01-09","arxiv_id":"2201.03107","repositories_listed":0,"syntology":null},{"url":null,"slug":"recomed-a-knowledge-aware-recommender-system","title":"RecoMed: A Knowledge-Aware Recommender System for Hypertension Medications","date":"2022-01-09","arxiv_id":"2201.05461","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-effectiveness-of-sampled-softmax-loss","title":"On the Effectiveness of Sampled Softmax Loss for Item Recommendation","date":"2022-01-07","arxiv_id":"2201.02327","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-recommendation-on-graphs","title":"Attention-Based Recommendation On Graphs","date":"2022-01-04","arxiv_id":"2201.05499","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-dyn-dynamic-graph-representation","title":"Sparse-Dyn: Sparse Dynamic Graph Multi-representation Learning via Event-based Sparse Temporal Attention Network","date":"2022-01-04","arxiv_id":"2201.01384","repositories_listed":0,"syntology":null},{"url":null,"slug":"tencent-mvse-a-large-scale-benchmark-dataset","title":"Tencent-MVSE: A Large-Scale Benchmark Dataset for Multi-Modal Video Similarity Evaluation","date":"2022-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-pareto-efficient-fairness-utility","title":"Toward Pareto Efficient Fairness-Utility Trade-off inRecommendation through Reinforcement Learning","date":"2022-01-01","arxiv_id":"2201.00140","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-bi-directional-global-transition","title":"Exploiting Bi-directional Global Transition Patterns and Personal Preferences for Missing POI Category Identification","date":"2021-12-31","arxiv_id":"2201.00014","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-private-information","title":"Private Private Information","date":"2021-12-29","arxiv_id":"2112.14356","repositories_listed":0,"syntology":null},{"url":null,"slug":"session-based-recommendation-with-hypergraph","title":"Session-based Recommendation with Hypergraph Attention Networks","date":"2021-12-28","arxiv_id":"2112.14266","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-movie-recommendation-system","title":"Comprehensive Movie Recommendation System","date":"2021-12-23","arxiv_id":"2112.12463","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforced-meta-path-selection-for","title":"Automatic Meta-Path Discovery for Effective Graph-Based Recommendation","date":"2021-12-23","arxiv_id":"2112.12845","repositories_listed":0,"syntology":null},{"url":null,"slug":"movie-recommender-system-using-critic","title":"Movie Recommender System using critic consensus","date":"2021-12-22","arxiv_id":"2112.11854","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-gradient-driven-exploration-for","title":"Adversarial Gradient Driven Exploration for Deep Click-Through Rate Prediction","date":"2021-12-21","arxiv_id":"2112.11136","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthetic-data-and-simulators-for","title":"Synthetic Data and Simulators for Recommendation Systems: Current State and Future Directions","date":"2021-12-21","arxiv_id":"2112.11022","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-enhanced-recommender-system","title":"Knowledge graph enhanced recommender system","date":"2021-12-17","arxiv_id":"2112.09425","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-clarification-question","title":"Self-supervised clarification question generation for ambiguous multi-turn conversation","date":"2021-12-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"re-ranking-with-constraints-on-diversified","title":"Re-ranking With Constraints on Diversified Exposures for Homepage Recommender System","date":"2021-12-12","arxiv_id":"2112.07621","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-compatible-reinforcement-learning-for","title":"Edge-Compatible Reinforcement Learning for Recommendations","date":"2021-12-10","arxiv_id":"2112.05812","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-echo-chambers-on-social-media","title":"A Survey on Echo Chambers on Social Media: Description, Detection and Mitigation","date":"2021-12-09","arxiv_id":"2112.05084","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-bot-play-for-conversational","title":"Self-Supervised Bot Play for Conversational Recommendation with Justifications","date":"2021-12-09","arxiv_id":"2112.05197","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-cross-domain-recommender-system-using-deep","title":"A cross-domain recommender system using deep coupled autoencoders","date":"2021-12-08","arxiv_id":"2112.07617","repositories_listed":0,"syntology":null},{"url":null,"slug":"dips-differentiable-policy-for-sketching-in","title":"DiPS: Differentiable Policy for Sketching in Recommender Systems","date":"2021-12-08","arxiv_id":"2112.07616","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-truelearn-using-semantic-knowledge","title":"Semantic TrueLearn: Using Semantic Knowledge Graphs in Recommendation Systems","date":"2021-12-08","arxiv_id":"2112.04368","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-user-preference-learning-for","title":"Cross-domain User Preference Learning for Cold-start Recommendation","date":"2021-12-07","arxiv_id":"2112.03667","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-reinforced-dynamic-representations","title":"Gumble Softmax For User Behavior Modeling","date":"2021-12-06","arxiv_id":"2112.02787","repositories_listed":0,"syntology":null},{"url":null,"slug":"matmat-matrix-factorization-by-matrix-fitting","title":"MatMat: Matrix Factorization by Matrix Fitting","date":"2021-12-06","arxiv_id":"2112.03089","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeromat-solving-cold-start-problem-of","title":"ZeroMat: Solving Cold-start Problem of Recommender System with No Input Data","date":"2021-12-06","arxiv_id":"2112.03084","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-tail-session-based-recommendation-from","title":"Long-Tail Session-based Recommendation from Calibration","date":"2021-12-05","arxiv_id":"2112.02581","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-interest-and-fine-granularity","title":"Multiple Interest and Fine Granularity Network for User Modeling","date":"2021-12-05","arxiv_id":"2112.02591","repositories_listed":0,"syntology":null},{"url":null,"slug":"considering-user-dynamic-preferences-for","title":"Considering user dynamic preferences for mitigating negative effects of long tail in recommender systems","date":"2021-12-04","arxiv_id":"2112.02406","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-systems-when-memory-matters","title":"Recommender systems: when memory matters","date":"2021-12-04","arxiv_id":"2112.02242","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-graph-learning-for-occasional","title":"Self-supervised Graph Learning for Occasional Group Recommendation","date":"2021-12-04","arxiv_id":"2112.02274","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-low-loss-1-bit-quantization-of-user","title":"Towards Low-loss 1-bit Quantization of User-item Representations for Top-K Recommendation","date":"2021-12-03","arxiv_id":"2112.01944","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-robustness-of-deep-reinforcement","title":"Adversarial Robustness of Deep Reinforcement Learning based Dynamic Recommender Systems","date":"2021-12-02","arxiv_id":"2112.00973","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommending-with-recommendations","title":"Recommending with Recommendations","date":"2021-12-02","arxiv_id":"2112.00979","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-gang-of-adversarial-bandits","title":"A Gang of Adversarial Bandits","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-distribution-alignment-via-stein","title":"Leveraging Distribution Alignment via Stein Path for Cross-Domain Cold-Start Recommendation","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-algorithms-for-stochastic-contextual","title":"Optimal Algorithms for Stochastic Contextual Preference Bandits","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"miss-multi-interest-self-supervised-learning","title":"MISS: Multi-Interest Self-Supervised Learning Framework for Click-Through Rate Prediction","date":"2021-11-30","arxiv_id":"2111.15068","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-drives-readership-an-online-study-on","title":"What Drives Readership? An Online Study on User Interface Types and Popularity Bias Mitigation in News Article Recommendations","date":"2021-11-29","arxiv_id":"2111.14467","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-training-recommender-systems-via","title":"Pre-training Recommender Systems via Reinforced Attentive Multi-relational Graph Neural Network","date":"2021-11-28","arxiv_id":"2111.14036","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-recommender-system-inspired-cloud-data","title":"A Recommender System-Inspired Cloud Data Filling Scheme for Satellite-based Coastal Observation","date":"2021-11-27","arxiv_id":"2111.13955","repositories_listed":0,"syntology":null},{"url":null,"slug":"job-recommender-systems-a-review","title":"Job Recommender Systems: A Review","date":"2021-11-26","arxiv_id":"2111.13576","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-path-exploration","title":"Reinforcement Learning based Path Exploration for Sequential Explainable Recommendation","date":"2021-11-24","arxiv_id":"2111.12262","repositories_listed":0,"syntology":null},{"url":null,"slug":"blockchain-based-recommender-systems","title":"Blockchain-based Recommender Systems: Applications, Challenges and Future Opportunities","date":"2021-11-22","arxiv_id":"2111.11509","repositories_listed":0,"syntology":null},{"url":null,"slug":"citation-network-applications-in-a-scientific","title":"Citation network applications in a scientific co-authorship recommender system","date":"2021-11-22","arxiv_id":"2111.15466","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-social-recommendation-with-graph","title":"Federated Social Recommendation with Graph Neural Network","date":"2021-11-21","arxiv_id":"2111.10778","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-enhanced-global-disentangled-graph","title":"Edge-Enhanced Global Disentangled Graph Neural Network for Sequential Recommendation","date":"2021-11-20","arxiv_id":"2111.10539","repositories_listed":0,"syntology":null},{"url":null,"slug":"quaternion-based-graph-convolution-network","title":"Quaternion-Based Graph Convolution Network for Recommendation","date":"2021-11-20","arxiv_id":"2111.10536","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-min-grouped-bandits","title":"Max-Min Grouped Bandits","date":"2021-11-17","arxiv_id":"2111.08862","repositories_listed":0,"syntology":null},{"url":null,"slug":"barcor-towards-a-unified-framework-for","title":"BARCOR: Towards A Unified Framework for Conversational Recommendation","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compressive-features-in-offline-reinforcement","title":"Compressive Features in Offline Reinforcement Learning for Recommender Systems","date":"2021-11-16","arxiv_id":"2111.08817","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-space-hierarchical-learning-for-goal","title":"Dual-space Hierarchical Learning for Goal-guided Conversational Recommendation","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-more-from-less-improving-conversational","title":"Learn More from Less: Improving Conversational Recommender Systems via Contextual and Time-Aware Modeling","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-training-graph-neural-network-for-cross","title":"Pre-training Graph Neural Network for Cross Domain Recommendation","date":"2021-11-16","arxiv_id":"2111.08268","repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-textual-reviews-in-latent-factor","title":"Utilizing Textual Reviews in Latent Factor Models for Recommender Systems","date":"2021-11-16","arxiv_id":"2111.08538","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-deep-neural-networks-for","title":"Evolving Deep Neural Networks for Collaborative Filtering","date":"2021-11-15","arxiv_id":"2111.07758","repositories_listed":0,"syntology":null},{"url":null,"slug":"conversational-recommendation-theoretical","title":"Conversational Recommendation: Theoretical Model and Complexity Analysis","date":"2021-11-10","arxiv_id":"2111.05578","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-optimization-for-value","title":"Multi-Objective Optimization for Value-Sensitive and Sustainable Basket Recommendations","date":"2021-11-10","arxiv_id":"2111.05944","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-mitigating-multi-sided","title":"Understanding and Mitigating Multi-Sided Exposure Bias in Recommender Systems","date":"2021-11-10","arxiv_id":"2111.05564","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-parameterized-network-for-ctr-1","title":"Dynamic Parameterized Network for CTR Prediction","date":"2021-11-09","arxiv_id":"2111.04983","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-next-application-prediction-with","title":"Improving Next-Application Prediction with Deep Personalized-Attention Neural Network","date":"2021-11-09","arxiv_id":"2111.11296","repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-advantage-actor-critic-for","title":"Supervised Advantage Actor-Critic for Recommender Systems","date":"2021-11-05","arxiv_id":"2111.03474","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-attention-networks-for-distilling","title":"Conditional Attention Networks for Distilling Knowledge Graphs in Recommendation","date":"2021-11-03","arxiv_id":"2111.02100","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-data-relabeling-for-robust-and","title":"Collaborative Data Relabeling for Robust and Diverse Voice Apps Recommendation in Intelligent Personal Assistants","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-explanations-of-recommendations","title":"Comparative Explanations of Recommendations","date":"2021-11-01","arxiv_id":"2111.00670","repositories_listed":0,"syntology":null},{"url":"/paper/crfr-improving-conversational-recommender","slug":"crfr-improving-conversational-recommender","title":"CRFR: Improving Conversational Recommender Systems via Flexible Fragments Reasoning on Knowledge Graphs","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"single-item-fashion-recommender-towards-cross","title":"Single-Item Fashion Recommender: Towards Cross-Domain Recommendations","date":"2021-11-01","arxiv_id":"2111.00758","repositories_listed":0,"syntology":null},{"url":null,"slug":"urir-recommendation-algorithm-of-user-rnn","title":"URIR: Recommendation algorithm of user RNN encoder and item encoder based on knowledge graph","date":"2021-11-01","arxiv_id":"2111.00739","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-top-n-item-recommendations-by-peer","title":"Enhancing Top-N Item Recommendations by Peer Collaboration","date":"2021-10-31","arxiv_id":"2111.00429","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-pure-exploration-in-kernel","title":"Collaborative Pure Exploration in Kernel Bandit","date":"2021-10-29","arxiv_id":"2110.15771","repositories_listed":0,"syntology":null},{"url":null,"slug":"choosing-the-best-of-both-worlds-diverse-and","title":"Choosing the Best of Both Worlds: Diverse and Novel Recommendations through Multi-Objective Reinforcement Learning","date":"2021-10-28","arxiv_id":"2110.15097","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-batch-negative-sampling-for-training","title":"Cross-Batch Negative Sampling for Training Two-Tower Recommenders","date":"2021-10-28","arxiv_id":"2110.15154","repositories_listed":0,"syntology":null},{"url":null,"slug":"d2rlir-an-improved-and-diversified-ranking","title":"D2RLIR : an improved and diversified ranking function in interactive recommendation systems based on deep reinforcement learning","date":"2021-10-28","arxiv_id":"2110.15089","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-intrinsic-to-counterfactual-on-the","title":"From Intrinsic to Counterfactual: On the Explainability of Contextualized Recommender Systems","date":"2021-10-28","arxiv_id":"2110.14844","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-sided-fairness-in-rankings-via-lorenz","title":"Two-sided fairness in rankings via Lorenz dominance","date":"2021-10-28","arxiv_id":"2110.15781","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-review-based-recommenders","title":"Dynamic Review-based Recommenders","date":"2021-10-27","arxiv_id":"2110.14747","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-faceted-hierarchical-multi-task","title":"Multi-Faceted Hierarchical Multi-Task Learning for a Large Number of Tasks with Multi-dimensional Relations","date":"2021-10-26","arxiv_id":"2110.13365","repositories_listed":0,"syntology":null},{"url":null,"slug":"dare-a-cross-domain-recommender-system-with","title":"Review-Based Domain Disentanglement without Duplicate Users or Contexts for Cross-Domain Recommendation","date":"2021-10-25","arxiv_id":"2110.12648","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-systems-meet-mechanism-design","title":"Recommender Systems meet Mechanism Design","date":"2021-10-25","arxiv_id":"2110.12558","repositories_listed":0,"syntology":null},{"url":null,"slug":"mic-model-agnostic-integrated-cross-channel","title":"MIC: Model-agnostic Integrated Cross-channel Recommenders","date":"2021-10-22","arxiv_id":"2110.11570","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiplication-avoiding-variant-of-power","title":"Multiplication-Avoiding Variant of Power Iteration with Applications","date":"2021-10-22","arxiv_id":"2110.12065","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-real-time-energy-and-cost-efficient-vehicle","title":"A Real-Time Energy and Cost Efficient Vehicle Route Assignment Neural Recommender System","date":"2021-10-21","arxiv_id":"2110.10887","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scale-invariant-ranking-function-for","title":"A scale invariant ranking function for learning-to-rank: a real-world use case","date":"2021-10-21","arxiv_id":"2110.11259","repositories_listed":0,"syntology":null},{"url":null,"slug":"locality-sensitive-experience-replay-for","title":"Locality-Sensitive Experience Replay for Online Recommendation","date":"2021-10-21","arxiv_id":"2110.10850","repositories_listed":0,"syntology":null}],"record_sha256":"d9013728074fb442ccda0d0bda34d23db5cf86ed120c0ebc683d751e2417e3a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}