REVIEW 3 cited by
DV365: Extremely Long User History Modeling at Instagram
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
read the original abstract
Long user history is highly valuable signal for recommendation systems, but effectively incorporating it often comes with high cost in terms of data center power consumption and GPU. In this work, we chose offline embedding over end-to-end sequence length optimization methods to enable extremely long user sequence modeling as a cost-effective solution, and propose a new user embedding learning strategy, multi-slicing and summarization, that generates highly generalizable user representation of user's long-term stable interest. History length we encoded in this embedding is up to 70,000 and on average 40,000. This embedding, named as DV365, is proven highly incremental on top of advanced attentive user sequence models deployed in Instagram. Produced by a single upstream foundational model, it is launched in 15 different models across Instagram and Threads with significant impact, and has been production battle-proven for >1 year since our first launch.
Forward citations
Cited by 3 Pith papers
-
TokenMinds: Pretrained User Tokens and Embeddings for User Understanding in Large Recommender Systems
TokenMinds extends Semantic ID tokenization from items to users, producing paired discrete tokens and dense embeddings via an LLM-adapted encoder-decoder for industrial recommendation.
-
Fine-Tuned LLM as a Complementary Predictor Improving Ads System
Fine-tuned LLM acts as ancillary advertiser predictor in production ads RecSys, augmenting retrieval and ranking with measurable offline and online gains.
-
Efficient Dataset Selection for Continual Adaptation of Generative Recommenders
Gradient-based representations paired with distribution-matching enable efficient curation of small data subsets that improve performance and training efficiency for continually adapting generative recommenders while ...
Discussion (0). Sign in to comment.