Predictability of Machine Learning Algorithms and Related Feature Extraction Techniques
Not on the map. Why?
Abstract (arXiv)
This thesis designs a prediction system based on matrix factorization to predict the classification accuracy of a specific model on a particular dataset. In this thesis, we conduct comprehensive empirical research on more than fifty datasets that we collected from the openml website. We study the performance prediction of three fundamental machine learning algorithms, namely, random forest, XGBoost, and MultiLayer Perceptron(MLP). In particular, we obtain the following results: 1. Predictability of fine-tuned models using coarse-tuned variants. 2. Predictability of MLP using feature extraction techniques. 3. Predict model performance using implicit feedback.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 83 references that are in the map. First posted on arXiv 30 Apr 2023.
Builds on
13 of 83 references.
References · 13
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2014Deep Learning in Neural Networks: An Overviewcited by 765
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2014OpenML: networked science in machine learningcited by 523
- 2013Predicting Parameters in Deep Learningcited by 223
- 2017Hyperparameter Importance Across Datasetscited by 62
- 2018Benchmarking Automatic Machine Learning Frameworkscited by 15
- 2016Endgame Analysis of Dou Shou Qicited by 11
- 2016Efficient L1-Norm Principal-Component Analysis via Bit Flippingcited by 9
- 2013Perceptron Mistake Boundscited by 5
- 2020Optimization of data-driven filterbank for automatic speaker verificationcited by 2
1 more
Built on by
Not cited yet.