paper-with-me

홈 › Papers

Pacer and Runner: Cooperative Learning Framework between Single- and Cross-Domain Sequential Recommendation

2024-07-15 · Chung Park, Taesan Kim, Hyungjun Yoon, Junui Hong, Yelim Yu, Mincheol Cho, Minsung Choi, Jaegul Choo

Cross-Domain Sequential Recommendation (CDSR) improves recommendation performance by utilizing information from multiple domains, which contrasts with Single-Domain Sequential Recommendation (SDSR) that relies on a historical interaction within a specific domain. However, CDSR may underperform compared to the SDSR approach in certain domains due to negative transfer, which occurs when there is a lack of relation between domains or different levels of data sparsity. To address the issue of negative transfer, our proposed CDSR model estimates the degree of negative transfer of each domain and adaptively assigns it as a weight factor to the prediction loss, to control gradient flows through domains with significant negative transfer. To this end, our model compares the performance of a model trained on multiple domains (CDSR) with a model trained solely on the specific domain (SDSR) to evaluate the negative transfer of each domain using our asymmetric cooperative network. In addition, to facilitate the transfer of valuable cues between the SDSR and CDSR tasks, we developed an auxiliary loss that maximizes the mutual information between the representation pairs from both tasks on a per-domain basis. This cooperative learning between SDSR and CDSR tasks is similar to the collaborative dynamics between pacers and runners in a marathon. Our model outperformed numerous previous works in extensive experiments on two real-world industrial datasets across ten service domains. We also have deployed our model in the recommendation system of our personal assistant app service, resulting in 21.4% increase in click-through rate compared to existing models, which is valuable to real-world business.

📄 PDF Abstract BibTeX arXiv:2407.11245

Code (1)

cpark88/syncrec 공식 구현 pytorch

Tasks

Sequential Recommendation

Methods 이 논문이 사용한 방법론

Golden Queue Managers 설명 없음

Similar Papers 제목 키워드 기반

Optimal number of spacers in CRISPR arrays

2017-05-30

We estimate the number of spacers in a CRISPR array of a bacterium which maximizes its protection against a viral attack. The optimality follows from a competition between two trends: too few distinct spacers make the ba…

Will People Enjoy a Robot Trainer? A Case Study with Snoopie the Pacerbot

2026-04-20 · Maximilian Du, Jennifer Grannen, Shuran Song, Dorsa Sadigh arxiv

The physicality of exercise makes the role of athletic trainers unique. Their physical presence allows them to guide a student through a motion, demonstrate an exercise, and give intuitive feedback. Robot quadrupeds are …

Heterologous autoimmunity and prokaryotic immune defense

2021-01-04 · Hanrong Chen, Andreas Mayer, Vijay Balasubramanian

Some prokaryotes possess CRISPR-Cas systems that provide adaptive immunity to viruses guided by DNA segments called spacers acquired from invading phage. However, the patchy incidence and limited memory breadth of CRISPR…

Relation

Runner re-identification from single-view running video in the open-world setting

2023-10-18 · Tomohiro Suzuki, Kazushi Tsutsui, Kazuya Takeda, Keisuke Fujii

In many sports, player re-identification is crucial for automatic video processing and analysis. However, most of the current studies on player re-identification in multi- or single-view sports videos focus on re-identif…

PACER: Preference-conditioned All-terrain Costmap Generation

2024-10-30 · Luisa Mao, Garrett Warnell, Peter Stone, Joydeep Biswas

In autonomous robot navigation, terrain cost assignment is typically performed using a semantics-based paradigm in which terrain is first labeled using a pre-trained semantic classifier and costs are then assigned accord…

AllRepresentation LearningRobot Navigation