Pith. sign in

REVIEW 4 cited by

One4all User Representation for Recommender Systems in E-commerce

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 2106.00573 v1 pith:IBJGQUP7 submitted 2021-05-24 cs.IR cs.LG

classification cs.IRcs.LG
keywords learningtasksusere-commerceembeddingembeddingsfeaturesgeneral-purpose
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

General-purpose representation learning through large-scale pre-training has shown promising results in the various machine learning fields. For an e-commerce domain, the objective of general-purpose, i.e., one for all, representations would be efficient applications for extensive downstream tasks such as user profiling, targeting, and recommendation tasks. In this paper, we systematically compare the generalizability of two learning strategies, i.e., transfer learning through the proposed model, ShopperBERT, vs. learning from scratch. ShopperBERT learns nine pretext tasks with 79.2M parameters from 0.8B user behaviors collected over two years to produce user embeddings. As a result, the MLPs that employ our embedding method outperform more complex models trained from scratch for five out of six tasks. Specifically, the pre-trained embeddings have superiority over the task-specific supervised features and the strong baselines, which learn the auxiliary dataset for the cold-start problem. We also show the computational efficiency and embedding visualization of the pre-trained features.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. RecRankerEval: A Flexible and Extensible Framework for Top-k LLM-based Recommendation

    cs.IR 2025-07 conditional novelty 6.0 of 10

    A reimplementation of RecRanker shows its pointwise variant's high top-k scores come from ground-truth data leakage in the prompts, and the new RecRankerEval framework finds listwise tuning, DBSCAN sampling, XSimGCL, ...

  2. KERAG_R: Knowledge-Enhanced Retrieval-Augmented Generation for Recommendation

    cs.IR 2025-07 conditional novelty 6.0 of 10

    KERAG_R improves LLM-based top-k recommendation by using a GAT to select relevant KG triples and incorporating them into instruction-tuned prompts, reporting gains over ten baselines on three datasets.

  3. Building a User Foundation Model for the Open Web

    cs.LG 2026-07 conditional novelty 5.0 of 10

    A self-supervised Transformer on short open-web browsing sequences improves production CTR and win-rate models and delivers +2.13% live CTR under RTB latency and privacy constraints.

  4. A Scalable and Efficient Signal Integration System for Job Matching

    cs.LG 2025-07 conditional novelty 4.0 of 10

    STAR integrates fine-tuned LLM embeddings as node features into a large-scale GNN, improving job matching metrics across three LinkedIn products.

Pith tools