VLDB 2026 Research / reviewers in the wild / expert
Shiqin Ta
dblp:377/6925
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0006-0948-8497ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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 |
Recommender systems · 67% Information retrieval · 33% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › online advertising
real-time bidding |
0.8 | 1 | 2024 | Know in AdVance: Linear-Complexity Forecasting of Ad Campaign Performance with Evolving User Interest · KDD 2024 |
Recommender systems
user interest modeling |
0.8 | 1 | 2024 | Know in AdVance: Linear-Complexity Forecasting of Ad Campaign Performance with Evolving User Interest · KDD 2024 |
Machine learning › Deep learning architectures and training
state space model |
0.2 | 1 | 2024 | Know in AdVance: Linear-Complexity Forecasting of Ad Campaign Performance with Evolving User Interest · KDD 2024 |
Machine learning › Deep learning architectures and training
transformer |
0.2 | 1 | 2024 | Know in AdVance: Linear-Complexity Forecasting of Ad Campaign Performance with Evolving User Interest · KDD 2024 |
Methods — techniques the papers use, named apart from their topics
transformer · 1.5state space model · 1.5cross-attention · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Know in AdVance: Linear-Complexity Forecasting of Ad Campaign Performance with Evolving User InterestabstractReal-time Bidding (RTB) advertisers wish to know in advance the expected cost and yield of ad campaigns to avoid trial-and-error expenses.However, Campaign Performance Forecasting (CPF), a sequence modeling task involving tens of thousands of ad auctions, poses challenges of evolving user interest, auction representation, and long context, making coarse-grained and static-modeling methods sub-optimal.We propose AdVance, a time-aware framework that integrates local auction-level and global campaign-level modeling.User preference and fatigue are disentangled using a timepositioned sequence of clicked items and a concise vector of all displayed items.Cross-attention, conditioned on the fatigue vector, captures the dynamics of user interest toward each candidate ad.Bidders compete with each other, presenting a complete graph similar to the self-attention mechanism.Hence, we employ a Transformer Encoder to compress each auction into embedding by solving auxiliary tasks.These sequential embeddings are then summarized by a conditional state space model (SSM) to comprehend long-range dependencies while maintaining global linear complexity.Considering the irregular time intervals between auctions, we Xiaoyu Wang 0014, Yonghui Guo, Hui Sheng, Peili Lv, Shiqin Ta, Dongbo Huang, Xiujin Yang, Lan Xu 0001, Hao Zhou 0001, Yusheng Ji |
KDD | 7 |