MorphBoost: Self-Organizing Universal Gradient Boosting with Adaptive Tree Morphing
Boris Kriuk

TL;DR
MorphBoost introduces a self-organizing gradient boosting framework with adaptive tree morphing, enabling dynamic split criteria and problem-specific adjustments, leading to improved performance and robustness across diverse datasets.
Contribution
This work presents MorphBoost, a novel gradient boosting method with self-organizing trees that adapt their structure during training, a first in the field.
Findings
Outperforms XGBoost by 0.84% on average across 10 datasets.
Achieves 40% dataset win rate and 20% top-3 finishes.
Maintains lowest variance and highest minimum accuracy among competitors.
Abstract
Traditional gradient boosting algorithms employ static tree structures with fixed splitting criteria that remain unchanged throughout training, limiting their ability to adapt to evolving gradient distributions and problem-specific characteristics across different learning stages. This work introduces MorphBoost, a new gradient boosting framework featuring self-organizing tree structures that dynamically morph their splitting behavior during training. The algorithm implements adaptive split functions that evolve based on accumulated gradient statistics and iteration-dependent learning pressures, enabling automatic adjustment to problem complexity. Key innovations include: (1) morphing split criterion combining gradient-based scores with information-theoretic metrics weighted by training progress; (2) automatic problem fingerprinting for intelligent parameter configuration across…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Domain Adaptation and Few-Shot Learning · Machine Learning and Data Classification
