arXiv (All)
open access
Closing the Long-Short View Gap in Sequential Recommendation without Cached History
Sequential recommenders are typically trained on long user histories to capture rich behavioral signals, yet serving with training-length sequences is often impractical due to real-time efficiency constraints. Directly using only recent behaviors leads to a severe performance drop. To bridge this ga
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- TAAL: Mitigating Early Beam Pruning in Generative Recommendation via Temporal Autoregressive Alignment#793998
- TAAL: Mitigating Early Beam Pruning in Generative Recommendation via Temporal Autoregressive Alignment#789979
- SURF: Subtractive Updates for Recommender Forgetting#1012866
- MuSeR: Scalable Long-sequence Recommendation with Multi-interest Modeling#1049414
- FLAME: Condensing Ensemble Diversity into a Single Network for Efficient Sequential Recommendation#670549
Record · ID 973816
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive