arXiv AI

Towards Scalable Meta-Learning of near-optimal Interpretable Models via Synthetic Model Generations

The paper presents a scalable method for meta‑learning interpretable decision trees by generating synthetic pre‑training data. It samples near‑optimal trees to create large, realistic datasets and uses the MetaTree transformer architecture to match the performance of real‑world pre‑training or costly optimal tree training. This approach cuts computational costs, offers flexible data generation, and supports efficient, scalable meta‑learning of decision trees.

arXiv Machine Learning
Oct 9

MotherTree: Meta-learning on synthetic data improves decision tree training

MotherTree is a tabular transformer that meta‑learns to produce hard, axis‑aligned decision trees in a single forward pass. It is pre‑trained on a synthetic prior distribution using stochastic gradient descent, without needing reference trees for supervision. On controlled benchmarks, MotherTree matches or surpasses size‑matched trees from traditional algorithms and serves as a strong initializer for task‑specific fine‑tuning.

By Ziyuan Wang, Fredrik D. Johansson
arXiv AI
Jun 4

Learning to Evaluate: Cost-Effective Model Evaluation on Unlabeled Data with Meta-Learning

arXiv:2605. 23595v2 Announce Type: replace-cross Abstract: The rapid advancement of machine learning has led to an unprecedented expansion of model ecosystems, making it increasingly difficult to assess the reliability of newly released models on unseen and unlabeled data.

By Trinh Pham, Viet Huynh, Hongzhi Yin, Quoc Viet Hung Nguyen, Thanh Tam Nguyen
arXiv Machine Learning
Oct 8

From Prompts to Trees: Effective LLM-Guided Tree Generation for Few-Shot Tabular Classification

The paper introduces a three‑stage framework that uses Large Language Models (LLMs) to generate rules and assemble them into decision trees for few‑shot tabular classification. By distilling LLM knowledge into interpretable trees, the method avoids the high inference costs and limited interpretability of direct LLM application while outperforming traditional decision trees in low‑data settings. Experiments on real‑world datasets show superior accuracy and interpretability with lower prompting overhead compared to existing baselines.

By Yue Qiu, Zekang Du, Yiqun Diao, Bingsheng He, Qinbin Li