Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.39090

PALATE: Pretrained Autoregressive LATent Embeddings

Sizhang Zhao·Praveen Gondhi·Bin Li·Utsaw Kumar
View original source ↗Read source document ↗Export metadata ↓

Abstract

Local-commerce and food-delivery marketplaces run large ads businesses: across hundreds of thousands of stores, merchants pay to be surfaced on browse and search surfaces, and a ranker decides which ads each consumer sees. Ranking well demands strong per-consumer personalization, yet a consumer's raw interaction history is sparse and high-cardinality. Our production ranker had personalized only through hand-engineered signals: aggregate engagement counts, categorical embeddings, and order-agnostic pooled history, with no learned per-consumer sequence representation. We learn one by training a GPT-style generative model of the consumer's engagement sequence to predict their next few engagements, and read its last-token hidden state as the consumer embedding. That single frozen vector becomes one shared personalization input for every ad surface: a daily job refreshes it, and each ranker consumes it as an ordinary dense feature. Offline it is the largest single-feature gain in our ranking-AUC ladder, a relative Eval-AUC gain of +0.59% on a browse-driven feed and +0.57% on a query-driven search surface. Online, it shipped as one component of bundled ranker retrains on both surfaces: Discovery (revenue +0.79%, conversion rate +1.17%) and Search (revenue +0.94%, conversion rate +1.50%). Three design choices adapt the generative objective to a repurchase-heavy marketplace, and are the core of our contribution: an exploration-weighted loss that up-weights businesses new to the consumer over ones already engaged; a two-stage curriculum: a click pretrain that keeps the representation broad and exploratory, then a conversion fine-tune that sharpens purchase intent; and a designed negative set that pairs a fixed popular-business pool and businesses shown but not ordered with random and in-batch negatives.

Explore related subjects

cs.IRcs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sizhang Zhao, Praveen Gondhi, Bin Li, Utsaw Kumar. 2026-10-29. PALATE: Pretrained Autoregressive LATent Embeddings. https://arxiv.org/abs/2610.39090

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rethinking Group Recommender Systems in the Era of Generative AI: From One-Shot Recommendations to Conversational Group Decision Support

More than twenty-five years ago, early ideas emerged on how to design systems that provide recommendations to groups of users rather than individuals. Since then, a wide range of algorithmic approaches has been proposed to elicit individual preferences, aggregate them, and generate group recommendations. However, despite this substantial body of work, relatively few examples of real-world group recommender systems are in use. This observation invites reflection on the assumptions of the academic research, particularly regarding how inter-group communication unfolds and how recommendation-supported decisions should be made. In this essay, we suggest that some of these assumptions and corresponding system designs may not fully align with users' needs or expectations. We therefore outline a forward-looking perspective that explores how insights from group-decision making research and recent advances in Generative AI, including systems such as ChatGPT, could better inform the design of group recommender systems. As one possible direction, we consider settings in which human group members interact and exchange information through a chat based interface, while an AI-based agent supports the decision-making process. Such an approach may contribute to design more natural group and system interactions, and could help facilitate a broader adoption of group recommender systems in practice.

cs.IR↗
arXiv2026

Membership Inference Attacks on Recommender System: A Survey

Recommender systems (RecSys) have been widely applied to various applications, including E-commerce, finance, healthcare, social media and have become increasingly influential in shaping user behavior and decision-making, highlighting their growing impact in various domains. However, recent studies have shown that RecSys are vulnerable to membership inference attacks (MIAs), which aim to infer whether user interaction record was used to train a target model or not. MIAs on RecSys models can directly lead to a privacy breach. For example, via identifying the fact that a purchase record that has been used to train a RecSys associated with a specific user, an attacker can infer that user's special quirks. In recent years, MIAs have been shown to be effective on other ML tasks, e.g., classification models and natural language processing. However, traditional MIAs are ill-suited for RecSys due to the unseen posterior probability. Although MIAs on RecSys form a newly emerging and rapidly growing research area, there has been no systematic survey on this topic yet. In this article, we conduct the first comprehensive survey on RecSys MIAs. This survey offers a comprehensive review of the latest advancements in RecSys MIAs, exploring the design principles, challenges, attack and defense associated with this emerging field. We provide a unified taxonomy that categorizes different RecSys MIAs based on their characterizations and discuss their pros and cons. Based on the limitations and gaps identified in this survey, we point out several promising future research directions to inspire the researchers who wish to follow this area. This survey not only serves as a reference for the research community but also provides a clear description for researchers outside this research domain.

cs.IR↗
arXiv2026

Contrastive Retrieval Heads for Improved Attention-Based Reranking

The strong zero-shot and long-context capabilities of recent Large Language Models (LLMs) have paved the way for highly effective re-ranking systems. Attention-based re-rankers leverage attention weights from transformer heads to produce relevance scores, but not all heads are created equally: many contribute noise and redundancy, thus limiting performance. To address this, we introduce CoRe heads, a small set of retrieval heads identified via a contrastive scoring metric that explicitly rewards high attention heads that correlate with relevant documents, while downplaying nodes with higher attention that correlate with irrelevant documents. This relative ranking criterion isolates the most discriminative heads for re-ranking and yields a state-of-the-art list-wise re-ranker. Extensive experiments with three LLMs show that aggregated signals from CoRe heads, constituting less than 1% of all heads, substantially improve re-ranking accuracy over strong baselines. We further find that CoRe heads are concentrated in middle layers, and pruning the computation of final 50% of model layers preserves accuracy while significantly reducing inference time and memory usage.

cs.IR↗