Jianxiong Guo

Dr. Jianxiong Guo

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
4 April 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
XWXubin Wang
Xubin Wang
ZTZhiqing Tang
Zhiqing Tang
JGJianxiong Guo
Jianxiong Guo
TMTianhui Meng
Tianhui Meng
CWChenhao Wang
Chenhao Wang
WJWei Jia
Wei Jia
The rapid advancement of artificial intelligence (AI) technologies has led to an increasing deployment of AI models on edge and terminal devices, driven by the proliferation of the Internet of Things (IoT) and the need for real-time data processing. This survey comprehensively explores the current state, technical challenges, and future trends of on-device AI models. We define on-device AI models as those designed to perform local data processing and inference, emphasizing their characteristics such as real-time performance, resource constraints, and enhanced data privacy. The survey is structured around key themes, including the fundamental concepts of AI models, application scenarios across various domains, and technical challenges faced in edge environments. We also discuss optimization and implementation strategies, such as data preprocessing, model compression, and hardware acceleration, which are essential for effective deployment. Furthermore, we examine the impact of emerging technologies, including edge computing and foundation models, on the evolution of on-device AI models. By providing a structured overview of the challenges, solutions, and future directions, this survey aims to facilitate further research and application of on-device AI, ultimately contributing to the advancement of intelligent systems in everyday life.

15 May 2023 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
TCTiantian Chen
Tiantian Chen
SYSiwen Yan
Siwen Yan
JGJianxiong Guo
Jianxiong Guo
WWWeili Wu
Weili Wu
Aiming at selecting a small subset of nodes with maximum influence on networks, the influence maximization (IM) problem has been extensively studied. Since it is #P-hard to compute the influence spread given a seed set, the state-of-the-art methods, including heuristic and approximation algorithms, are faced with great difficulties such as theoretical guarantee, time efficiency, generalization, and so on. This makes it unable to adapt to large-scale networks and more complex applications. On the other side, with the latest achievements of deep reinforcement learning (DRL) in artificial intelligence and other fields, lots of work have been focused on exploiting DRL to solve combinatorial optimization (CO) problems. Inspired by this, we propose a novel end-to-end DRL framework, ToupleGDD, to address the IM problem in this article, which incorporates three coupled graph neural networks (GNNs) for network embedding and double deep $Q$ -networks (DQNs) for parameters learning. Previous efforts to solve the IM problem with DRL trained their models on subgraphs of the whole network and then tested them on the whole graph, which makes the performance of their models unstable among different networks. However, our model is trained on several small randomly generated graphs with a small budget and tested on completely different networks under various large budgets, which can obtain results very close to IMM and better results than OPIM-C on several datasets and shows strong generalization ability. Finally, we conduct a large number of experiments on synthetic and realistic datasets and experimental results prove the effectiveness and superiority of our model.

21 December 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
QNQiufen Ni
Qiufen Ni
JGJianxiong Guo
Jianxiong Guo
WWWeili Wu
Weili Wu
Huan WangHuan Wang
Huan Wang
JWJigang Wu
Jigang Wu
Community partition is of great importance in social networks because of the rapid increasing network scale, data and applications. We consider the community partition problem under Linear Threshold (LT) model in social networks, which is a combinatorial optimization problem that divides the social network to disjoint $m$ communities. Our goal is to maximize the sum of influence propagation within each community. As the influence propagation function of community partition problem is supermodular under LT model, we use the method of Lov ${\acute{a}}$ sz Extension to relax the target influence function and transfer our goal to maximize the relaxed function over a matroid polytope. Next, we propose a continuous greedy algorithm using the properties of the relaxed function to solve our problem, which needs to be discretized in concrete implementation. Then, random rounding technique is used to convert the fractional solution to the integer solution. We present a theoretical analysis with $1-1/e$ approximation ratio for the proposed algorithms. Extensive experiments are conducted to evaluate the performance of the proposed continuous greedy algorithms on real-world online social networks datasets. The results demonstrate that continuous community partition method can improve influence spread and accuracy of the community partition effectively.

