Learning Abstract Task Representations
Not on the map. Why?
Abstract (arXiv)
A proper form of data characterization can guide the process of learning-algorithm selection and model-performance estimation. The field of meta-learning has provided a rich body of work describing effective forms of data characterization using different families of meta-features (statistical, model-based, information-theoretic, topological, etc.). In this paper, we start with the abundant set of existing meta-features and propose a method to induce new abstract meta-features as latent variables in a deep neural network. We discuss the pitfalls of using traditional meta-features directly and argue for the importance of learning high-level task properties. We demonstrate our methodology using a deep neural network as a feature extractor. We demonstrate that 1) induced meta-models mapping abstract meta-features to generalization performance outperform other methods by ~18% on average, and 2) abstract meta-features attain high feature-relevance scores.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 19 Jan 2021.
Builds on
10 of 26 references.
References · 10
- 2015Fast R-CNNcited by 2,930
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2014OpenML: networked science in machine learningcited by 523
- 2018Meta-Learning: A Surveycited by 254
- 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
- 2016Time for a change: a tutorial for comparing multiple classifiers through Bayesian analysiscited by 92
- 2018How Complex is your classification problem? A survey on measuring classification complexitycited by 66
- 2019Dataset2Vec: Learning Dataset Meta-Featurescited by 37
- 2018Characterizing classification datasets: a study of meta-features for meta-learningcited by 6
- 2018Examining the Use of Neural Networks for Feature Extraction: A Comparative Analysis using Deep Learning, Support Vector Machines, and K-Nearest Neighbor Classifierscited by 5
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1.
3 papers.
- 2022Advances in MetaDL: AAAI 2021 challenge and workshopcited by 4
- 2022problexity -- an open-source Python library for binary classification problem complexity assessmentcited by 2
- 2025An experimental survey and Perspective View on Meta-Learning for Automated Algorithms Selection and Parametrizationcited by 1
- 2025An experimental survey and Perspective View on Meta-Learning for Automated Algorithms Selection and Parametrization8 Apr 2025
- 2022problexity -- an open-source Python library for binary classification problem complexity assessment14 Jul 2022
- 2022Advances in MetaDL: AAAI 2021 challenge and workshop1 Feb 2022