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.

Kunyang Jia

dblp:136/7993 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 since 2021Databases, data management, data science and information retrieval · 5 · 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.

Databases, data mining, and information retrieval
3 papers
Data mining · 66% Recommender systems · 34%
Artificial intelligence
2 papers
Efficient and distributed learning · 53% Graph learning · 39% Transfer learning and domain adaptation · 8%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 13 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › distributed training › edge training
device-cloud collaborative learning
0.712023
Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Efficient and distributed learning
distributed training
0.712023
Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI · IEEE Trans. Knowl. Data Eng. 2023
Edge and fog computing
edge-cloud collaboration
0.712023
Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI · IEEE Trans. Knowl. Data Eng. 2023
Edge and fog computing › distributed learning
edge-cloud collaborative learning
0.712023
Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI · IEEE Trans. Knowl. Data Eng. 2023
Data mining › causal inference › causal modeling
causal discovery
0.412020
Inductive Granger Causal Modeling for Multivariate Time Series · ICDM 2020
Data mining › causal inference › causal modeling › causal discovery
granger causality
0.412020
Inductive Granger Causal Modeling for Multivariate Time Series · ICDM 2020
Data mining › time series analysis
multivariate time series
0.412020
Inductive Granger Causal Modeling for Multivariate Time Series · ICDM 2020
Data mining
time series analysis
0.412020
Inductive Granger Causal Modeling for Multivariate Time Series · ICDM 2020
Machine learning › Graph learning › graph representation learning
graph neural network representation learning
0.412019
Hierarchical Representation Learning for Bipartite Graphs · IJCAI 2019
Machine learning › Graph learning › graph representation learning
hierarchical graph representation
0.412019
Hierarchical Representation Learning for Bipartite Graphs · IJCAI 2019
Recommender systems
graph-based recommendation
0.412019
Hierarchical Representation Learning for Bipartite Graphs · IJCAI 2019
Machine learning › Graph learning
graph neural network
0.212023
Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Transfer learning and domain adaptation
pre-trained models
0.212023
Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI · IEEE Trans. Knowl. Data Eng. 2023

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

