mlsanityData to 7 Oct 2026

Voting with Random Classifiers (VORACE): Theoretical and Experimental Analysis

arXiv 1909.08996 ↗First posted 18 Sep 2019cs.LG cs.AI cs.GTcited by 5

Not on the map. Why?

Abstract (arXiv)

In many machine learning scenarios, looking for the best classifier that fits a particular dataset can be very costly in terms of time and resources. Moreover, it can require deep knowledge of the specific domain. We propose a new technique which does not require profound expertise in the domain and avoids the commonly used strategy of hyper-parameter tuning and model selection. Our method is an innovative ensemble technique that uses voting rules over a set of randomly-generated classifiers. Given a new input sample, we interpret the output of each classifier as a ranking over the set of possible classes. We then aggregate these output rankings using a voting rule, which treats them as preferences over the classes. We show that our approach obtains good results compared to the state-of-the-art, both providing a theoretical analysis and an empirical evaluation of the approach on several datasets.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Sep 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 2.

5 papers.