Conditional Inference Trees and Forests for Feature Selection

Summary

arXiv:2607.01417v1 Announce Type: new Abstract: Conditional inference trees (CIT) and conditional inference forests (CIF) reduce split-selection bias by testing features before choosing split thresholds, but repeated permutation tests and threshold searches can make these methods computationally expensive. We study CIT and CIF as top-$k$ feature-ranking methods for downstream prediction using real-data benchmarks, runtime ablations, and synthetic feature-recovery experiments. At a fixed node, if

SpinGraph analysis pending — check back after processing.

• How to Allocate Your Tokens? Scaling Laws with Training Steps and Batch Size
• Class-Grouped Normalized Momentum and Faster Hyperparameter Exploration to Tackle Class Imbalance in Federated Learning
• Token Geometry
• Geometry-Aware R-Structured Kolmogorov-Arnold Networks
• On the Utility and Factual Reliability of Pruned Mixture-of-Experts Models in the Biomedical Domain
• The Rollout Infrastructure Tax in Coding-Agent Reinforcement Learning