Demo Data from EDBT 2026 / reviewers in the wild / expert
Wenshuai Chen
dblp:189/3335
· DBLP profile ↗
5ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › online advertising
real-time bidding |
1.0 | 1 | 2026 | Generative Bid Shading in Real-Time Bidding Advertising · SIGIR 2026 |
Machine learning › Reinforcement learning
policy optimization |
0.3 | 1 | 2026 | Generative Bid Shading in Real-Time Bidding Advertising · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
reward preference alignment · 2.0group relative policy optimization · 2.0autoregressive model · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | DynamicPO: Dynamic Preference Optimization for Recommendation
Kai Zhang 0038, Jiancan Wu, Wenshuai Chen, Yinhua Zhu, Xiang Wang 0010 |
DASFAA (1) | 6 |
| 2026 | Generative Bid Shading in Real-Time Bidding AdvertisingabstractBid shading plays a crucial role in Real-Time Bidding (RTB) by adaptively adjusting the bid to avoid advertisers overspending. Existing mainstream two-stage methods, which first model bid landscapes and then optimize surplus using operations research techniques, are constrained by unimodal assumptions that fail to adapt for non-convex surplus curves and are vulnerable to cascading errors in sequential workflows. Additionally, existing discretization models of continuous values ignore the dependence between discrete intervals, reducing the model's error correction ability, while sample selection bias in bidding scenarios presents further challenges for prediction. To address these issues, this paper introduces Generative Bid Shading (GBS), which comprises two primary components: 1) an end-to-end generative model that utilizes an autoregressive approach to generate shading ratios by stepwise residuals, capturing complex value dependencies without relying on predefined priors; and 2) a reward preference alignment system, which incorporates a channel-aware hierarchical dynamic network (CHNet) as the reward model to extract fine-grained features, along with modules for surplus optimization and exploration utility reward alignment, ultimately optimizing both short-term and long-term surplus using group relative policy optimization (GRPO). Extensive experiments on both offline and online A/B tests validate GBS's effectiveness. Moreover, GBS has been deployed on the Meituan DSP platform, serving billions of bid requests daily. Yinqiu Huang, Wenshuai Chen, Zongwei Wang 0002, Yinhua Zhu |
SIGIR | 3 |
| 2018 | Classification of PolSAR Images Based on SVM with Self-Paced Learning OptimizationabstractA novel classification method for polarimetric synthetic aperture radar (PolSAR) images using support vector machine (SVM) with self-paced learning (SPL) optimization is proposed in the paper. In our method, Cloude-Pottier polarimetric decomposition components and the eigenvalues of coherency matrix are used as features. Classification is carried out using SVM, and SPL is used to improve the classifier and achieve a stronger generalization capacity. Under SPL paradigm, the classifier learns the easier samples first and gradually involves more difficult samples into the training process. The proposed method achieves the overall classification accuracies of 89.79% on the Flevoland dataset. Such results are comparable with the compared algorithms. Wenshuai Chen, Dong Hai 0001, Shuiping Gou, Licheng Jiao |
IGARSS | 1 |
| 2017 | A weighted joint sparse of three channels method for full POL-SAR data classificationabstractIn recent years, both passive and active (i.e., Synthetic Aperture Radar or SAR) satellite remote sensing has proven to be valuable tools for mapping land cover. Most of the classification algorithms are based on image-intensity and they do not perform well in different coastal zone types, because these terrains have similar optical or radar backscattering signals. In this paper we propose a weighted joint sparse on the three-channel to mine the polarimetric features and texture information. The proposed method can update weights automatically according to the difference of the three channels' contribution and the least residual error. The similarity and distinctiveness of three channels are used to deal with the complex object classification. Hybrid sparse coefficients are input to the support vector machine for fully polarimetric image classification. The proposed algorithm performed well in distinguishing some coastal land-use types. A comparison study is also conducted to show that proposed algorithm outperforms two commonly classification methods. Wenshuai Chen, Shuiping Gou, Xiangrong Zhang, Xiaofeng Li 0001, Licheng Jiao |
IGARSS | 2 |
| 2016 | Classification of PolSAR image with non-negative tensor factorization approachabstractPolarimetric synthetic aperture radar (PolSAR) is of great importance in the remote sensing, which can be used widely in both civil and military fields. However, existing classification methods cannot effectively utilize the spatial structure information of the SAR data. In this study, a classification method for PolSAR images based on non-negative tensor factorization (NTF) is proposed. The proposed method uses tensor to represent the original data and extract the spacial structure feature by using NTF. Classification results are obtained by using support vector machines (SVM) and the Wishart clustering technology. The results show the validity and accuracy of the proposed method on PolSAR images classification. Shuiping Gou, Wenshuai Chen, Licheng Jiao |
IGARSS | 2 |