Huaxiong Li

Huaxiong Li


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
1 June 2017 in International Journal of Approximate Reasoning
Verified
Journal Article
Closed access
HLHuaxiong Li
Huaxiong Li
LZLibo Zhang
Libo Zhang
XZXianzhong Zhou
Xianzhong Zhou
BHBing Huang
Bing Huang

23 October 2020 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
TWTianxing Wang
Tianxing Wang
HLHuaxiong Li
Huaxiong Li
YQYuhua Qian
Yuhua Qian
BHBing Huang
Bing Huang
XZxianzhong zhou
xianzhong zhou
Three-way decision provides a new perspective for dealing with uncertainty and complexity in decision-making problems. However, behaviors of decision-makers may be influenced by different risk attitudes in reality. To address this problem, we construct a regret-based three-way decision model under interval type-2 fuzzy environment. Basically, regret theory and interval type-2 fuzzy set are utilized to improve three-way decision in coping with the risk and uncertainty. Two core issues focus on the determination of decision rules and estimation of conditional probabilities for different decision-makers under interval type-2 fuzzy environment. The maximum-utility decision rules are derived based on regret theory. An interval type-2 fuzzy technique for order preference by similarity to ideal solution (TOPSIS) method is utilized to estimate the conditional probability. The results of the illustrative example show that the proposed model can effectively solve uncertain decision problems. The comparative analysis and experimental evaluations are utilized to elaborate on the performance of the regret-based three-way decision model.

1 February 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZRZhipeng Ren
Zhipeng Ren
DDDaoyi Dong
Daoyi Dong
HLHuaxiong Li
Huaxiong Li
CCChunlin Chen
Chunlin Chen
In this paper, a new training paradigm is proposed for deep reinforcement learning using self-paced prioritized curriculum learning with coverage penalty. The proposed deep curriculum reinforcement learning (DCRL) takes the most advantage of experience replay by adaptively selecting appropriate transitions from replay memory based on the complexity of each transition. The criteria of complexity in DCRL consist of self-paced priority as well as coverage penalty. The self-paced priority reflects the relationship between the temporal-difference error and the difficulty of the current curriculum for sample efficiency. The coverage penalty is taken into account for sample diversity. With comparison to deep Q network (DQN) and prioritized experience replay (PER) methods, the DCRL algorithm is evaluated on Atari 2600 games, and the experimental results show that DCRL outperforms DQN and PER on most of these games. More results further show that the proposed curriculum training paradigm of DCRL is also applicable and effective for other memory-based deep reinforcement learning approaches, such as double DQN and dueling network. All the experimental results demonstrate that DCRL can achieve improved training efficiency and robustness for deep reinforcement learning.

1 January 2012 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
DLDun Liu
Dun Liu
TLTianrui Li
Tianrui Li
HLHuaxiong Li
Huaxiong Li
By considering the levels of tolerance for errors and the cost of actions in real decision procedure, a new two-stage approach is proposed to solve the multiple-category classification problems with Decision-Theoretic Rough Sets (DTRS). The first sta

1 May 2020 in Information Sciences
Verified
Journal Article
Closed access
TWTianxing Wang
Tianxing Wang
HLHuaxiong Li
Huaxiong Li
LZLibo Zhang
Libo Zhang
XZXianzhong Zhou
Xianzhong Zhou
BHBing Huang
Bing Huang

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
CZChao Zhang
Chao Zhang
HLHuaxiong Li
Huaxiong Li
WLWei Lv
Wei Lv
ZHZizheng Huang
Zizheng Huang
Yang GaoYang Gao
Yang Gao
CCChunlin Chen
Chunlin Chen
Incomplete multi-view clustering (IMVC) has attracted remarkable attention due to the emergence of multi-view data with missing views in real applications. Recent methods attempt to recover the missing information to address the IMVC problem. However, they generally cannot fully explore the underlying properties and correlations of data similarities across views. This paper proposes a novel Enhanced Tensor Low-rank and Sparse Representation Recovery (ETLSRR) method, which reformulates the IMVC problem as a joint incomplete similarity graphs learning and complete tensor representation recovery problem. Specifically, ETLSRR learns the intra-view similarity graphs and constructs a 3-way tensor by stacking the graphs to explore the inter-view correlations. To alleviate the negative influence of missing views and data noise, ETLSRR decomposes the tensor into two parts: a sparse tensor and an intrinsic tensor, which models the noise and underlying true data similarities, respectively. Both global low-rank and local structured sparse characteristics of the intrinsic tensor are considered, which enhances the discrimination of similarity matrix. Moreover, instead of using the convex tensor nuclear norm, ETLSRR introduces a generalized non-convex tensor low-rank regularization to alleviate the biased approximation. Experiments on several datasets demonstrate the effectiveness of our method compared with the state-of-the-art methods.