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

Su I Iao

dblp:383/9498 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
Kernel, tree and ensemble methods · 50% Graph learning · 50%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
gradient boosting
0.912025
Fréchet Geodesic Boosting · NeurIPS 2025
Machine learning › Graph learning
non-euclidean data
0.912025
Fréchet Geodesic Boosting · NeurIPS 2025
Computational geometry › metric geometry
geodesic metric spaces
0.312025
Fréchet Geodesic Boosting · NeurIPS 2025

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

gradient boosting · 1.7geodesic regression · 1.7
YearPublicationVenuePosition
2025 Fréchet Geodesic Boosting
abstract
Gradient boosting has become a cornerstone of machine learning, enabling base learners such as decision trees to achieve exceptional predictive performance. While existing algorithms primarily handle scalar or Euclidean outputs, increasingly prevalent complex-structured data, such as distributions, networks, and manifold-valued outputs, present challenges for traditional methods. Such non-Euclidean data lack algebraic structures such as addition, subtraction, or scalar multiplication required by standard gradient boosting frameworks. To address these challenges, we introduce Fréchet geodesic boosting (FGBoost), a novel approach tailored for outputs residing in geodesic metric spaces. FGBoost leverages geodesics as proxies for residuals and constructs ensembles in a way that respects the intrinsic geometry of the output space. Through theoretical analysis, extensive simulations, and real-world applications, we demonstrate the strong performance and adaptability of FGBoost, showcasing its potential for modeling complex data.
Yidong Zhou 0001, Su I Iao, Hans-Georg Müller
NeurIPS2