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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wensheng Su

dblp:05/10188 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-6962-9806ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021

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.

Artificial intelligence
1 paper
Reinforcement learning · 50% Efficient and distributed learning · 50%
Computer networks
1 paper
Internet of things and sensor networks · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
iot resource management
0.612022
Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT · IEEE J. Sel. Areas Commun. 2022
Blockchain and cryptocurrency security
payment channel network
0.612022
Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT · IEEE J. Sel. Areas Commun. 2022
Machine learning › Reinforcement learning
deep reinforcement learning
0.212022
Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT · IEEE J. Sel. Areas Commun. 2022
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.212022
Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT · IEEE J. Sel. Areas Commun. 2022
Machine learning › Efficient and distributed learning
model compression
0.212022
Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT · IEEE J. Sel. Areas Commun. 2022
Machine learning › Reinforcement learning › policy optimization
proximal policy optimization
0.212022
Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT · IEEE J. Sel. Areas Commun. 2022

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

proximal policy optimization · 1.7knowledge distillation · 1.7deep reinforcement learning · 1.7adaptive pruning · 1.7
YearPublicationVenuePosition
2023 Dynamic sparse coding-based value estimation network for deep reinforcement learning
Haoli Zhao, Zhenni Li, Wensheng Su, Shengli Xie 0001
Neural Networks3
2022 Compact Learning Model for Dynamic Off-Chain Routing in Blockchain-Based IoT
abstract
Dynamic off-chain routing in payment channel network (PCN)-based Internet of Things (IoT) is attracting increasing research attention. However, there are two major issues in dynamic routing in PCN-based IoT with resource-limited devices. The first issue is how to achieve high long-term transaction efficiency in PCN with dynamic channel capacities. The second issue is how to achieve a lightweight routing algorithm deployed on IoT devices while achieving high transaction efficiency, i.e., successful payment amount and success ratio. Therefore, in this paper, we propose a compact deep reinforcement learning (DRL) algorithm to learn the joint dynamic and lightweight routing policy for maximizing long-term transaction efficiency. To obtain optimal performance in dynamic routing problems for off-chain systems, a proximal policy optimization algorithm is employed to create an actor–critic learning structure for training the teacher DRL model. To obtain a compact and efficient student DRL model, an adaptive pruning technique is utilized for pruning unnecessary parameters of networks in the teacher model adaptively without affecting its learning ability. Furthermore, knowledge distillation is leveraged to improve the performance of the student network. Thus, a compact and efficient student DRL model can be developed and implemented to maximize the long-term transaction efficiency in off-chain systems on resource-limited IoT devices. The simulation results demonstrate that the proposed DRL algorithm outperforms the other baseline algorithms in PCN transaction efficiency while requiring only 10% of the computation and storage resources compared with that of the original teacher model.
Zhenni Li, Wensheng Su, Minrui Xu, Rong Yu 0001, Dusit Niyato, Shengli Xie 0001
IEEE J. Sel. Areas Commun.2