EDBT 2026 Demo / reviewers in the wild / expert
Jiajing Xu 0003
dblp:10/5731-3
· DBLP profile ↗
11ranked-venue papers in the field
1as first author
9since 2021 · last 2025
0000-0002-4761-5171ORCID · verified
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 9 (1 first)Data Mining & Knowledge Discovery · 2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | TransAct V2: Lifelong User Action Sequence Modeling on Pinterest RecommendationabstractModeling user action sequences has become a popular focus in industrial recommendation system research, particularly for Click-Through Rate (CTR) prediction tasks. However, industry-scale CTR models often rely on short user sequences, limiting their ability to capture long-term behavior. They also rarely address the infrastructure challenges involved in efficiently serving large-scale sequential models. Additionally, these models typically lack an integrated action-prediction task within a point-wise ranking framework, reducing their predictive power. We introduce TransAct V2, a production model for Pinterest's Homefeed ranking system, featuring three key innovations: (1) leveraging very long user sequences to improve CTR predictions, (2) employing scalable, low-latency deployment solutions tailored to handle the computational demands of extended user action sequences, and (3) integrating a Next Action Loss function for enhanced user action forecasting. To overcome latency and storage constraints, we leverage efficient data-processing strategies and model-serving optimizations, enabling seamless industrial-scale deployment. Our approach's effectiveness is further demonstrated through ablation studies. Furthermore, extensive offline and online A/B experiments confirm major gains in key metrics, including engagement volume and recommendation diversity, showcasing TransAct V2's real-world impact. Xue Xia 0007, Saurabh Vishwas Joshi, Kousik Rajesh, Kangnan Li, Yangyi Lu, Nikil Pancha, Dhruvil Deven Badani, Jiajing Xu 0003, Pong Eksombatchai |
CIKM | 8 |
| 2025 | Autoregressive Generative Retrieval for Industrial-Scale Recommendations at Pinterest
Prabhat Agarwal, Anirudhan Badrinath, Laksh Bhasin, Jaewon Yang, Jiajing Xu 0003, Charles Rosenberg 0001 |
CIKM | 5 |
| 2025 | OmniSage: Large Scale, Multi-Entity Heterogeneous Graph Representation LearningabstractRepresentation learning, a task of learning latent vectors to represent entities, is a key task in improving search and recommender systems in web applications. Various representation learning methods have been developed, including graph-based approaches for relationships among entities, sequence-based methods for capturing the temporal evolution of user activities, and content-based models for leveraging text and visual content. However, the development of a unifying framework that integrates these diverse techniques to support multiple applications remains a significant challenge. This paper presents OmniSage, a large-scale representation framework that learns universal representations for a variety of applications at Pinterest. OmniSage integrates graph neural networks with content-based models and user sequence models by employing multiple contrastive learning tasks to effectively process graph data, user sequence data, and content signals. To support the training and inference of OmniSage, we developed an efficient infrastructure capable of supporting Pinterest graphs with billions of nodes. The universal representations generated by OmniSage have significantly enhanced user experiences on Pinterest, leading to an approximate 2.5% increase in sitewide repins (saves) across five applications. This paper highlights the impact of unifying representation learning methods, and we make the model code publicly available at https://github.com/pinterest/atg-research/tree/main/omnisage. Anirudhan Badrinath, Alex Yang, Kousik Rajesh, Prabhat Agarwal, Jaewon Yang, Jiajing Xu 0003, Charles Rosenberg 0001 |
KDD (2) | 7 |
| 2025 | PinFM: Foundation Model for User Activity Sequences at a Billion-scale Visual Discovery PlatformabstractUser activity sequences have emerged as one of the most important signals in recommender systems.We present a foundational model, PinFM, for understanding user activity sequences across multiple applications at a billion-scale visual discovery platform.We pretrain a transformer model with 20B+ parameters using extensive user activity data, then fine-tune it for specific applications, efficiently coupling it with existing models.While this pretrainingand-fine-tuning approach has been popular in other domains, such as Vision and NLP, its application in industrial recommender systems presents numerous challenges.The foundational model must be scalable enough to score millions of items every second while meeting tight cost and latency constraints imposed by these systems,.Additionally, it should capture the interactions between user activities and other features and handle new items that were not present during the pretraining stage.We developed innovative techniques to address these challenges.Our infrastructure and algorithmic optimizations, such as the Deduplicated Cross-Attention Transformer (DCAT), improved our throughput by 600% on Pinterest internal data.We demonstrate that PinFM can learn interactions between user sequences and candidate items * Work done at Pinterest. Xiangyi Chen, Kousik Rajesh, Matthew Lawhon, Zelun Wang, Haomiao Li, Saurabh Vishwas Joshi, Pong Eksombatchai, Jaewon Yang, Yi-Ping Hsu, Jiajing Xu 0003, Charles Rosenberg 0001 |
RecSys | 11 |
| 2025 | Deep Reinforcement Learning for Ranking Utility Tuning in the Ad Recommender System at Pinterest
Mehdi Ayed, Longyu Zhao, Abraham Engle, Jinfeng Zhuang, Ling Leng, Jiajing Xu 0003, Charles Rosenberg 0001, Prathibha Deshikachar |
RecSys | 9 |
| 2024 | Taming the One-Epoch Phenomenon in Online Recommendation System by Two-stage Contrastive ID Pre-trainingabstractID-based embeddings are widely used in web-scale online recommendation systems. However, their susceptibility to overfitting, particularly due to the long-tail nature of data distributions, often limits training to a single epoch, a phenomenon known as the "one-epoch problem." This challenge has driven research efforts to optimize performance within the first epoch by enhancing convergence speed or feature sparsity. In this study, we introduce a novel two-stage training strategy that incorporates a pre-training phase using a minimal model with contrastive loss, enabling broader data coverage for the embedding system. Our offline experiments demonstrate that multi-epoch training during the pre-training phase does not lead to overfitting, and the resulting embeddings improve online generalization when fine-tuned for more complex downstream recommendation tasks. We deployed the proposed system in live traffic at Pinterest, achieving significant site-wide engagement gains. Yi-Ping Hsu, Po-Wei Wang, Pong Eksombatchai, Jiajing Xu 0003 |
RecSys | 4 |
| 2024 | Privacy Preserving Conversion Modeling in Data Clean RoomabstractIn the realm of online advertising, accurately predicting the conversion rate (CVR) is crucial for enhancing advertising efficiency and user satisfaction. This paper addresses the challenge of CVR prediction while adhering to user privacy preferences and advertiser requirements. Traditional methods face obstacles such as the reluctance of advertisers to share sensitive conversion data and the limitations of model training in secure environments like data clean rooms. We propose a novel model training framework that enables collaborative model training without sharing sample-level gradients with the advertising platform. Our approach introduces several innovative components: (1) utilizing batch-level aggregated gradients instead of sample-level gradients to minimize privacy risks; (2) applying adapter-based parameter-efficient fine-tuning and gradient compression to reduce communication costs; and (3) employing de-biasing techniques to train the model under label differential privacy, thereby maintaining accuracy despite privacy-enhanced label perturbations. Our experimental results, conducted on industrial datasets, demonstrate that our method achieves competitive ROC-AUC performance while significantly decreasing communication overhead and complying with both advertisers’ privacy requirements and user privacy choices. This framework establishes a new standard for privacy-preserving, high-performance CVR prediction in the digital advertising landscape. Kungang Li, Xiangyi Chen, Ling Leng, Jiajing Xu 0003, Jiankai Sun, Behnam Rezaei |
RecSys | 4 |
| 2024 | Bootstrapping Conditional Retrieval for User-to-Item RecommendationsabstractUser-to-item retrieval has been an active research area in recommendation system, and two tower models are widely adopted due to model simplicity and serving efficiency. In this work, we focus on a variant called conditional retrieval, where we expect retrieved items to be relevant to a condition (e.g. topic). We propose a method that uses the same training data as standard two tower models but incorporates item-side information as conditions in query. This allows us to bootstrap new conditional retrieval use cases and encourages feature interactions between user and condition. Experiments show that our method can retrieve highly relevant items and outperforms standard two tower models with filters on engagement metrics. The proposed model is deployed to power a topic-based notification feed at Pinterest and led to +0.26% weekly active users. Jaewon Yang, Jiajing Xu 0003 |
RecSys | 4 |
| 2022 | Rethinking Personalized Ranking at Pinterest: An End-to-End ApproachabstractIn this work, we present our journey to revolutionize the personalized recommendation engine through end-to-end learning from raw user actions. We encode user’s long-term interest in PinnerFormer, a user embedding optimized for long-term future actions via a new dense all-action loss, and capture user’s short-term intention by directly learning from the real-time action sequences. We conducted both offline and online experiments to validate the performance of the new model architecture, and also address the challenge of serving such a complex model using mixed CPU/GPU setup in production. The proposed system has been deployed in production at Pinterest and has delivered significant online gains across organic and Ads applications. Jiajing Xu 0003, Andrew Zhai, Charles Rosenberg 0001 |
RecSys | 1 |
| 2020 | Evolution of a Web-Scale Near Duplicate Image Detection SystemabstractDetecting near duplicate images is fundamental to the content ecosystem of photo sharing web applications. However, such a task is challenging when involving a web-scale image corpus containing billions of images. In this paper, we present an efficient system for detecting near duplicate images across 8 billion images. Our system consists of three stages: candidate generation, candidate selection, and clustering. We also demonstrate that this system can be used to greatly improve the quality of recommendations and search results across a number of real-world applications. Andrey Gusev, Jiajing Xu 0003 |
WWW | 2 |
| 2015 | Visual Search at PinterestabstractWe demonstrate that, with the availability of distributed computation platforms such as Amazon Web Services and open-source tools, it is possible for a small engineering team to build, launch and maintain a cost-effective, large-scale visual search system. We also demonstrate, through a comprehensive set of live experiments at Pinterest, that content recommendation powered by visual search improves user engagement. By sharing our implementation details and learnings from launching a commercial visual search engine from scratch, we hope visual search becomes more widely incorporated into today's commercial applications. Yushi Jing, David C. Liu, Dmitry Kislyuk, Andrew Zhai, Jiajing Xu 0003, Jeff Donahue, Sarah Tavel |
KDD | 5 |