VLDB 2026 Research / reviewers in the wild / expert
Geng Zhao 0002
dblp:77/5486-2
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2024
0000-0003-0750-356XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Theory of computation · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Toxicity Detection for FreeabstractCurrent LLMs are generally aligned to follow safety requirements and tend to refuse toxic prompts. However, LLMs can fail to refuse toxic prompts or be overcautious and refuse benign examples. In addition, state-of-the-art toxicity detectors have low TPRs at low FPR, incurring high costs in real-world applications where toxic examples are rare. In this paper, we introduce Moderation Using LLM Introspection (MULI), which detects toxic prompts using the information extracted directly from LLMs themselves. We found we can distinguish between benign and toxic prompts from the distribution of the first response token's logits. Using this idea, we build a robust detector of toxic prompts using a sparse logistic regression model on the first response token logits. Our scheme outperforms SOTA detectors under multiple metrics. Zhanhao Hu, Julien Piet, Geng Zhao 0002, Jiantao Jiao, David A. Wagner 0001 |
NeurIPS | 3 |
| 2023 | Online Learning in Stackelberg Games with an Omniscient FollowerabstractWe study the problem of online learning in a two-player decentralized cooperative Stackelberg game. In each round, the leader first takes an action, followed by the follower who takes their action after observing the leader’s move. The goal of the leader is to learn to minimize the cumulative regret based on the history of interactions. Differing from the traditional formulation of repeated Stackelberg games, we assume the follower is omniscient, with full knowledge of the true reward, and that they always best-respond to the leader’s actions. We analyze the sample complexity of regret minimization in this repeated Stackelberg game. We show that depending on the reward structure, the existence of the omniscient follower may change the sample complexity drastically, from constant to exponential, even for linear cooperative Stackelberg games. This poses unique challenges for the learning process of the leader and the subsequent regret analysis. Geng Zhao 0002, Banghua Zhu, Jiantao Jiao, Michael I. Jordan |
ICML | 1 |
| 2023 | Welfare Distribution in Two-sided Random Matching MarketsabstractWe study the welfare structure in two-sided matching markets when agents have latent preferences generated according to observed characteristics. Specifically, we are interested in the empirical welfare distribution of agents on each side of the market under stable outcomes as well as the relation between the outcomes of each side of the market. Itai Ashlagi, Mark Braverman, Geng Zhao 0002 |
EC | 3 |
| 2022 | Interference, Bias, and Variance in Two-Sided Marketplace Experimentation: Guidance for PlatformsabstractTwo-sided marketplace platforms often run experiments (or A/B tests) to test the effect of an intervention before launching it platform-wide. A typical approach is to randomize users into a treatment group, which receives the intervention, and a control group, which does not. The platform then compares the performance in the two groups to estimate the effect if the intervention were launched to everyone. We focus on two common experiment types, where the platform randomizes users either on the supply side or on the demand side. For these experiments, it is known that the resulting estimates of the treatment effect are typically biased: individuals in the market compete with each other, which creates interference and leads to a biased estimate. Here, we observe that economic interactions (competition among demand and supply) lead to statistical phenomenon (biased estimates). Hannah Li, Geng Zhao 0002, Ramesh Johari, Gabriel Y. Weintraub |
WWW | 2 |
| 2021 | Tiered Random Matching Markets: Rank Is Proportional to PopularityabstractWe study the stable marriage problem in two-sided markets with randomly generated preferences. We consider agents on each side divided into a constant number of "soft tiers", which intuitively indicate the quality of the agent. Specifically, every agent within a tier has the same public score, and agents on each side have preferences independently generated proportionally to the public scores of the other side. We compute the expected average rank which agents in each tier have for their partners in the men-optimal stable matching, and prove concentration results for the average rank in asymptotically large markets. Furthermore, we show that despite having a significant effect on ranks, public scores do not strongly influence the probability of an agent matching to a given tier of the other side. This generalizes results of [Pittel 1989] which correspond to uniform preferences. The results quantitatively demonstrate the effect of competition due to the heterogeneous attractiveness of agents in the market, and we give the first explicit calculations of rank beyond uniform markets. Itai Ashlagi, Mark Braverman, Amin Saberi, Clayton Thomas, Geng Zhao 0002 |
ITCS | 5 |