paper-with-me

홈 › Papers

ClickPrompt: CTR Models are Strong Prompt Generators for Adapting Language Models to CTR Prediction

2023-10-13 · Jianghao Lin, Bo Chen, Hangyu Wang, Yunjia Xi, Yanru Qu, Xinyi Dai, Kangning Zhang, Ruiming Tang, Yong Yu, Weinan Zhang

Click-through rate (CTR) prediction has become increasingly indispensable for various Internet applications. Traditional CTR models convert the multi-field categorical data into ID features via one-hot encoding, and extract the collaborative signals among features. Such a paradigm suffers from the problem of semantic information loss. Another line of research explores the potential of pretrained language models (PLMs) for CTR prediction by converting input data into textual sentences through hard prompt templates. Although semantic signals are preserved, they generally fail to capture the collaborative information (e.g., feature interactions, pure ID features), not to mention the unacceptable inference overhead brought by the huge model size. In this paper, we aim to model both the semantic knowledge and collaborative knowledge for accurate CTR estimation, and meanwhile address the inference inefficiency issue. To benefit from both worlds and close their gaps, we propose a novel model-agnostic framework (i.e., ClickPrompt), where we incorporate CTR models to generate interaction-aware soft prompts for PLMs. We design a prompt-augmented masked language modeling (PA-MLM) pretraining task, where PLM has to recover the masked tokens based on the language context, as well as the soft prompts generated by CTR model. The collaborative and semantic knowledge from ID and textual features would be explicitly aligned and interacted via the prompt interface. Then, we can either tune the CTR model with PLM for superior performance, or solely tune the CTR model without PLM for inference efficiency. Experiments on four real-world datasets validate the effectiveness of ClickPrompt compared with existing baselines.

📄 PDF Abstract BibTeX arXiv:2310.09234

Code (0)

등록된 구현이 없습니다.

Tasks

Click-Through Rate PredictionLanguage ModelingLanguage ModellingMasked Language Modeling

Similar Papers 제목 키워드 기반

Diffusion Guided Domain Adaptation of Image Generators

2022-12-08 · Kunpeng Song, Ligong Han, Bingchen Liu, Dimitris Metaxas 외

Can a text-to-image diffusion model be used as a training objective for adapting a GAN generator to another domain? In this paper, we show that the classifier-free guidance can be leveraged as a critic and enable generat…

Domain Adaptation

GenBreak: Red Teaming Text-to-Image Generators Using Large Language Models

2025-06-11 · Zilong Wang, Xiang Zheng, Xiaosen Wang, Bo wang 외

Text-to-image (T2I) models such as Stable Diffusion have advanced rapidly and are now widely used in content creation. However, these models can be misused to generate harmful content, including nudity or violence, posin…

Large Language ModelRed Teaming

Using LLMs as prompt modifier to avoid biases in AI image generators

2025-04-15 · René Peinl

This study examines how Large Language Models (LLMs) can reduce biases in text-to-image generation systems by modifying user prompts. We define bias as a model's unfair deviation from population statistics given neutral …

DiversityImage GenerationText to Image GenerationText-to-Image Generation

SOP^2: Transfer Learning with Scene-Oriented Prompt Pool on 3D Object Detection

2025-12-09 · Ching-Hung Cheng, Hsiu-Fu Wu, Bing-Chen Wu, Khanh-Phong Bui 외 arxiv

With the rise of Large Language Models (LLMs) such as GPT-3, these models exhibit strong generalization capabilities. Through transfer learning techniques such as fine-tuning and prompt tuning, they can be adapted to var…

3D Object DetectionTransfer Learning

Making New Connections: LLMs as Puzzle Generators for The New York Times' Connections Word Game

2024-07-15 · Tim Merino, Sam Earle, Ryan Sudhakaran, Shyam Sudhakaran 외

The Connections puzzle is a word association game published daily by The New York Times (NYT). In this game, players are asked to find groups of four words that are connected by a common theme. While solving a given Conn…