Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

19395877 · Jun 202019922001200920172026
48 results for Voting Ensemble

RCAM-based ensemble combines binary classifiers using similarity and vote scheme.

problem Improving binary classification accuracy through ensemble methods.
method RCAM-based ensemble combining classifiers using similarity and recurrent consult-vote scheme.
result RCAM-based ensemble outperforms individual classifiers and majority voting.

Optimal number of voters for a voting ensemble can be estimated from the distribution of classifier errors.

problem Finding the optimal number of voters for a voting ensemble to minimize error rate.
method Estimate the distribution of classifier errors and infer error rates for different numbers of voters.
result Lower-variance estimates of error rates can be obtained by inferring them for different numbers of voters.

Novel analysis improves weighted majority vote in multiclass classification.

problem Improving the performance of weighted majority vote in multiclass classification.
method Analyzes expected risk of weighted majority vote, considering prediction correlations and provides a bound for efficient minimization.
result Minimization of the new bound typically does not degrade the test error of the ensemble.

Vote-boosting is a sequential ensemble learning method in which the individual classifiers are built on different weighted versions of the training data. To build a new classifier, the weight of each training instance is determined in terms of the degree of disagreement among the current ensemble predictions for that i…

2016-06-30abs ↗pdf ↗

This paper explores methods for combining predictions in multilabel classification.

problem Lack of formal framework for aggregation in multilabel ensembles.
method Introduces two approaches: 'predict then combine' (PTC) and 'combine then predict' (CTP).
result Standard voting techniques are outperformed by tailored instantiations of CTP and PTC.

Specialists outperform generalists in ensemble classification.

problem Determining the accuracy of an ensemble of classifiers when individual classifier accuracies are known.
method Proved upper and lower bounds on ensemble accuracy, constructed specialist and generalist classifiers.
result Upper and lower bounds on ensemble accuracy, practical implications for classifier construction.

Wisdom of the crowd revealed a striking fact that the majority answer from a crowd is often more accurate than any individual expert. We observed the same story in machine learning--ensemble methods leverage this idea to combine multiple learning algorithms to obtain better classification performance. Among many popula…

2019-09-28abs ↗pdf ↗

Ensembling improves performance when classifiers disagree more than average.

problem When do ensembles provide significant performance improvements in classification tasks?
method Theoretical and empirical analysis of ensemble improvement rate and disagreement-error ratio.
result Ensembling improves performance significantly when the disagreement rate is large relative to the average error rate.

Clustering ensemble is one of the most recent advances in unsupervised learning. It aims to combine the clustering results obtained using different algorithms or from different runs of the same clustering algorithm for the same data set, this is accomplished using on a consensus function, the efficiency and accuracy of…

2012-08-20abs ↗pdf ↗

Existing guarantees in terms of rigorous upper bounds on the generalization error for the original random forest algorithm, one of the most frequently used machine learning methods, are unsatisfying. We discuss and evaluate various PAC-Bayesian approaches to derive such bounds. The bounds do not require additional hold…

2018-10-23abs ↗pdf ↗

New bounds on majority voting's accuracy for multi-class classification problems.

problem Determining the accuracy of majority voting for multi-class classification.
method Analyzing the majority voting function under different voter conditions and distributions.
result The error rate of majority voting exponentially decays or grows with the number of voters under certain conditions.

There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct and independent, and a modern Machine Learning concept called "Strength of Weak L…

2020-02-08abs ↗pdf ↗

Best-of-\infty improves LLM performance by efficiently allocating inference-time computation.

problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.

This study extends verifiable learning to boosted tree ensembles, enabling efficient security verification.

problem Efficiently verifying the robustness of boosted tree ensembles against norm-based attackers.
method Formal verification of robustness for large-spread boosted tree ensembles, considering LL_\infty-norm and pseudo-polynomial time for LpL_p-norm verification.
result Polynomial time verification for LL_\infty-norm attackers, NP-hard for other norms, and pseudo-polynomial time for LpL_p-norm verification.

The paper analyzes how multiple classifiers' disagreement and polarization affect overall accuracy.

problem Improving accuracy through ensembling multiple classifiers.
method The paper derives an upper bound for polarization, proposes a neural polarization law, and presents a tight upper bound for the error of majority vote classifiers.
result Disagreement and polarization among classifiers are linearly correlated with the target, and polarization is nearly constant for a dataset.

HIVE-COTE v1.0 improves time series classification with enhanced usability.

problem Improving time series classification accuracy and usability.
method Presented a walkthrough guide and extensive experimental evaluation of HIVE-COTE v1.0.
result HIVE-COTE v1.0 outperforms three recently proposed algorithms in predictive performance and resource usage.

In this study, a novel sparsity-driven weighted ensemble classifier (SDWEC) that improves classification accuracy and minimizes the number of classifiers is proposed. Using pre-trained classifiers, an ensemble in which base classifiers votes according to assigned weights is formed. These assigned weights directly affec…

2016-10-02abs ↗pdf ↗

ELECTRE Tree infers ELECTRE Tri-B parameters using a machine learning approach.

problem Infer ELECTRE Tri-B parameters from decision-maker inputs.
method Random Forest inspired algorithm: generate models, optimize parameters, merge or vote.
result ELECTRE Tree generates non-linear decision boundaries for voting, linear for merged model.

During the last years, a remarkable breakthrough has been made in AI domain thanks to artificial deep neural networks that achieved a great success in many machine learning tasks in computer vision, natural language processing, speech recognition, malware detection and so on. However, they are highly vulnerable to easi…

2018-03-26abs ↗pdf ↗

Ensemble methods are arguably the most trustworthy techniques for boosting the performance of machine learning models. Popular independent ensembles (IE) relying on naive averaging/voting scheme have been of typical choice for most applications involving deep neural networks, but they do not consider advanced collabora…

2017-06-12abs ↗pdf ↗

In this article, we propose a novel probabilistic framework to improve the accuracy of a weighted majority voting algorithm. In order to assign higher weights to the classifiers which can correctly classify hard-to-classify instances, we introduce the Item Response Theory (IRT) framework to evaluate the samples' diffic…

2019-11-11abs ↗pdf ↗

DAMVI algorithm improves imbalanced binary classification by adjusting weights of examples and classifiers.

problem Imbalanced binary classification tasks where minority class is underrepresented.
method DAMVI algorithm increases positive example weights and optimizes classifier weights using PAC-Bayesian C-Bound.
result DAMVI outperforms state-of-the-art models on various imbalanced datasets.

When randomized ensembles such as bagging or random forests are used for binary classification, the prediction error of the ensemble tends to decrease and stabilize as the number of classifiers increases. However, the precise relationship between prediction error and ensemble size is unknown in practice. In the standar…

2013-03-04abs ↗pdf ↗

Ensemble learning use multiple algorithms to obtain better predictive performance than any single one of its constituent algorithms could. With growing popularity of deep learning, researchers have started to ensemble them for various purposes. Few if any, however, has used the deep learning approach as a means to ense…

2019-05-30abs ↗pdf ↗