knowledge distillation · 1.8graph neural network · 0.8embedding decomposition · 0.8community detection · 0.8momodistill · 0.5metapatch · 0.5meta-learning · 0.5prototypical granger causal attention · 0.4attention mechanism · 0.4
YearPublicationVenuePosition
2023 Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI
abstract
Influenced by the great success of deep learning via cloud computing and the rapid development of edge chips, research in artificial intelligence (AI) has shifted to both of the computing paradigms, i.e., cloud computing and edge computing. In recent years, we have witnessed significant progress in developing more advanced AI models on cloud servers that surpass traditional deep learning models owing to model innovations (e.g., Transformers, Pretrained families), explosion of training data and soaring computing capabilities. However, edge computing, especially edge and cloud collaborative computing, are still in its infancy to announce their success due to the resource-constrained IoT scenarios with very limited algorithms deployed. In this survey, we conduct a systematic review for both cloud and edge AI. Specifically, we are the first to set up the collaborative learning mechanism for cloud and edge modeling with a thorough review of the architectures that enable such mechanism. We also discuss potentials and practical experiences of some on-going advanced edge AI topics including pretraining models, graph neural networks and reinforcement learning. Finally, we discuss the promising directions and challenges in this field.
Jiangchao Yao, Shengyu Zhang 0001, Feng Wang 0072, Jianwei Zhang 0012, Yunfei Chu, Luo Ji, Kunyang Jia, Tao Shen 0002, Anpeng Wu, Fengda Zhang, Kun Kuang 0001, Chao Wu 0001, Fei Wu 0001, Jingren Zhou 0001, Hongxia Yang
IEEE Trans. Knowl. Data Eng.9
2021 Device-Cloud Collaborative Learning for Recommendation
abstract
With the rapid development of storage and computing power on mobile devices, it becomes critical and popular to deploy models on devices to save onerous communication latencies and to capture real-time features. While quite a lot of works have explored to facilitate on-device learning and inference, most of them focus on dealing with response delay or privacy protection. Little has been done to model the collaboration between the device and the cloud modeling and benefit both sides jointly. To bridge this gap, we are among the first attempts to study the Device-Cloud Collaborative Learning (DCCL) framework. Specifically, we propose a novel MetaPatch learning approach on the device side to efficiently achieve "thousands of people with thousands of models'' given a centralized cloud model. Then, with billions of updated personalized device models, we propose a "model-over-models'' distillation algorithm, namely MoMoDistill, to update the centralized cloud model. Our extensive experiments over a range of datasets with different settings demonstrate the effectiveness of such collaboration on both cloud and devices, especially its superiority to model long-tailed users.
Jiangchao Yao, Feng Wang 0072, Kunyang Jia, Bo Han 0003, Jingren Zhou 0001, Hongxia Yang
KDD3
2020 Inductive Granger Causal Modeling for Multivariate Time Series
abstract
Granger causal modeling is an emerging topic that can uncover Granger causal relationship behind multivariate time series data. In many real-world systems, it is common to encounter a large amount of multivariate time series data collected from different individuals with sharing commonalities. However, there are ongoing concerns regarding Granger causality's applicability in such large scale complex scenarios, presenting both challenges and opportunities for Granger causal structure reconstruction. Existing methods usually train a distinct model for each individual, suffering from inefficiency and over-fitting issues. To bridge this gap, we propose an Inductive GRanger cAusal modeling (InGRA) framework for inductive Granger causality learning and common causal structure detection on multivariate time series, which exploits the shared commonalities underlying the different individuals. In particular, we train one global model for individuals with different Granger causal structures through a novel attention mechanism, called prototypical Granger causal attention. The model can detect common causal structures for different individuals and infer Granger causal structures for newly arrived individuals. Extensive experiments, as well as an online A/B test on an E-commercial advertising platform, demonstrate the superior performances of InGRa.
Yunfei Chu, Kunyang Jia, Jingren Zhou 0001, Hongxia Yang
ICDM4
2019 Bayes EMbedding (BEM): Refining Representation by Integrating Knowledge Graphs and Behavior-specific Networks
abstract
Low-dimensional embeddings of knowledge graphs and behavior graphs have proved remarkably powerful in varieties of tasks, from predicting unobserved edges between entities to content recommendation. The two types of graphs can contain distinct and complementary information for the same entities/nodes. However, previous works focus either on knowledge graph embedding or behavior graph embedding while few works consider both in a unified way. Here we present BEM, a Bayesian framework that incorporates the information from knowledge graphs and behavior graphs. To be more specific, BEM takes as prior the pre-trained embeddings from the knowledge graph, and integrates them with the pre-trained embeddings from the behavior graphs via a Bayesian generative model. BEM is able to mutually refine the embeddings from both sides while preserving their own topological structures. To show the superiority of our method, we conduct a range of experiments on three benchmark datasets: node classification, link prediction, triplet classification on two small datasets related to Freebase, and item recommendation on a large-scale e-commerce dataset.
Yuting Ye, Xuwu Wang, Jiangchao Yao, Kunyang Jia, Jingren Zhou 0001, Yanghua Xiao, Hongxia Yang
CIKM4
2019 Hierarchical Representation Learning for Bipartite Graphs
abstract
Recommender systems on E-Commerce platforms track users' online behaviors and recommend relevant items according to each user’s interests and needs. Bipartite graphs that capture both user/item feature and use-item interactions have been demonstrated to be highly effective for this purpose. Recently, graph neural network (GNN) has been successfully applied in representation of bipartite graphs in industrial recommender systems. Providing individualized recommendation on a dynamic platform with billions of users is extremely challenging. A key observation is that the users of an online E-Commerce platform can be naturally clustered into a set of communities. We propose to cluster the users into a set of communities and make recommendations based on the information of the users in the community collectively. More specifically, embeddings are assigned to the communities and the user embedding is decomposed into two parts, each of which captures the community-level generalizations and individualized preferences respectively. The community embedding can be considered as an enhancement to the GNN methods that are inherently flat and do not learn hierarchical representations of graphs. The performance of the proposed algorithm is demonstrated on a public dataset and a world-leading E-Commerce company dataset.
Kunyang Jia, Chuanjin Richard Shi, Hongxia Yang
IJCAI2
2013 iNewsBox: modeling and exploiting implicit feedback for building personalized news radio
abstract
Online news reading has become the major method to know about the world as web provide more information than other media like TV and radio. However, traditional online news reading interface is inconvenient for many types of people, especially for those who are disabled or taking a bus. This paper presents a mobile application iNewsBox enabling users to listen to news collected from the Internet. In order to simplify necessary interactions of getting valuable news, we also propose a framework for using implicit feedback to recommend news in this paper. Experiment shows our algorithms in iNewsBox are effective.
Yanan Xie, Liang Chen 0001, Kunyang Jia, Lichuan Ji, Jian Wu 0001
CIKM3