Yuan Wang 0049

dblp:41/3241-49 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0009-0001-1563-102XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 4 · 1 first-author · 4 since 2021
YearPublicationVenuePosition
2025 Google Ads Content Moderation with RAG
abstract
Keeping ad content policy classifiers up to date while maintaining the high quality bar is a significant challenge, especially with new threats emerging constantly. This paper introduces a new application to apply RAG-inspired in-context learning to accelerate content policy enforcement, especially when mitigating new emerging violations. Our application leverages RAG-based LLM inference for classification tasks and incorporates augmented reasoning information for better performance. We also developed a practical framework to enforce new violation patterns in O(1) days demonstrating improved memorization and generalization capabilities compared to traditional parametric and non-parametric models.
Yuan Wang 0049, Wei Qiao 0004, Tiantian Fang, Eric Xiao, Megan Oftelie, Yintao Liu 0002, Jimin Li, Zhongli Ding, Enming Luo
CIKM1
2025 Zero-Shot Image Moderation in Google Ads with LLM-Assisted Textual Descriptions and Cross-modal Co-embeddings
Enming Luo, Wei Qiao 0004, Katie Warren, Eric Xiao, Krishna Viswanathan, Yuan Wang 0049, Yintao Liu 0002, Jimin Li, Ariel Fuxman
WSDM7
2024 Advertiser Content Understanding via LLMs for Google Ads Safety
Joseph Wallace, Tushar Dogra, Wei Qiao 0004, Yuan Wang 0049
CIKM4
2024 Scaling Up LLM Reviews for Google Ads Content Moderation
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.
Wei Qiao 0004, Tushar Dogra, Otilia Stretcu, Yu-Han Lyu, Tiantian Fang, Dongjin Kwon, Chun-Ta Lu, Enming Luo, Yuan Wang 0049, Chih-Chun Chia, Ariel Fuxman, Ranjay Krishna, Mehmet Tek
WSDM9