Pith. sign in

REVIEW 12 cited by

ActionPiece: Contextually Tokenizing Action Sequences for Generative Recommendation

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2502.13581 v3 pith:Z45ZXP7E submitted 2025-02-19 cs.IR cs.LG

Yupeng Hou , Jianmo Ni , Zhankui He , Noveen Sachdeva , Wang-Cheng Kang , Ed H. Chi , Julian McAuley , Derek Zhiyuan Cheng This is my paper
classification cs.IRcs.LG
keywords actionsequencesactionpiecesamesetsacrossactionsconsidering
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Generative recommendation (GR) is an emerging paradigm where user actions are tokenized into discrete token patterns and autoregressively generated as predictions. However, existing GR models tokenize each action independently, assigning the same fixed tokens to identical actions across all sequences without considering contextual relationships. This lack of context-awareness can lead to suboptimal performance, as the same action may hold different meanings depending on its surrounding context. To address this issue, we propose ActionPiece to explicitly incorporate context when tokenizing action sequences. In ActionPiece, each action is represented as a set of item features. Given the action sequence corpora, we construct the vocabulary by merging feature patterns as new tokens, based on their co-occurrence frequency both within individual sets and across adjacent sets. Considering the unordered nature of feature sets, we further introduce set permutation regularization, which produces multiple segmentations of action sequences with the same semantics. Our code is available at: https://github.com/google-deepmind/action_piece.

Discussion (0). Sign in to comment.

Forward citations

Cited by 12 Pith papers

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

  1. Hierarchical Residual Policy Optimization for Generative Recommendations

    cs.IR 2026-08 conditional novelty 6.0 of 10

    HRPO decomposes item-level rewards into token-level 'residual credits' along semantic identifier hierarchies and optimizes the generator with a PPO-style objective, improving session utility in KuaiSim and production ...

  2. From Understanding to Action: Feedback-Grounded Policy Discovery for Generative Recommendation

    cs.IR 2026-07 conditional novelty 6.0 of 10

    A feedback-grounded framework discovers recommendation policies by their measured advantage over intent-only baselines and distills them into two latent tokens of a lightweight Semantic-ID recommender.

  3. Can Generative Recommendation Reach Cold Items? A Temporal Perspective on Semantic-ID Generation

    cs.AI 2026-07 conditional novelty 6.0 of 10

    Under a strict time-ordered evaluation, semantic-ID generative recommenders nearly always fail to retrieve items that appear after training, succeeding only for cold items with already-observed tokens and deep prefixes.

  4. Bridging the Structural Gap: Adapting Autoregressive Generation for Recommendation

    cs.IR 2026-07 conditional novelty 6.0 of 10

    BARGE improves generative sequential recommendation by restoring item boundaries in the encoder and suppressing hierarchical semantic drift in decoding, outperforming prior generative baselines on public and industria...

  5. Beyond Fixed Depths and Widths: Optimizing Textual Decoding Tries in LLM-based Generative Recommendation

    cs.IR 2026-07 conditional novelty 6.0 of 10

    BONSAI constructs variable-depth, low-branching decoding tries for LLM-based generative recommendation and reports 16–22% relative gains over state-of-the-art baselines.

  6. An Embarrassingly Simple Graph Heuristic Reveals Shortcut-Solvable Benchmarks for Sequential Recommendation

    cs.IR 2026-05 conditional novelty 6.0 of 10

    A simple graph heuristic without training or sequence encoders matches or outperforms trained generative recommenders on 10 of 14 sequential recommendation benchmarks by exploiting local transition and feature shortcuts.

  7. CapsID: Soft-Routed Variable-Length Semantic IDs for Generative Recommendation

    cs.IR 2026-05 unverdicted novelty 6.0 of 10

    CapsID uses probabilistic capsule routing and confidence-based termination to generate variable-length semantic IDs, improving recall by 9.6% over strong baselines with half the latency of dual-representation systems.

  8. Position-Aware Drafting for Inference Acceleration in LLM-Based Generative List-Wise Recommendation

    cs.IR 2026-04 unverdicted novelty 6.0 of 10

    PAD-Rec augments standard draft models with item-position and step-position embeddings plus learnable gates, delivering up to 3.1x wall-clock speedup and 5% average gain over strong speculative-decoding baselines on f...

  9. Multi-LLM Token Filtering and Routing for Sequential Recommendation

    cs.IR 2026-04 unverdicted novelty 6.0 of 10

    MLTFR combines user-guided token filtering with a multi-LLM mixture-of-experts and Fisher-weighted consensus expert to deliver stable gains in corpus-free sequential recommendation.

  10. Unleash the Potential of Long Semantic IDs for Generative Recommendation

    cs.IR 2026-02 conditional novelty 6.0 of 10

    A cross-attention merger compresses 32-token OPQ semantic IDs into 4 latent tokens, and an intent token trained with token-level and item-level objectives improves next-item recommendation.

  11. RecoWorld: Building Simulated Environments for Agentic Recommender Systems

    cs.IR 2025-09 conditional novelty 5.0 of 10

    A design proposal, not a tested system: a dual-view simulation loop in which an LLM-simulated user issues reflective instructions when about to disengage, and an instruction-following recommender adapts to maximize si...

  12. Coarse-to-Fine Long-term Interest Modeling for Generative Recommendation

    cs.IR 2026-02 conditional novelty 4.0 of 10

    GLASS extends generative retrieval with a tiered long-term interest vector and a first-SID-keyed search of long histories, reporting consistent gains over Tiger and DualGR on two public datasets.

Pith tools