Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianping Wei

dblp:272/9921 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 3 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
3 papers
Recommender systems · 46% Data mining · 42% Information retrieval · 12%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › large-scale recommendation › multi-stage recommender systems
pre-ranking
0.812024
Enhancing Pre-Ranking Performance: Tackling Intermediary Challenges in Multi-Stage Cascading Recommendation Systems · KDD 2024
Recommender systems › debiased recommendation
selection bias
0.812024
Enhancing Pre-Ranking Performance: Tackling Intermediary Challenges in Multi-Stage Cascading Recommendation Systems · KDD 2024
Data mining › time series analysis
time series forecasting
0.712023
AntTS: A Toolkit for Time Series Forecasting in Industrial Scenarios · WSDM 2023
Data mining › causal inference
treatment effect estimation
0.712023
AntTS: A Toolkit for Time Series Forecasting in Industrial Scenarios · WSDM 2023
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
user representation learning
0.412020
Hubble: An Industrial System for Audience Expansion in Mobile Marketing · KDD 2020
Information retrieval › online advertising
audience expansion
0.412020
Hubble: An Industrial System for Audience Expansion in Mobile Marketing · KDD 2020
Data mining
clustering
0.212023
AntTS: A Toolkit for Time Series Forecasting in Industrial Scenarios · WSDM 2023

Methods — techniques the papers use, named apart from their topics

two-stage learning · 0.9embedding-based expansion · 0.9pseudo-labeling · 0.8knowledge distillation · 0.8domain adaptation · 0.8forecasting · 0.7clustering · 0.7causal effect estimation · 0.7
YearPublicationVenuePosition
2024 Enhancing Pre-Ranking Performance: Tackling Intermediary Challenges in Multi-Stage Cascading Recommendation Systems
abstract
Large-scale search engines and recommendation systems utilize a three-stage cascading architecture-recall, pre-ranking, and ranking-to deliver relevant results within stringent latency limits. The pre-ranking stage is crucial for filtering a large number of recalled items into a manageable set for the ranking stage, greatly affecting the system's performance. Pre-ranking faces two intermediary challenges: Sample Selection Bias (SSB) arises when training is based on ranking stage feedback but the evaluation is on a broader recall dataset. Also, compared to the ranking stage, simpler pre-rank models may perform worse and less consistently. Traditional methods to tackle SSB issues include using all recall results and treating unexposed portions as negatives for training, which can be costly and noisy. To boost performance and consistency, some pre-ranking feature interaction enhancers don't fully fix consistency issues, while methods like knowledge distillation in ranking models ignore exposure bias. Our proposed framework targets these issues with three integral modules: Sample Selection, Domain Adaptation, and Unbiased Distillation. Sample Selection filters recall results to mitigate SSB and compute costs. Domain Adaptation enhances model robustness by assigning pseudo-labels to unexposed samples. Unbiased Distillation uses exposure-independent scores from Domain Adaptation to implement unbiased distillation for the pre-ranking model. The framework focuses on optimizing pre-ranking while maintaining training efficiency. We introduce new metrics for pre-ranking evaluation, while experiments confirm the effectiveness of our framework. Our framework is also deployed in real industrial systems.
Jianping Wei, Zhengwei Wu
KDD1
2023 AntTS: A Toolkit for Time Series Forecasting in Industrial Scenarios
abstract
Time series forecasting is an important ingredient in the intelligence of business and decision processes. In industrial scenarios, the time series of interest are mostly macroscopic time series that are aggregated from microscopic time series, e.g., the retail sales is aggregated from the sales of different goods, and that are also intervened by certain treatments on the microscopic individuals, e.g., issuing discount coupons on some goods to increase the retail sales. These characteristics are not considered in existing toolkits, which just focus on the "natural" time series forecasting that predicts the future value based on historical data, regardless of the impact of treatments. In this paper, we present AntTS, a time series toolkit paying more attention on the forecasting of the macroscopic time series with underlying microscopic time series and certain treatments, besides the "natural" time series forecasting. AntTS consists of three decoupled modules, namely Clustering module, Natural Forecasting module, and Effect module, which are utilized to study the homogeneous groups of microscopic individuals, the "natural" time series forecasting of homogeneous groups, and the treatment effect estimation of homogeneous groups. With the combinations of different modules, it can exploit the microscopic individuals and the interventions on them, to help the forecasting of macroscopic time series. We show that AntTS helps address many typical tasks in the industry.
Jianping Wei, Zhibo Zhu, Zhiqiang Zhang 0012, Jun Zhou 0011
WSDM1
2021 Learning Representations of Inactive Users: A Cross Domain Approach with Graph Neural Networks
abstract
Understanding inactive users is the key to user growth and engagement for many Internet companies. However, learning inactive users' representations and their preferences is still challenging because the features available are missing and the positive responses or labels are insufficient. In this paper, we propose a cross domain learning approach to exclusively recommend customized items to inactive users by leveraging the knowledge of active users. Particularly, we represent users, no matter active or inactive users, by their friends' browsing behaviors based on a graph neural network (GNN) layer atop of a heterogeneous graph defined on social networks (user-user friendships) and browsing behaviors (user-page clicks). We jointly optimize the learning tasks of active users in source domain and inactive users in target domain based on the domain invariant features extracted from the embedding of our GNN layer, where the domain invariant features that are learned to benefit both tasks on active/inactive users, and are indiscriminate with respect to the shift between the domains. Extensive experiments show that our approach can well capture the preference of inactive users using both public data and real-world data at Alipay.
Xiaocheng Cheng, Qiang Li 0022, Jianping Wei, Zhiqiang Zhang 0012, Dong Wang 0062, Xiaodong Zeng, Jinjie Gu, Jun Zhou 0011
CIKM5
2020 Hubble: An Industrial System for Audience Expansion in Mobile Marketing
abstract
Recently, in order to take a preemptive opportunity in the mobile economy, the Internet companies conduct thousands of marketing campaigns every day, to promote their mobile products and services. In the mobile marketing scenario, one of the fundamental issues is the audience expansion task for marketing campaigns. Given a set of seed users, audience expansion aims to seek more users (audiences), who are similar to the seeds and will finish the business goal of the targeted campaign (ie convert). However, the problem is challenging in three aspects. First, a company will run hundreds of campaigns to serve massive users every day. The requirements of scalability and timeliness make training model for each campaign extremely resource-consuming thus impractical. Therefore, we proposed to solve the problem in a two-stage manner, in which the offline stage employs heavyweight user representation learning and the online stage performs embedding-based lightweight audience expansion. Second, conventional two-stage audience expansion systems neglect the high-order user-campaign interactions and usually generate entangled user embeddings, thus fail to achieve high-quality user representation. Third, the seeds, which are usually provided by experts or collected from users' feedbacks, could be noisy and cannot cover the entire actual audiences, thus introduce coverage bias. Unfortunately, to our best knowledge, none of the related literatures tackle this crucial issue of audience expansion.
Chenyi Zhuang, Zhiqiang Zhang 0012, Yize Tan, Zhengwei Wu, Zhining Liu 0001, Jianping Wei, Jinjie Gu, Jun Zhou 0011, Yuan Qi 0001
KDD7