Scaling Up LLM Reviews for Google Ads Content Moderation

Wei Qiao, Tushar Dogra, Otilia Stretcu, Yu-Han Lyu, Tiantian Fang +9 more
2/7/2024
cs.IRcs.CLcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Large language models (LLMs) are powerful tools for content moderation, but their inference costs and latency make them prohibitive for casual use on large datasets, such as the Google Ads repository. This study proposes a method for scaling up LLM reviews for content moderation in Google Ads. First, we use heuristics to select candidates via filtering and duplicate removal, and create clusters of ads for which we select one representative ad per cluster. We then use LLMs to review only the representative ads. Finally, we propagate the LLM decisions for the representative ads back to their clusters. This method reduces the number of reviews by more than 3 orders of magnitude while achieving a 2x recall compared to a baseline non-LLM model. The success of this approach is a strong function of the representations used in clustering and label propagation; we found that cross-modal similarity representations yield better results than uni-modal representations.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{qiao2024scaling,
  title  = {Scaling Up LLM Reviews for Google Ads Content Moderation},
  author = {Wei Qiao and Tushar Dogra and Otilia Stretcu and Yu-Han Lyu and Tiantian Fang and Dongjin Kwon and Chun-Ta Lu and Enming Luo and Yuan Wang and Chih-Chun Chia and Ariel Fuxman and Fangzhou Wang and Ranjay Krishna and Mehmet Tek},
  year   = {2024},
  eprint = {2402.14590},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.14590v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.14590.svg)](https://codeofpaper.com/paper/2402.14590)

Discussion