Wei Qiao 0004

dblp:71/6357-4 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2025
0009-0008-6540-1944ORCID · verified

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

Artificial intelligence and machine learning · 6 · 1 first-author · 6 since 2021Databases, data management, data science and information retrieval · 5 · 1 first-author · 5 since 2021
YearPublicationVenuePosition
2025 ROI Scan: LLM-powered Object-level Similarity Search for Google Ads Content Moderation
Enming Luo, Yintao Liu 0002, Dongjin Kwon, Rich Munoz, Wei Qiao 0004, Nic Trieu, Eric Xiao, Jimin Li, Laurel Graham, Ariel Fuxman
CIKM5
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
CIKM2
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
WSDM2
2024 Advertiser Content Understanding via LLMs for Google Ads Safety
Joseph Wallace, Tushar Dogra, Wei Qiao 0004, Yuan Wang 0049
CIKM3
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
WSDM1
2023 Benchmarking Robustness to Adversarial Image Obfuscations
abstract
Automated content filtering and moderation is an important tool that allows online platforms to build striving user communities that facilitate cooperation and prevent abuse. Unfortunately, resourceful actors try to bypass automated filters in a bid to post content that violate platform policies and codes of conduct. To reach this goal, these malicious actors may obfuscate policy violating images (e.g., overlay harmful images by carefully selected benign images or visual patterns) to prevent machine learning models from reaching the correct decision. In this paper, we invite researchers to tackle this specific issue and present a new image benchmark. This benchmark, based on ImageNet, simulates the type of obfuscations created by malicious actors. It goes beyond Image-Net-C and ImageNet-C-bar by proposing general, drastic, adversarial modifications that preserve the original content intent. It aims to tackle a more common adversarial threat than the one considered by lp-norm bounded adversaries. We evaluate 33 pretrained models on the benchmark and train models with different augmentations, architectures and training methods on subsets of the obfuscations to measure generalization. Our hope is that this benchmark will encourage researchers to test their models and methods and try to find new approaches that are more robust to these obfuscations.
Florian Stimberg, Ayan Chakrabarti, Chun-Ta Lu, Hussein Hazimeh 0001, Otilia Stretcu, Wei Qiao 0004, Yintao Liu 0002, Merve Kaya, Cyrus Rashtchian, Ariel Fuxman, Mehmet Tek, Sven Gowal
NeurIPS6