7 articles tagged with #decision-trees. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce Arbor, a framework that decomposes large language model decision-making into specialized node-level tasks for critical applications like healthcare triage. The system improves accuracy by 29.4 percentage points while reducing latency by 57.1% and costs by 14.4x compared to single-prompt approaches.
Researchers propose Concept Flow Models (CFMs), a hierarchical approach to interpretable AI that addresses information leakage problems in existing Concept Bottleneck Models. By organizing semantic concepts into decision trees rather than flat structures, CFMs maintain predictive accuracy while improving model transparency and reducing spurious correlations.
Researchers introduce PRAXIS, an algorithm that efficiently computes Rashomon sets—collections of near-optimal machine learning models—achieving orders of magnitude improvements in runtime and memory usage compared to existing methods. The breakthrough enables practitioners to scalably explore model diversity and incorporate domain knowledge into decision-making for interpretable models like decision trees.
Researchers demonstrate that a deep reinforcement learning policy for power grid control can be compressed into interpretable decision trees and random forests without performance loss. The distilled models outperform the original neural network while remaining transparent and deployable on resource-constrained hardware, though with topology-specific limitations.
Researchers propose an anytime-valid inference method to correct split selection in decision trees used for streaming data, addressing a critical statistical gap where existing Hoeffding Trees lack valid guarantees despite empirical success. The approach provides false-split control across arbitrary data streams while producing smaller, more efficient trees than current methods.
Researchers introduce DTSemNet, a novel neural network representation of oblique decision trees that enables approximation-free gradient-based training for both classification and regression tasks. The approach eliminates reliance on softening or quantized gradients, achieving superior performance on benchmark datasets and expanding decision tree applicability to reinforcement learning environments.
Researchers introduce DT-PBO, a tree-based surrogate model for Preferential Bayesian Optimization that prioritizes interpretability over traditional Gaussian Process approaches. The method achieves competitive performance on benchmark functions while providing transparent insights into decision-maker preferences, addressing critical needs in high-stakes domains like healthcare.
