Next-Depth Lookahead Tree
This paper proposes the Next-Depth Lookahead Tree (NDLT), a single-tree model designed to improve performance by evaluating node splits not only at the node being optimized but also by evaluating the quality of the next depth level.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Limited Lookahead in Imperfect-Information Games
Limited lookahead has been studied for decades in perfect-information games. We initiate a new direction via two simultaneous deviation points: generalization to imperfect-information games and a game-theoretic approach.…
Planning and Learning with Adaptive Lookahead
Some of the most powerful reinforcement learning frameworks use planning for action selection. Interestingly, their planning horizon is either fixed or determined arbitrarily by the state visitation history. Here, we exp…
Uncovering Feature Interdependencies in High-Noise Environments with Stepwise Lookahead Decision Forests
Conventionally, random forests are built from "greedy" decision trees which each consider only one split at a time during their construction. The sub-optimality of greedy implementation has been well-known, yet mainstrea…
Time Series AnalysisRolling Lookahead Learning for Optimal Classification Trees
Classification trees continue to be widely adopted in machine learning applications due to their inherently interpretable nature and scalability. We propose a rolling subtree lookahead algorithm that combines the relativ…
Binary ClassificationClassificationDoes Traversal Order Matter? A Systematic Study of Tree Traversal Methods in Transformer Grammars
Transformer Grammars (TGs) enhance language modeling by incorporating syntactic tree structures. Despite the potentially significant impact on model performance of how syntactic trees are linearized in TGs, existing stud…