DSRS: DELIGHT sequential recommender system
Bibliographic record
Abstract
Sequential recommendation is becoming more critical in a variety of e-commerce platforms. The aim of sequential recommender systems is to model the dynamic preferences of users based on their previous actions and predict what they will do next. The collected user activity logs on real-world platforms could be quite long. This wealth of information provides options to follow users’ actual interests. Prior efforts primarily aimed at providing recommendations following recent behaviors. Meanwhile, the entire sequential data may not be used efficiently since early actions may influence users’ decisions at present. Furthermore, scanning the whole behavior sequence while doing inference for every user is unbearable due to the need for prompt reaction time in real-world applications. To this end, we propose the DELIGHT Sequential Recommender System (DSRS), which takes the above properties into account to recommend the next item the user might be interested in. DSRS divides the entire user behavior sequence into long- and short-term segments and models them through independent networks before integrating their learned representations. In particular, the first network learns user long-term, whereas the second one learns short-term preferences and then combines them for an efficient joint recommendation. Experimental findings across four datasets show that our model outperforms other state-of-the-art sequential models in apprehending long-term dependence.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.004 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".