25 November 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
XDXingjian Ding
Xingjian Ding
JGJianxiong Guo
Jianxiong Guo
DLDeying Li
Deying Li
WWWeili Wu
Weili Wu
The world-changing blockchain technique provides a novel method to establish a secure, trusted, and decentralized system for solving the security and personal privacy problems in Internet of Things (IoT) applications. As the mining process in blockchain requires high computational power, the lightweight IoT devices need to purchase computational resources from edge servers and thus can offload their computational tasks. In this paper, we investigate the incentive mechanism for the blockchain platform to attract IoT devices to purchase more computational power from edge servers to participate in the mining process, thereby building a secure blockchain network while guaranteeing the profits of the blockchain platform. We model the interaction between the blockchain platform and IoT devices as a two-stage Stackelberg game, where the blockchain platform act as the leader and IoT devices act as followers. We analyze the existence and uniqueness of the Stackelberg equilibrium, and propose an efficient algorithm to compute the Stackelberg equilibrium point. Furthermore, we evaluate the performance of our algorithm through extensive simulations, and analyze the strategies of the blockchain platform and IoT devices under different situations.

18 July 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
YLYandi Li
Yandi Li
HGHaobo Gao
Haobo Gao
YGYunxuan Gao
Yunxuan Gao
JGJianxiong Guo
Jianxiong Guo
WWWeili Wu
Weili Wu
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely used in mobile networks, social computing, and recommendation systems. It aims at selecting a small number of users such that maximizing the influence spread across the online social network. Because of its potential commercial and academic value, there are a lot of researchers focusing on studying the IM problem from different perspectives. The main challenge comes from the NP-hardness of the IM problem and #P-hardness of estimating the influence spread, thus traditional algorithms for overcoming them can be categorized into two classes: heuristic algorithms and approximation algorithms. However, there is no theoretical guarantee for heuristic algorithms, and the theoretical design is close to the limit. Therefore, it is almost impossible to further optimize and improve their performance. With the rapid development of artificial intelligence, technologies based on Machine Learning (ML) have achieved remarkable achievements in many fields. In view of this, in recent years, a number of new methods have emerged to solve combinatorial optimization problems by using ML-based techniques. These methods have the advantages of fast solving speed and strong generalization ability to unknown graphs, which provide a brand-new direction for solving combinatorial optimization problems. Therefore, we abandon the traditional algorithms based on iterative search and review the recent development of ML-based methods, especially Deep Reinforcement Learning, to solve the IM problem and other variants in social networks. We focus on summarizing the relevant background knowledge, basic principles, common methods, and applied research. Finally, the challenges that need to be solved urgently in future IM research are pointed out.

12 August 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
JGJianxiong Guo
Jianxiong Guo
XDXingjian Ding
Xingjian Ding
WWWeili Wu
Weili Wu
Along with the development in the internet of things technology and smart city, a distributed network has been formed among cities. This makes it easy to integrate distributed electric energy into the power grid, thus become an efficient way to use energy. However, how to guarantee the security and privacy protection of distributed electricity trading has not been solved effectively. In this paper, we propose a blockchain-based electricity trading (B-ET) ecosystem and design a smart contract to ensure transactions are conducted in a safe and reliable manner. To overcome the shortcomings of high latency in traditional proof-of-work (PoW) consensus, we proposed a credit-based PoW consensus mechanism by integrating the concept of “stake” to improve the consortium blockchain under the B-ET ecosystem. Then, we take combined cooling, heating, and power (CCHP) system as an example that supplies distributed energy, and model its interactions with the agent of power gird by a novel Stackelberg game. We show that the optimal utilities of entities in a city can be obtained at the Stackelberg equilibrium by a distributed algorithm, which is guaranteed to exist and be unique. In the end, we conduct a number of numerical simulations to evaluate our proposed model and verify our algorithms, which demonstrate their correctness and efficiency completely.