Feng Ding

Dr. Feng Ding


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 January 2021 in Complexity
Verified
Journal Article
Open access
PDF file
FDFeng Ding
Feng Ding
GMGuanfeng Ma
Guanfeng Ma
Zhikui ChenZhikui Chen
Zhikui Chen
JGJing Gao
Jing Gao
PLPeng Li
Peng Li
With the advent of the era of artificial intelligence, deep reinforcement learning (DRL) has achieved unprecedented success in high‐dimensional and large‐scale artificial intelligence tasks. However, the insecurity and instability of the DRL algorithm have an important impact on its performance. The Soft Actor‐Critic (SAC) algorithm uses advanced functions to update the policy and value network to alleviate some of these problems. However, SAC still has some problems. In order to reduce the error caused by the overestimation of SAC, we propose a new SAC algorithm called Averaged‐SAC. By averaging the previously learned action‐state estimates, it reduces the overestimation problem of soft Q‐learning, thereby contributing to a more stable training process and improving performance. We evaluate the performance of Averaged‐SAC through some games in the MuJoCo environment. The experimental results show that the Averaged‐SAC algorithm effectively improves the performance of the SAC algorithm and the stability of the training process.

1 August 2019 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ZYZhao YiBing
Zhao YiBing
FDFeng Ding
Feng Ding
JLJining Li
Jining Li
LGLie Guo
Lie Guo
WQWanfeng Qi
Wanfeng Qi

18 November 2024 in Sensors
Verified
Journal Article
Open access
PDF file
XYXu Yuan
Xu Yuan
WWWeihe Wang
Weihe Wang
BGBuyun Gao
Buyun Gao
Liang ZhaoLiang Zhao
Liang Zhao
RMRuixin Ma
Ruixin Ma
FDFeng Ding
Feng Ding
Knowledge graph link prediction is crucial for constructing triples in knowledge graphs, which aim to infer whether there is a relation between the entities. Recently, graph neural networks and contrastive learning have demonstrated superior performance compared with traditional translation-based models; they successfully extracted common features through explicit linking between entities. However, the implicit associations between entities without a linking relationship are ignored, which impedes the model from capturing distant but semantically rich entities. In addition, directly applying contrastive learning based on random node dropout to link prediction tasks, or limiting it to triplet-level, leads to constrained model performance. To address these challenges, we design an implicit feature extraction module that utilizes the clustering characteristics of latent vector space to find entities with potential associations and enrich entity representations by mining similar semantic features from the conceptual level. Meanwhile, the subgraph mechanism is introduced to preserve the structural information of explicitly connected entities. Implicit semantic features and explicit structural features serve as complementary information to provide high-quality self-supervised signals. Experiments are conducted on three benchmark knowledge graph datasets. The results validate that our model outperforms the state-of-the-art baselines in link prediction tasks.

27 February 2024
Verified
Book Chapter
Closed access
PDF file
XYXu Yuan
Xu Yuan
FLFangbo Li
Fangbo Li
MHMuhammad Zeeshan Haider
Muhammad Zeeshan Haider
FDFeng Ding
Feng Ding
AQAnge Qi
Ange Qi
SYShuo Yu
Shuo Yu