arXiv Machine Learning
1d ago

Simple Meta-Learning for HPO and CASH Using Performance Representations

The paper proposes a new meta‑learning representation for hyperparameter optimization (HPO) and combined algorithm selection and hyperparameter optimization (CASH) that encodes each configuration by its historical performance across prior tasks, rather than by explicit hyperparameter values. This performance‑based representation can be used with standard surrogate models, such as linear Bayesian ridge regression, and is applied to a diversity‑based re‑ranking criterion (maximal marginal relevance) as a posterior‑free acquisition rule. Experiments on the TabArena benchmark show that this approach outperforms dedicated meta‑learning baselines, achieving comparable tuned performance in about half the number of trials, and remains competitive for single‑model HPO while scaling independently of search‑space dimensionality.

By Emiel Witting, Cheng Yan, Tom Julian Viering
arXiv AI
Jul 14

Coresets Before Score Sets: Evaluation-Unsupervised Prompt Subset Selection for LLM Benchmarks

arXiv:2607. 09739v1 Announce Type: new Abstract: We study LLM benchmark coreset selection: selecting a small subset of prompts over multiple benchmarks whose induced model scores and rankings approximate those obtained from the full benchmark suite.

By Jihan Yao, Gantavya Bhatt, Arnav Das, Peter Jin, Ke Bao, Qiaolin Yu, Khushi Bhardwaj, Chang Su, Jialei Wang, Yikai Zhu, Sugam Devare, Damon Mosk-Aoyama, Zhen Dong, Venkat Krishna Srinivasan, Yineng Zhang, Oleksii Kuchaiev, Jiantao Jiao, Banghua Zhu, Jeff Bilmes
arXiv Machine Learning
Jul 28

An Empirical Study of Feature Selection Granularity

arXiv:2607. 24145v1 Announce Type: new Abstract: Feature selection aims to identify the most informative and relevant features for a given dataset, either in terms of capturing the underlying data structure and distribution better, or with respect to the performance on a downstream task.

By Muhammad Rajabinasab, Arthur Zimek