Yilun Jin

Yilun Jin

Auto-generated profile, based on publicly available information

Yilun Jin

The Hong Kong University of Science and Technology

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
25 May 2021 in IEEE Intelligent Systems
Verified
Journal Article
Closed access
KCKewei Cheng
Kewei Cheng
TFTao Fan
Tao Fan
YJYilun Jin
Yilun Jin
YLYang Liu
Yang Liu
TCTianjian Chen
Tianjian Chen
QYQiang Yang
Qiang Yang
The protection of user privacy is an important concern in machine learning, as evidenced by the rolling out of the General Data Protection Regulation (GDPR) in the European Union (EU) in May 2018. The GDPR is designed to give users more control over their personal data, which motivates us to explore machine learning frameworks for data sharing that do not violate user privacy. To meet this goal, in this article, we propose a novel lossless privacy-preserving tree-boosting system known as SecureBoost in the setting of federated learning. SecureBoost first conducts entity alignment under a privacy-preserving protocol and then constructs boosting trees across multiple parties with a carefully designed encryption strategy. This federated learning system allows the learning process to be jointly conducted over multiple parties with common user samples but different feature sets, which corresponds to a vertically partitioned dataset. An advantage of SecureBoost is that it provides the same level of accuracy as the non -privacy-preserving approach while at the same time, reveals no information of each private data provider. We show that the SecureBoost framework is as accurate as other nonfederated gradient tree-boosting algorithms that require centralized data, and thus, it is highly scalable and practical for industrial applications such as credit risk analysis. To this end, we discuss information leakage during the protocol execution and propose ways to provably reduce it.

13 June 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
XWXinchen Wan
Xinchen Wan
KXKaiqiang Xu
Kaiqiang Xu
XLXudong Liao
Xudong Liao
YJYilun Jin
Yilun Jin
KCKai Chen
Kai Chen
XJXin Jin
Xin Jin
Graph Neural Networks (GNNs) have emerged as powerful tools to capture structural information from graph-structured data, achieving state-of-the-art performance on applications such as recommendation, knowledge graph, and search. Graphs in these domains typically contain hundreds of millions of nodes and billions of edges. However, previous GNN systems demonstrate poor scalability because large and interleaved computation dependencies in GNN training cause significant overhead in current parallelization methods. We present G3, a distributed system that can efficiently train GNNs over billion-edge graphs at scale. G3 introduces GNN hybrid parallelism which synthesizes three dimensions of parallelism to scale out GNN training by sharing intermediate results peer-to-peer in fine granularity, eliminating layer-wise barriers for global collective communication or neighbor replications as seen in prior works. G3 leverages locality-aware iterative partitioning and multi-level pipeline scheduling to exploit acceleration opportunities by distributing balanced workload among workers and overlapping computation with communication in both inter-layer and intra-layer training processes. We show via a prototype implementation and comprehensive experiments that G3 can achieve as much as 2.24x speedup in a 16-node cluster, and better final accuracy over prior works.


1 August 2019
Verified
Conference Paper
Closed access
YZYizhou Zhang
Yizhou Zhang
GSGuojie Song
Guojie Song
LDLun Du
Lun Du
SYShuwen Yang
Shuwen Yang
YJYilun Jin
Yilun Jin
Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it is important to design a network embedding algorithm that supports downstream model transferring on different networks, known as domain adaptation. In this paper, we propose a novel Domain Adaptive Network Embedding framework, which applies graph convolutional network to learn transferable embeddings. In DANE, nodes from multiple networks are encoded to vectors via a shared set of learnable parameters so that the vectors share an aligned embedding space. The distribution of embeddings on different networks are further aligned by adversarial learning regularization. In addition, DANE's advantage in learning transferable network embedding can be guaranteed theoretically. Extensive experiments reflect that the proposed framework outperforms other state-of-the-art network embedding baselines in cross-network domain adaptation tasks.

3 August 2024
Verified
Conference Paper
Open access
WLWenxue Li
Wenxue Li
XLXiangzhou Liu
Xiangzhou Liu
YLYuxuan Li
Yuxuan Li
YJYilun Jin
Yilun Jin
HTHan Tian
Han Tian
KCKai Chen
Kai Chen
Communication is pivotal in distributed training and a thorough understanding of its characteristics is essential for future optimizations. However, prior works are limited, either focusing on customized optimizations or conducting incomplete explorations on communication characteristics. In this work, we systematically analyze the communication characteristics of distributed training, considering two key aspects of communication: pattern and overhead, and assessing a broad spectrum of determinant factors. In particular, we extensively investigate the features of communication patterns, such as predictability, and comprehensively evaluate the impact of various factors on communication overhead. Additionally, we develop and validate an analytical formulation to estimate communication overhead, providing a mathematical understanding of models with predictability.

3 November 2019
Verified
Conference Paper
Open access
PDF file
QLQingqing Long
Qingqing Long
YWYiming Wang
Yiming Wang
LDLun Du
Lun Du
GSGuojie Song
Guojie Song
YJYilun Jin
Yilun Jin
WLWei Lin
Wei Lin