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

Zhongming Xie

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

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

Artificial intelligence and machine learning · 2 · 2 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
Learning theory · 40% Kernel, tree and ensemble methods · 40% Trustworthy machine learning · 20%
Theoretical computer science
1 paper
Mathematical optimization · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.912025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness
distributional robustness
0.912025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.912025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025
Machine learning › Learning theory › statistical estimation › semiparametric estimation
semiparametric efficiency
0.912025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025
Machine learning › Learning theory
statistical estimation
0.912025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025
Mathematical optimization › continuous optimization
convex optimization
0.312025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025
Algorithms and data structures › kernel methods
kernel ridge regression
0.312025
Ridge Boosting is Both Robust and Efficient · NeurIPS 2025

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

semiparametric efficiency theory · 1.7kernel ridge regression · 1.7boosting · 1.7
YearPublicationVenuePosition
2026 Inferring anti-viral drugs using nonnegative matrix factorization with self-paced learning and hypergraph regularization
Zhongming Xie, Yuhan Fan, Kaiyang Zhong, Muhammet Deveci
Expert Syst. Appl.2
2025 Ridge Boosting is Both Robust and Efficient
abstract
Estimators in statistics and machine learning must typically trade off between efficiency, having low variance for a fixed target, and distributional robustness, such as \textit{multiaccuracy}, or having low bias over a range of possible targets. In this paper, we consider a simple estimator, \emph{ridge boosting}: starting with any initial predictor, perform a single boosting step with (kernel) ridge regression. Surprisingly, we show that ridge boosting simultaneously achieves both efficiency and distributional robustness: for target distribution shifts that lie within an RKHS unit ball, this estimator maintains low bias across all such shifts and has variance at the semiparametric efficiency bound for each target. In addition to bridging otherwise distinct research areas, this result has immediate practical value. Since ridge boosting uses only data from the source distribution, researchers can train a single model to obtain both robust and efficient estimates for multiple target estimands at the same time, eliminating the need to fit separate semiparametric efficient estimators for each target. We assess this approach through simulations and an application estimating the age profile of retirement income.
David Bruns-Smith, Zhongming Xie, Avi Feller
NeurIPS2