כתבה
arXiv cs.LG ·
ArborEnum: קבוצות Rashomon לעץ החלטה על תכונות רציפות
ArborEnum: Decision Tree Rashomon Sets over Continuous Features
ניתן לקבוע קבוצות Rashomon לעצי החלטה על תכונות רציפות. החידוש: קבוצות Rashomon על עצי החלטה על תכונות רציפות.
תקציר מקורי באנגליתarXiv:2608.04310v3 Announce Type: replace Abstract: The Rashomon effect describes the phenomenon that many models can achieve nearly equivalent performance on the same learning task, with significant ramifications for robustness, feature importance, and customizability. These use cases motivate the computation of Rashomon sets: the set of all models whose regularized loss is near-optimal. Decision trees are one of the few model classes for which Rashomon sets can be fully enumerated, but this computation has always been conditional on a binarization of the original data, either restricting which splits each tree is allowed to make or substantially increasing the complexity of an already difficult combinatorial problem. We introduce the first algorithm that exactly enumerates decision-tree
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית