Yi-Xiao He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yi-Xiao He has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Shen-Huan Lyu
College of Computer Science and Software Engineering, Hohai University, Nanjing, China
5 shared publications - Chao Qian
Nanjing University
2 shared publications - Yanyan Wang
College of Computer Science and Software Engineering, Hohai University, Nanjing, China
2 shared publications - Yu-Chang Wu
National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
2 shared publications - Zhi-Hua Zhou
Nanjing University
2 shared publications Baoliu Ye
1 shared publication
Latest Publications
- Open Access
- 10 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (18) , 4108
Confidence-Aware Relation Contrastive Learning for Partial Multi-Label Learning
Partial multi-label learning (PML) learns from over-complete candidate labels: All true labels are included in the candidate set, but irrelevant labels may also be annotated. Existing PML methods mainly reduce this ambiguity during classifier training by estimating label reliability, recovering latent label distributions, or modeling label correlations. This paper studies a complementary question: how can PML supervision be used for contrastive representation pretraining? The main difficulty is relation construction. Raw candidate label overlap is not a reliable contrastive signal, because two images can share only false candidate labels. We therefore formulate PML pretraining as a relation disambiguation problem and propose a confidence-aware relation contrastive learning framework. The method estimates candidate label confidence, uses it to construct semantic relation distributions over current and queued samples, and aligns the embedding distribution with these confidence-weighted relations. The same candidate label confidence semantics are used during downstream fine-tuning, keeping non-candidate labels as reliable negatives while softly disambiguating the candidate set. Across VOC2007, NUS-WIDE, and COCO2014, the method improves subset accuracy and F1-oriented measures under moderate and severe partial-label noise. For example, on VOC2007 at , it improves subset accuracy from 0.3322 to 0.5269 and micro-F1 from 0.6710 to 0.7617 over PML-CD. However, the CUB200 results further identify a limitation: fine-grained attribute prediction is less consistently served by the present global representation pretraining design.- 10 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (18) , 4108
Open AccessConfidence-Aware Relation Contrastive Learning for Partial Multi-Label Learning
Partial multi-label learning (PML) learns from over-complete candidate labels: All true labels are included in the candidate set, but irrelevant labels may also be annotated. Existing PML methods mainly reduce this ambiguity during classifier training by estimating label reliability, recovering latent label distributions, or modeling label correlations. This paper studies a complementary question: how can PML supervision be used for contrastive representation pretraining? The main difficulty is relation construction. Raw candidate label overlap is not a reliable contrastive signal, because two images can share only false candidate labels. We therefore formulate PML pretraining as a relation disambiguation problem and propose a confidence-aware relation contrastive learning framework. The method estimates candidate label confidence, uses it to construct semantic relation distributions over current and queued samples, and aligns the embedding distribution with these confidence-weighted relations. The same candidate label confidence semantics are used during downstream fine-tuning, keeping non-candidate labels as reliable negatives while softly disambiguating the candidate set. Across VOC2007, NUS-WIDE, and COCO2014, the method improves subset accuracy and F1-oriented measures under moderate and severe partial-label noise. For example, on VOC2007 at , it improves subset accuracy from 0.3322 to 0.5269 and micro-F1 from 0.6710 to 0.7617 over PML-CD. However, the CUB200 results further identify a limitation: fine-grained attribute prediction is less consistently served by the present global representation pretraining design. - 9 May 2026
- Published by Elsevier in Information Sciences
- Vol. 753
A semi-supervised deep forest framework based on margin distribution optimization for tabular data
- 9 May 2026
- Published by Elsevier in Information Sciences
- Vol. 753
A semi-supervised deep forest framework based on margin distribution optimization for tabular data
- Open Access
- 30 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-21
Interpreting Deep Forest through Feature Contribution and MDI Feature Importance
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.
- 30 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-21
Open AccessInterpreting Deep Forest through Feature Contribution and MDI Feature Importance
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.
- 21 August 2025
- Published by Elsevier in Information Sciences
- Vol. 721
Enhance learning efficiency of oblique decision tree via feature concatenation
- 21 August 2025
- Published by Elsevier in Information Sciences
- Vol. 721
Enhance learning efficiency of oblique decision tree via feature concatenation
- 8 July 2024
- Published by Elsevier in Information Sciences
- Vol. 680
Multi-class imbalance problem: A multi-objective solution
- 8 July 2024
- Published by Elsevier in Information Sciences
- Vol. 680
Multi-class imbalance problem: A multi-objective solution
- 18 January 2024
- Published by Springer Nature in Machine Learning
- Vol. 113 (6) , 3545-3567
Margin distribution and structural diversity guided ensemble pruning
- 18 January 2024
- Published by Springer Nature in Machine Learning
- Vol. 113 (6) , 3545-3567
Margin distribution and structural diversity guided ensemble pruning
- 14 August 2022
- Published by Springer Nature
- p. 427-441
Multi-objective Evolutionary Ensemble Pruning Guided by Margin Distribution
- 14 August 2022
- Published by Springer Nature
- p. 427-441
Multi-objective Evolutionary Ensemble Pruning Guided by Margin Distribution