{"total":32,"rows":[{"id":"2106.09373","title":"Unsupervised Path Representation Learning with Curriculum Negative Sampling","created":"2021-06-17","cited_by_count":42,"area":null},{"id":"2405.11272","title":"Double Correction Framework for Denoising Recommendation","created":"2024-05-18","cited_by_count":19,"area":null},{"id":"2302.03472","title":"On the Theories Behind Hard Negative Sampling for Recommendation","created":"2023-02-07","cited_by_count":18,"area":null},{"id":"2402.17238","title":"Does Negative Sampling Matter? A Review with Insights into its Theory and Applications","created":"2024-02-27","cited_by_count":15,"area":null},{"id":"2409.18721","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","created":"2024-09-27","cited_by_count":15,"area":null},{"id":"2410.18870","title":"End-to-end Training for Recommendation with Language-based User Profiles","created":"2024-10-24","cited_by_count":10,"area":null},{"id":"2403.17259","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","created":"2024-03-25","cited_by_count":9,"area":null},{"id":"2408.02354","title":"RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenders","created":"2024-08-05","cited_by_count":9,"area":null},{"id":"2308.06091","title":"Toward a Better Understanding of Loss Functions for Collaborative Filtering","created":"2023-08-11","cited_by_count":8,"area":null},{"id":"2111.11026","title":"Learning Explicit User Interest Boundary for Recommendation","created":"2021-11-22","cited_by_count":6,"area":null},{"id":"2202.13140","title":"Consensus Learning from Heterogeneous Objectives for One-Class Collaborative Filtering","created":"2022-02-26","cited_by_count":5,"area":null},{"id":"2306.10047","title":"Neighborhood-based Hard Negative Mining for Sequential Recommendation","created":"2023-06-12","cited_by_count":5,"area":null},{"id":"2312.08520","title":"Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)","created":"2023-12-13","cited_by_count":5,"area":null},{"id":"2508.05657","title":"Beyond Single Labels: Improving Conversational Recommendation through LLM-Powered Data Augmentation","created":"2025-07-30","cited_by_count":5,"area":null},{"id":"2405.00287","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","created":"2024-05-01","cited_by_count":4,"area":null},{"id":"2409.10343","title":"Large Language Model Enhanced Hard Sample Identification for Denoising Recommendation","created":"2024-09-16","cited_by_count":3,"area":null},{"id":"2306.15905","title":"Dimension Independent Mixup for Hard Negative Sample in Collaborative Filtering","created":"2023-06-28","cited_by_count":2,"area":null},{"id":"2505.17631","title":"BehaveGPT: A Foundation Model for Large-scale User Behavior Modeling","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2204.06520","title":"Bayesian Negative Sampling for Recommendation","created":"2022-04-02","cited_by_count":1,"area":null},{"id":"2305.16391","title":"Graph-Based Model-Agnostic Data Subsampling for Recommendation Systems","created":"2023-05-25","cited_by_count":1,"area":null},{"id":"2305.20002","title":"Representer Point Selection for Explaining Regularized High-dimensional Models","created":"2023-05-31","cited_by_count":1,"area":null},{"id":"2407.17070","title":"Curriculum Negative Mining For Temporal Networks","created":"2024-07-24","cited_by_count":1,"area":null},{"id":"2105.04769","title":"Scalable Personalised Item Ranking through Parametric Density Estimation","created":"2021-05-11","cited_by_count":0,"area":null},{"id":"2208.14594","title":"One-class Recommendation Systems with the Hinge Pairwise Distance Loss and Orthogonal Representations","created":"2022-08-31","cited_by_count":0,"area":null},{"id":"2311.05864","title":"DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loops","created":"2023-11-10","cited_by_count":0,"area":null},{"id":"2312.08517","title":"(Debiased) Contrastive Learning Loss for Recommendation (Technical Report)","created":"2023-12-13","cited_by_count":0,"area":null},{"id":"2408.00326","title":"Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity","created":"2024-08-01","cited_by_count":0,"area":null},{"id":"2502.08161","title":"MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendation","created":"2025-02-12","cited_by_count":0,"area":null},{"id":"2505.17615","title":"Large language model as user daily behavior data generator: balancing population diversity and individual personality","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2511.07295","title":"Hard vs. Noise: Resolving Hard-Noisy Sample Confusion in Recommender Systems via Large Language Models","created":"2025-11-10","cited_by_count":0,"area":null},{"id":"2606.01783","title":"Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2607.00448","title":"Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval","created":"2026-07-01","cited_by_count":0,"area":null}],"next_cursor":null}