Kai Zheng

Prof. Kai Zheng

School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
28 June 2024 in World Wide Web
Verified
Journal Article
Open access
PDF file
JCJin Chen
Jin Chen
ZLZheng Liu
Zheng Liu
XHXu Huang
Xu Huang
CWChenwang Wu
Chenwang Wu
QLQi Liu
Qi Liu
ECEnhong Chen
Enhong Chen
The advent of large language models marks a revolutionary breakthrough in artificial intelligence. With the unprecedented scale of training and model parameters, the capability of large language models has been dramatically improved, leading to human-like performances in understanding, language synthesizing, common-sense reasoning, etc. Such a major leap forward in general AI capacity will fundamentally change the pattern of how personalization is conducted. For one thing, it will reform the way of interaction between humans and personalization systems. Instead of being a passive medium of information filtering, like conventional recommender systems and search engines, large language models present the foundation for active user engagement. On top of such a new foundation, users’ requests can be proactively explored, and users’ required information can be delivered in a natural, interactable, and explainable way. For another thing, it will also considerably expand the scope of personalization, making it grow from the sole function of collecting personalized information to the compound function of providing personalized services. By leveraging large language models as a general-purpose interface, the personalization systems may compile user’s requests into plans, calls the functions of external tools (e.g., search engines, calculators, service APIs, etc.) to execute the plans, and integrate the tools’ outputs to complete the end-to-end personalization tasks. Today, large language models are still being rapidly developed, whereas the application in personalization is largely unexplored. Therefore, we consider it to be right the time to review the challenges in personalization and the opportunities to address them with large language models. In particular, we dedicate this perspective paper to the discussion of the following aspects: the development and challenges for the existing personalization system, the newly emerged capabilities of large language models, and the potential ways of making use of large language models for personalization.

18 October 2019 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
HSHan Su
Han Su
SLShuncheng Liu
Shuncheng Liu
BZBolong Zheng
Bolong Zheng
XZXiaofang Zhou
Xiaofang Zhou
KZKai Zheng
Kai Zheng

31 July 2013 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
SSShuo Shang
Shuo Shang
RDRuogu Ding
Ruogu Ding
KZKai Zheng
Kai Zheng
CJChristian S. Jensen
Christian S. Jensen
PKPanos Kalnis
Panos Kalnis
XZXiaofang Zhou
Xiaofang Zhou

7 February 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
MIMubashir Imran
Mubashir Imran
HYHongzhi Yin
Hongzhi Yin
TCTong Chen
Tong Chen
TNThanh Hung Nguyen
Thanh Hung Nguyen
AZAlexander Zhou
Alexander Zhou
KZKai Zheng
Kai Zheng
Owing to its nature of scalability and privacy by design, federated learning (FL) has received increasing interest in decentralized deep learning. FL has also facilitated recent research on upscaling and privatizing personalized recommendation services, using on-device data to learn recommender models locally. These models are then aggregated globally to obtain a more performant model while maintaining data privacy. Typically, federated recommender systems (FRSs) do not take into account the lack of resources and data availability at the end-devices. In addition, they assume that the interaction data between users and items is i.i.d. and stationary across end-devices (i.e., users), and that all local recommender models can be directly averaged without considering the user’s behavioral diversity. However, in real scenarios, recommendations have to be made on end-devices with sparse interaction data and limited resources. Furthermore, users’ preferences are heterogeneous and they frequently visit new items. This makes their personal preferences highly skewed, and the straightforwardly aggregated model is thus ill-posed for such non-i.i.d. data. In this article, we propose Resource Efficient Federated Recommender System (ReFRS) to enable decentralized recommendation with dynamic and diversified user preferences. On the device side, ReFRS consists of a lightweight self-supervised local model built upon the variational autoencoder for learning a user’s temporal preference from a sequence of interacted items. On the server side, ReFRS utilizes a scalable semantic sampler to adaptively perform model aggregation within each identified cluster of similar users. The clustering module operates in an asynchronous and dynamic manner to support efficient global model update and cope with shifting user interests. As a result, ReFRS achieves superior performance in terms of both accuracy and scalability, as demonstrated by comparative experiments on real datasets.

22 March 2017
Verified
Book Chapter
Closed access
PDF file
YLYang Li
Yang Li
KZKai Zheng
Kai Zheng
YYYing Yan
Ying Yan
QLQi Liu
Qi Liu
XZXiaofang Zhou
Xiaofang Zhou

12 June 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YZYan Zhao
Yan Zhao
KZKai Zheng
Kai Zheng
YLYang Li
Yang Li
HSHan Su
Han Su
JLJiajun Liu
Jiajun Liu
XZXiaofang Zhou
Xiaofang Zhou
With the proliferation of GPS-enabled smart devices and increased availability of wireless network, spatial crowdsourcing (SC) has been recently proposed as a framework to automatically request workers (i.e., smart device carriers) to perform location-sensitive tasks (e.g., taking scenic photos, reporting events). In this paper, we study a destination-aware task assignment problem that concerns the optimal strategy of assigning each task to proper worker such that the total number of completed tasks can be maximized whilst all workers can reach their destinations before deadlines after performing assigned tasks. Finding the global optimal assignment turns out to be an intractable problem since it does not imply optimal assignment for individual worker. Observing that the task assignment dependency only exists amongst subsets of workers, we utilize tree-decomposition technique to separate workers into independent clusters and develop an efficient depth-first search algorithm with progressive bounds to prune non-promising assignments. In order to make our proposed framework applicable to more scenarios, we further optimize the original framework by proposing strategies to reduce the overall travel cost and allow each task to be assigned to multiple workers. Extensive empirical studies verify that the proposed technique and optimization strategies perform effectively and settle the problem nicely.