VLDB 2026 Research / reviewers in the wild / expert
Yanxiang Zeng
dblp:269/5255
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0003-3749-4019ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ZIPBid: Hierarchical Zero-shot Incremental Spend Planning for Auto-bidding
Yunke Bai, Wenzheng Shu, Jinan Pang, Wentao Bai, Yunshan Peng, Yanxiang Zeng, Xialong Liu |
SIGIR | 7 |
| 2026 | R&F-Inventory: A Large-Scale Dataset for Monotonic Inventory Estimation in Reach and Frequency Advertising
Yunshan Peng, Wentao Bai, Yunke Bai, Jinan Pang, Wenzheng Shu, Yanxiang Zeng, Xialong Liu, Peng Jiang 0002 |
SIGIR | 7 |
| 2025 | Expert-Guided Diffusion Planner for Auto-BiddingabstractAuto-bidding is widely used in advertising systems, serving a diverse range of advertisers. Generative bidding is increasingly gaining traction due to its strong planning capabilities and generalizability. Unlike traditional reinforcement learning-based bidding, generative bidding does not depend on the Markov Decision Process (MDP), thereby exhibiting superior planning performance in long-horizon scenarios. Conditional diffusion modeling approaches have shown significant promise in the field of auto-bidding. However, relying solely on return as the optimality criterion is insufficient to guarantee the generation of truly optimal decision sequences, as it lacks personalized structural information. Moreover, the auto-regressive generation mechanism of diffusion models inherently introduces timeliness risks. To address these challenges, we introduce a novel conditional diffusion modeling approach that integrates expert trajectory guidance with a skip-step sampling strategy to improve generation efficiency. The efficacy of this method has been demonstrated through comprehensive offline experiments and further substantiated by statistically significant outcomes in online A/B testing, yielding an 11.29% increase in conversions and a 12.36% growth in revenue relative to the baseline. Yunshan Peng, Wenzheng Shu, Yanxiang Zeng, Jinan Pang, Wentao Bai, Yunke Bai, Xialong Liu, Peng Jiang 0002 |
CIKM | 4 |
| 2025 | Learning Monotonic Probabilities with a Generative Cost ModelabstractIn many machine learning tasks, it is often necessary for the relationship between input and output variables to be monotonic, including both strictly monotonic and implicitly monotonic relationships. Traditional methods for maintaining monotonicity mainly rely on construction or regularization techniques, whereas this paper shows that the issue of strict monotonic probability can be viewed as a partial order between an observable revenue variable and a latent cost variable. This perspective enables us to reformulate the monotonicity challenge into modeling the latent cost variable. To tackle this, we introduce a generative network for the latent cost variable, termed the Generative Cost Model (GCM), which inherently addresses the strict monotonic problem, and propose the Implicit Generative Cost Model (IGCM) to address the implicit monotonic problem. We further validate our approach with a numerical simulation of quantile regression and conduct multiple experiments on public datasets, showing that our method significantly outperforms existing monotonic modeling techniques. The code for our experiments can be found at https://github.com/tyxaaron/GCM. Yongxiang Tang 0001, Yanhua Cheng, Xiaocheng Liu, Jiaochen Chen, Yanxiang Zeng, Ning Luo 0004, Pengjia Yuan, Xialong Liu, Peng Jiang 0002 |
ICML | 5 |