Pith. sign in

REVIEW 7 cited by

Self-Attentive Sequential Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1808.09781 v1 pith:2DBBRGE3 submitted 2018-08-20 cs.IR cs.LG

Self-Attentive Sequential Recommendation

classification cs.IR cs.LG
keywords modeldatasetssequentialactionscapturernnsactionapproaches
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Sequential dynamics are a key feature of many modern recommender systems, which seek to capture the `context' of users' activities on the basis of actions they have performed recently. To capture such patterns, two approaches have proliferated: Markov Chains (MCs) and Recurrent Neural Networks (RNNs). Markov Chains assume that a user's next action can be predicted on the basis of just their last (or last few) actions, while RNNs in principle allow for longer-term semantics to be uncovered. Generally speaking, MC-based methods perform best in extremely sparse datasets, where model parsimony is critical, while RNNs perform better in denser datasets where higher model complexity is affordable. The goal of our work is to balance these two goals, by proposing a self-attention based sequential model (SASRec) that allows us to capture long-term semantics (like an RNN), but, using an attention mechanism, makes its predictions based on relatively few actions (like an MC). At each time step, SASRec seeks to identify which items are `relevant' from a user's action history, and use them to predict the next item. Extensive empirical studies show that our method outperforms various state-of-the-art sequential models (including MC/CNN/RNN-based approaches) on both sparse and dense datasets. Moreover, the model is an order of magnitude more efficient than comparable CNN/RNN-based models. Visualizations on attention weights also show how our model adaptively handles datasets with various density, and uncovers meaningful patterns in activity sequences.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Self-Attentive model for Knowledge Tracing

    cs.LG 2019-07 unverdicted novelty 7.0

    SAKT uses self-attention to focus on relevant prior KCs for performance prediction and reports 4.43% average AUC improvement over DKT and DKVMN on real datasets.

  2. LLM-Based User Personas for Recommendations at Scale

    cs.IR 2026-06 unverdicted novelty 6.0

    A framework for real-time LLM-based user interest personas in large-scale video recommendations, using distillation, async inference, and video clustering to balance interests with novel topics and improve viewer valu...

  3. From Bootstrapping to Sequence Modeling: A Unified Generative Framework for Personalized Landing-Page Modeling

    cs.IR 2026-06 unverdicted novelty 5.0

    GLAN replaces CQL bootstrapping with Decision Transformer sequence modeling for PLPM, using global inter-day (L-RTG) and local session (HRM) modules to achieve +0.158% DAU and +0.108% LT gains in Kuaishou online tests.

  4. DUET -- Dual User Embedding Transformers for Offsite Conversion Prediction

    cs.LG 2026-06 unverdicted novelty 5.0

    DUET pre-trains dedicated transformers for click and conversion streams, yielding up to 0.38% NE reduction over baselines in OCVR prediction.

  5. VirtualMLE: A Virtual ML Engineer that Optimizes Sequential Recommenders

    cs.IR 2026-06 unverdicted novelty 5.0

    VirtualMLE deploys an LLM agent with execution-reflection-memory to tune sequential recommenders, reaching competitive quality on Amazon benchmarks with fewer trials and transferring heuristics across datasets.

  6. TwiSTAR:Think Fast, Think Slow, Then Act,Generative Recommendation with Adaptive Reasoning

    cs.IR 2026-05 unverdicted novelty 5.0

    TwiSTAR learns to switch between fast SID retrieval and slow rationale-generating reasoning in generative recommendation, yielding better accuracy-latency trade-offs on three datasets.

  7. Pre-trained LLMs Meet Sequential Recommenders: Efficient User-Centric Knowledge Distillation

    cs.IR 2026-04 unverdicted novelty 4.0

    A distillation technique embeds LLM-generated textual user profiles into efficient sequential recommenders without runtime LLM inference, architectural changes, or fine-tuning.