Yi-Xiao He

Yi-Xiao He


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
18 January 2024 in Machine Learning
Verified
Journal Article
Closed access
PDF file
YHYi-Xiao He
Yi-Xiao He
YWYu-Chang Wu
Yu-Chang Wu
CQChao Qian
Chao Qian
ZZZhi-Hua Zhou
Zhi-Hua Zhou

30 November 2025 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
YHYi-Xiao He
Yi-Xiao He
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
YJYuan Jiang
Yuan Jiang
Deep forest is a non-differentiable deep model that has achieved impressive empirical success across a wide variety of applications, especially on categorical/symbolic or mixed modeling tasks. Many of the application fields prefer explainable models, such as random forests with feature contributions that can provide a local explanation for each prediction, and Mean Decrease Impurity (MDI) that can provide global feature importance. However, deep forest, as a cascade of random forests, possesses interpretability only at the first layer. From the second layer on, many of the tree splits occur on the new features generated by the previous layer, which makes existing explaining tools for random forests inapplicable. To disclose the impact of the original features in the deep layers, we design a calculation method with an estimation step followed by a calibration step for each layer, and propose our feature contribution and MDI feature importance calculation tools for deep forest. Experimental results on both simulated data and real-world data verify the effectiveness of our methods.


8 July 2024 in Information Sciences
Verified
Journal Article
Closed access
YHYi-Xiao He
Yi-Xiao He
DLDan-Xuan Liu
Dan-Xuan Liu
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
CQChao Qian
Chao Qian
ZZZhi-Hua Zhou
Zhi-Hua Zhou

21 August 2025 in Information Sciences
Verified
Journal Article
Closed access
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
YHYi-Xiao He
Yi-Xiao He
YWYanyan Wang
Yanyan Wang
ZQZhihao Qu
Zhihao Qu
BTBin Tang
Bin Tang
BYBaoliu Ye
Baoliu Ye

1 February 2025 in arXiv
Verified
Preprint
Open access
PDF file
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
YHYi-Xiao He
Yi-Xiao He
YWYanyan Wang
Yanyan Wang
ZQZhihao Qu
Zhihao Qu
BTBin Tang
Bin Tang
BYBaoliu Ye
Baoliu Ye
Oblique Decision Tree (ODT) separates the feature space by linear projections, as opposed to the conventional Decision Tree (DT) that forces axis-parallel splits. ODT has been proven to have a stronger representation ability than DT, as it provides a way to create shallower tree structures while still approximating complex decision boundaries. However, its learning efficiency is still insufficient, since the linear projections cannot be transmitted to the child nodes, resulting in a waste of model parameters. In this work, we propose an enhanced ODT method with Feature Concatenation (\texttt{FC-ODT}), which enables in-model feature transformation to transmit the projections along the decision paths. Theoretically, we prove that our method enjoys a faster consistency rate w.r.t. the tree depth, indicating that our method possesses a significant advantage in generalization performance, especially for shallow trees. Experiments show that \texttt{FC-ODT} can outperform the other state-of-the-art decision trees with a limited tree depth.