Towards scalable meta-learning of near-optimal interpretable models via synthetic model generations
An efficient, scalable method for generating synthetic pre-training data to enable meta-learning of decision trees.
Decision trees are widely used in high-stakes fields like finance and healthcare due to their interpretability. This work introduces an efficient, scalable method for generating synthetic pre-training data to enable meta-learning of decision trees. Our approach samples near-optimal decision trees synthetically, creating large-scale, realistic datasets. Using the MetaTree transformer architecture, we demonstrate that this method achieves performance comparable to pre-training on real-world data or with computationally expensive optimal decision trees. This strategy significantly reduces computational costs, enhances data generation flexibility, and paves the way for scalable and efficient meta-learning of interpretable decision tree models.
Latest publications
R3: robust rubric-agnostic reward models
A novel reward modeling framework that is rubric-agnostic, generalizable, and provides reasoned score assignments.
NeurIPSOn the interpretability and evaluation of graph representation learning
Exploring methods for interpreting and evaluating graph representation learning algorithms.
NeurIPSTimeSqueeze: Dynamic patching
A mechanism that adaptively selects patch boundaries within each sequence based on local signal complexity. (NeurIPS)
NeurIPS