Jiankai Sun

Jiankai Sun

Auto-generated profile, based on publicly available information

Jiankai Sun

The Ohio State University The Ohio State University The Ohio State University The Ohio State University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 February 2023
Verified
Conference Paper
Open access
LYLiangwei Yang
Liangwei Yang
SWShengjie Wang
Shengjie Wang
YTYunzhe Tao
Yunzhe Tao
JSJiankai Sun
Jiankai Sun
XLXiaolong Liu
Xiaolong Liu
TWTaiqing Wang
Taiqing Wang
Graph Neural Network (GNN) based recommender systems have been attracting more and more attention in recent years due to their excellent performance in accuracy. Representing user-item interactions as a bipartite graph, a GNN model generates user and item representations by aggregating embeddings of their neighbors. However, such an aggregation procedure often accumulates information purely based on the graph structure, overlooking the redundancy of the aggregated neighbors and resulting in poor diversity of the recommended list. In this paper, we propose diversifying GNN-based recommender systems by directly improving the embedding generation procedure. Particularly, we utilize the following three modules: submodular neighbor selection to find a subset of diverse neighbors to aggregate for each GNN node, layer attention to assign attention weights for each layer, and loss reweighting to focus on the learning of items belonging to long-tail categories. Blending the three modules into GNN, we present DGRec (Diversified GNN-based Recommender System) for diversified recommendation. Experiments on real-world datasets demonstrate that the proposed method can achieve the best diversity while keeping the accuracy comparable to state-of-the-art GNN-based recommender systems. We open source DGRec at https://github.com/YangLiangwei/DGRec.

1 July 2020
Verified
Conference Paper
Open access
JSJiankai Sun
Jiankai Sun
JZJie Zhao
Jie Zhao
HSHuan Sun
Huan Sun
SPSrinivasan Parthasarathy
Srinivasan Parthasarathy
Electronic proceedings of IJCAI 2020

29 June 2018 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
JSJiankai Sun
Jiankai Sun
AVAbhinav Vishnu
Abhinav Vishnu
ACAniket Chakrabarti
Aniket Chakrabarti
CSCharles Siegel
Charles Siegel
SPSrinivasan Parthasarathy
Srinivasan Parthasarathy

21 October 2023
Verified
Conference Paper
Open access
XWXinwei Wan
Xinwei Wan
JSJiankai Sun
Jiankai Sun
SWShengjie Wang
Shengjie Wang
LCLei Chen
Lei Chen
Zhenzhe ZhengZhenzhe Zheng
Zhenzhe Zheng
GCGuihai Chen
Guihai Chen
With increasing concern over data privacy, split learning has become a widely used distributed machine learning paradigm in practice, where two participants (namely the non-label party and the label party) own raw features and raw labels respectively, and jointly train a model. Although no raw data is communicated between the two parties during model training, several works have demonstrated that data privacy, especially label privacy, is still vulnerable in split learning, and have proposed several defense algorithms against label attacks. However, the theoretical guarantee on the privacy preservation of these algorithms is limited. In this work, we propose a novel Private Split Learning Framework (PSLF). In PSLF, the label party shares only the gradients computed by flipped labels with the non-label party, which improves privacy preservation on raw labels, and meanwhile, we further design an extra sub-model from true labels to improve prediction accuracy. We also design a Flipped Multi-Label Generation mechanism (FMLG) based on randomized response for the label party to generate flipped labels. FMLG is proven differentially private and the label party could make a trade-off between privacy and utility by setting the DP budget. In addition, we design an upsampling method to further protect the labels against some existing attacks. We have evaluated PSLF over real-world datasets to demonstrate its effectiveness in protecting label privacy and achieving promising prediction accuracy.

4 August 2023
Verified
Conference Paper
Open access
XCXiaohui Chen
Xiaohui Chen
JSJiankai Sun
Jiankai Sun
TWTaiqing Wang
Taiqing Wang
RGRuocheng Guo
Ruocheng Guo
LLLi-Ping Liu
Li-Ping Liu
AZAonan Zhang
Aonan Zhang
Data subsampling is widely used to speed up the training of large-scale recommendation systems. Most subsampling methods are model-based and often require a pre-trained pilot model to measure data importance via e.g. sample hardness. However, when the pilot model is misspecified, model-based subsampling methods deteriorate. Since model misspecification is persistent in real recommendation systems, we instead propose model-agnostic data subsampling methods by only exploring input data structure represented by graphs. Specifically, we study the topology of the user-item graph to estimate the importance of each user-item interaction (an edge in the user-item graph) via graph conductance, followed by a propagation step on the network to smooth out the estimated importance value. Since our proposed method is model-agnostic, we can marry the merits of both model-agnostic and model-based subsampling methods. Empirically, we show that combing the two consistently improves over any single method on the used datasets. Experimental results on KuaiRec and MIND datasets demonstrate that our proposed methods achieve superior results compared to baseline approaches.

8 October 2024
Verified
Conference Paper
Open access
KLKungang Li
Kungang Li
XCXiangyi Chen
Xiangyi Chen
LLLing Leng
Ling Leng
JXJiajing Xu
Jiajing Xu
JSJiankai Sun
Jiankai Sun
BRBehnam Rezaei
Behnam Rezaei
In the realm of online advertising, accurately predicting the conversion rate (CVR) is crucial for enhancing advertising efficiency and user satisfaction. This paper addresses the challenge of CVR prediction while adhering to user privacy preferences and advertiser requirements. Traditional methods face obstacles such as the reluctance of advertisers to share sensitive conversion data and the limitations of model training in secure environments like data clean rooms. We propose a novel model training framework that enables collaborative model training without sharing sample-level gradients with the advertising platform. Our approach introduces several innovative components: (1) utilizing batch-level aggregated gradients instead of sample-level gradients to minimize privacy risks; (2) applying adapter-based parameter-efficient fine-tuning and gradient compression to reduce communication costs; and (3) employing de-biasing techniques to train the model under label differential privacy, thereby maintaining accuracy despite privacy-enhanced label perturbations. Our experimental results, conducted on industrial datasets, demonstrate that our method achieves competitive ROC-AUC performance while significantly decreasing communication overhead and complying with both advertisers’ privacy requirements and user privacy choices. This framework establishes a new standard for privacy-preserving, high-performance CVR prediction in the digital advertising landscape.