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

Keyao Ding

dblp:414/8998 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Efficient and distributed learning · 33% Optimization for machine learning · 33% Kernel, tree and ensemble methods · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
automated machine learning
1.012026
PSEO: Optimizing Post-hoc Stacking Ensemble Through Hyperparameter Tuning · AAAI 2026
Machine learning › Optimization for machine learning › hyperparameter optimization
combined algorithm selection and hyperparameter optimization
1.012026
PSEO: Optimizing Post-hoc Stacking Ensemble Through Hyperparameter Tuning · AAAI 2026
Machine learning › Kernel, tree and ensemble methods
ensemble learning
1.012026
PSEO: Optimizing Post-hoc Stacking Ensemble Through Hyperparameter Tuning · AAAI 2026

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

hyperparameter tuning · 1.0binary quadratic programming · 1.0
YearPublicationVenuePosition
2026 PSEO: Optimizing Post-hoc Stacking Ensemble Through Hyperparameter Tuning
abstract
The Combined Algorithm Selection and Hyperparameter Optimization (CASH) problem is fundamental in Automated Machine Learning (AutoML). Inspired by the success of ensemble learning, recent AutoML systems construct post-hoc ensembles for final predictions rather than relying on the best single model. However, while most CASH methods conduct extensive searches for the optimal single model, they typically employ fixed strategies during the ensemble phase that fail to adapt to specific task characteristics. To tackle this issue, we propose PSEO, a framework for post-hoc stacking ensemble optimization. First, we conduct base model selection through binary quadratic programming, with a trade-off between diversity and performance. Furthermore, we introduce two mechanisms to fully realize the potential of multi-layer stacking. Finally, PSEO builds a hyperparameter space and searches for the optimal post-hoc ensemble strategy within it. Empirical results on 80 public datasets show that PSEO achieves the best average test rank (2.96) among 16 methods, including post-hoc designs in recent AutoML systems and state-of-the-art ensemble learning methods.
Beicheng Xu, Keyao Ding, Yupeng Lu, Bin Cui 0001
AAAI3