Demo Data from EDBT 2026 / reviewers in the wild / expert
Mengyao Gao
dblp:268/7854
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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.
| Artificial intelligence
1 paper |
Reinforcement learning · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › offline reinforcement learning
conservative q-learning |
0.9 | 1 | 2025 | Adversarial Conservative Alternating Q-Learning for Credit Card Debt Collection · IEEE Trans. Knowl. Data Eng. 2025 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.9 | 1 | 2025 | Adversarial Conservative Alternating Q-Learning for Credit Card Debt Collection · IEEE Trans. Knowl. Data Eng. 2025 |
Recommender systems
large language model-based recommendation |
0.9 | 1 | 2025 | Process-Supervised LLM Recommenders via Flow-guided Tuning · SIGIR 2025 |
Machine learning › Reinforcement learning › value-based reinforcement learning
q-learning |
0.3 | 1 | 2025 | Adversarial Conservative Alternating Q-Learning for Credit Card Debt Collection · IEEE Trans. Knowl. Data Eng. 2025 |
Recommender systems › beyond-accuracy recommendation
fairness and diversity |
0.3 | 1 | 2025 | Process-Supervised LLM Recommenders via Flow-guided Tuning · SIGIR 2025 |
Recommender systems › debiased recommendation
popularity bias mitigation |
0.3 | 1 | 2025 | Process-Supervised LLM Recommenders via Flow-guided Tuning · SIGIR 2025 |
Methods — techniques the papers use, named apart from their topics
counterfactual action stitching · 1.7adversarial conservative value regularization · 1.7token-level reward propagation · 0.9supervised fine-tuning · 0.9generative flow networks · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Process-Supervised LLM Recommenders via Flow-guided TuningabstractWhile large language models (LLMs) are increasingly adapted for recommendation systems via supervised fine-tuning (SFT), this approach amplifies popularity bias due to its likelihood maximization objective, compromising recommendation diversity and fairness.To address this, we present Flow-guided fine-tuning recommender (Flower), which replaces SFT with a Generative Flow Network (GFlowNet) [6] framework that enacts process supervision through token-level reward propagation.Flower's key innovation lies in decomposing item-level rewards into constituent token rewards, enabling direct alignment between token generation probabilities and their reward signals.This mechanism achieves three critical advancements: (1) popularity bias mitigation and fairness enhancement through empirical distribution matching, (2) preservation of diversity through GFlowNet's proportional sampling, and (3) flexible integration of personalized preferences via adaptable token rewards.Experiments demonstrate Flower's superior distribution-fitting capability and its significant advantages over traditional SFT in terms of accuracy, fairness, and diversity, highlighting its potential to improve LLM-based recommendation systems.The implementation is available via https://github.com/Mr- Peach0301/Flower. Chongming Gao, Mengyao Gao, Chenxiao Fan, Shuai Yuan 0018, Wentao Shi 0002, Xiangnan He 0001 |
SIGIR | 2 |
| 2025 | Adversarial Conservative Alternating Q-Learning for Credit Card Debt CollectionabstractDebt collection is utilized for risk control after credit card delinquency. The existing rule-based method tends to be myopic and non-adaptive due to the delayed feedback. Reinforcement learning (RL) has an inherent advantage in dealing with such task and can learn policies end-to-end. However, employing RL here remains difficult because of different interaction processes from standard RL and the notorious problem of optimistic estimations in the offline setting. To tackle these challenges, we first propose an Alternating Q-Learning (AQL) framework to adapt debt collection processes to comparable procedures in RL. Based on AQL, we further develop an Adversarial Conservative Alternating Q-Learning (ACAQL) to address the issue of overoptimistic estimations. Specifically, adversarial conservative value regularization is proposed to balance optimism and conservatism on Q-values of out-of-distribution actions. Furthermore, ACAQL utilizes the counterfactual action stitching to mitigate the overestimation by enhancing behavior data. Finally, we evaluate ACAQL on a real-world dataset created from Bank of Shanghai. Offline experimental results show that our approach outperforms state-of-the-art methods and effectively alleviates the optimistic estimation issue. Moreover, we conduct online A/B tests on the bank, and ACAQL achieves at least a$\emph {6\%}$improvement of the debt recovery rate, which yields tangible economic benefits. Jiapeng Zhu 0002, Lyu Ni, Jingyu Bi, Zhijian Wu, Jiajie Long, Mengyao Gao, Dingjiang Huang, Shuigeng Zhou |
IEEE Trans. Knowl. Data Eng. | 7 |
| 2020 | Arbitrarily slow convergence of reconstruction from nonuniform sample
Mengyao Gao |
Signal Process. | 2 |