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.
A method for combining classifiers from multiple views using Bregman divergences.
problem Combining classifiers from multiple views with limited labeled data.
method Jointly learns view-specific and overall weighted majority vote classifiers using Bregman divergences.
result Empirical results show improved classifier performance with limited labeled data.
New algorithms minimize PAC-Bayesian C-Bound for majority voting, leading to scalable and accurate predictors.
problem Improving majority vote classifiers using PAC-Bayesian bounds.
method Directly optimizing PAC-Bayesian guarantees on the C-Bound with gradient descent.
result Self-bounding majority vote learning algorithms with scalable and accurate predictors.
The paper studies a stochastic majority vote approach to improve classifier accuracy.
problem Improving classifier accuracy over ensembles of classifiers.
method Minimizing a PAC-Bayes generalization bound with Dirichlet distributions.
result Achieves state-of-the-art accuracy and tight generalization bounds.
The C-bound risk analysis improves majority voting in binary classification.
problem Improving binary classification accuracy through majority voting.
method PAC-Bayesian analysis and MinCq learning algorithm.
result MinCq learning algorithm achieves state-of-the-art performance.
The paper analyzes structured prediction with new margin guarantees and learning algorithms.
problem Structured prediction with arbitrary factor graphs and complex loss functions.
method Data-dependent margin guarantees and Voted Risk Minimization principle.
result New learning bounds and algorithms (VCRF, StructBoost) for complex factor graphs.
New bound improves on weighted majority vote risk estimation.
problem Improving risk estimation for weighted majority vote.
method Novel Chebyshev-Cantelli inequality and PAC-Bayes-Bennett inequality.
result New bounds improve on existing methods.
Simpler majority vote of three classifiers achieves optimal error bounds.
problem Developing an optimal PAC learning algorithm in the realizable setting.
method Returning the majority vote of three ERM classifiers.
result Achieves optimal in-expectation bound on error.
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.
In machine learning, Domain Adaptation (DA) arises when the distribution gen- erating the test (target) data differs from the one generating the learning (source) data. It is well known that DA is an hard task even under strong assumptions, among which the covariate-shift where the source and target distributions diver…
New PAC-Bayesian approach for domain adaptation.
problem Learning a model from a source domain for a target domain with distributional shift.
method PAC-Bayesian analysis, deriving an upper-bound on target risk.
result Upper-bound on target risk with distribution divergence controlling trade-off.
PAC-Bayesian bounds estimate adversarial robustness.
problem Estimating robustness to imperceptible input perturbations.
method PAC-Bayesian framework for averaging over hypotheses.
result General bounds valid for any type of adversarial attacks.
New method improves LLM judge accuracy by accounting for dependencies in aggregated binary labels.
problem Classical label aggregation methods fail to account for dependencies among LLM judges, leading to miscalibrated predictions.
method Dependence-aware models based on Ising graphical models and latent factors.
result The proposed method outperforms classical methods on real-world datasets, reducing excess risk.
This paper generalizes an important result from the PAC-Bayesian literature for binary classification to the case of ensemble methods for structured outputs. We prove a generic version of the \Cbound, an upper bound over the risk of models expressed as a weighted majority vote that is based on the first and second stat…
New PAC-Bayesian bounds for multi-view learning using Rényi divergence.
problem Applying PAC-Bayesian theory to multi-view learning.
method Introducing novel PAC-Bayesian bounds based on Rényi divergence for multi-view learning.
result Efficient optimization algorithms that align with theoretical bounds.
The paper challenges the assumption that majority voting rights equate to 'effective control' in foreign ownership regulations.
problem The assumption that majority voting rights determine 'effective control' in foreign ownership regulations is flawed.
method The paper proposes and demonstrates a method for calculating 'effective control' based on voting thresholds and weights.
result The 'effective control' of a foreign minority stockholder can be higher than their shareholding size, challenging the assumption that majority voting rights equate to 'effective control'.
LoCoV reduces portfolio optimization errors from sample covariance matrices.
problem Large errors in sample covariance matrix for optimal portfolio weights.
method LoCoV (low dimension covariance voting) algorithm to reduce these errors.
result LoCoV outperforms classical methods in portfolio optimization experiments.
BigNN classifier improves nearest neighbor classification for large datasets.
problem Classification of large datasets that cannot fit into a single machine's memory.
method Divide and conquer scheme with majority voting for final decision; pre-training acceleration technique.
result Rates of convergence for bigNN classifier under minimal assumptions, proving it as optimal.
Paper proposes a new method for social recommendation in online voting.
problem Challenges in recommending online voting based on social networks and voting content.
method Proposes TEWE for word and document representation and JTS-MF for voting recommendation.
result Proves the effectiveness of the proposed approach compared to state-of-the-art methods.
Delegated votes in Uniswap DAO favor parties with less self-owned votes and a16z-affiliated entities.
problem Incentives for vote delegation in decentralized governance systems.
method Analysis of Uniswap governance DAO using vote delegation data.
result Vote delegation patterns suggest window-dressing around decentralization and merit-based delegation.
In machine learning, the domain adaptation problem arrives when the test (target) and the train (source) data are generated from different distributions. A key applied issue is thus the design of algorithms able to generalize on a new distribution, for which we have no label information. We focus on learning classifica…
Paper proposes a voting method to improve acoustic scene classification.
problem Improving acoustic scene classification accuracy.
method Punishment voting algorithm based on super categories construction.
result Punishment voting significantly improves classification performance.
The C-bound, introduced in Lacasse et al., gives a tight upper bound on the risk of a binary majority vote classifier. In this work, we present a first step towards extending this work to more complex outputs, by providing generalizations of the C-bound to the multiclass and multi-label settings.
A thermodynamic theory explains EU election vote distributions.
problem Describing EU election vote distributions.
method Tracing parallels between system energies of coupled nonlinear oscillators and party vote fractions.
result The Rayleigh-Jeans (RJ) theory well depicts EU vote results and candidate vote dispersion.
Study generalization of voting classifiers using margin-based bounds.
problem Understanding the generalization of ensemble classifiers like voting.
method Proved margin-based generalization bounds using PAC-Bayes theory and Dirichlet posteriors.
result Provided state-of-the-art guarantees on classification tasks.
Boosting improves accuracy by combining weak learners into a voting classifier.
problem Boosting's theoretical performance is sub-optimal, especially for voting classifiers.
method Proposes a randomized boosting algorithm that outputs voting classifiers with a single logarithmic dependency on sample size.
result Randomized boosting achieves a generalization error with a single logarithmic dependency on the sample size.
The 2016 US election results are inferred from census microdata.
problem Estimating vote shares for specific demographic groups from aggregated election data.
method Distribution regression with multinomial-logit model, exploratory data analysis.
result Estimates vote shares for specific demographic groups (e.g., white women, Trump supporters, etc.).
New voting rules protect against strategic voting by robust statistics.
problem Strategic voting can skew election outcomes.
method Revisit Mallows model, develop robust estimator.
result Efficient estimator achieves nearly optimal robustness.
Majority voting neural networks improve binary compressed sensing for sparse signal recovery.
problem Sparse signal recovery in binary compressed sensing.
method Majority voting neural networks with a cross entropy-like term and L1 regularization.
result The majority voting neural network achieves excellent recovery performance, approaching optimal performance as the number of component nets grows.
SBO uses dual voting to build consensus in noisy feedback settings.
problem Collective decision-making under social influence.
method Dual voting system with noisy public votes and private interviews.
result Efficient consensus-building through noisy public votes, debiased by estimated social graph.
Majority-of-Three is Optimal
problem Optimality of Voting Learners
method Majority vote of three classifiers
result Proves optimality for the simplest voting scheme
New voting strategies show committee-based consensus can scale efficiently.
problem Ensuring honest committees in committee-based consensus protocols.
method Empirical analysis of simpler voting strategies and their convergence to optimality.
result Simpler voting strategies converge to optimality exponentially quickly, ensuring robustness and efficiency.
Paper proposes a voting-based MARL approach for IoT systems.
problem Maximizing globally averaged returns in multi-agent IoT systems.
method Formulated as linear programming, proposed distributed primal-dual algorithm, voting mechanism for convergence.
result Distributed learning achieves sublinear convergence rate similar to centralized learning.
Mathematical analysis shows Brexit affects EU voting power in unexpected ways.
problem Effects of Brexit on EU voting power and distribution of power.
method Mathematical analysis using Penrose--Banzhaf Index and normal approximation.
result Non-monotonic effects of Brexit on EU voting power, exacerbated by EU population vector.
In his seminal work, Schapire (1990) proved that weak classifiers could be improved to achieve arbitrarily high accuracy, but he never implied that a simple majority-vote mechanism could always do the trick. By comparing the asymptotic misclassification error of the majority-vote classifier with the average individual …
TBIP uses texts to quantify lawmakers' political positions.
problem Quantifying lawmakers' political positions from speeches, tweets, etc.
method Unsupervised probabilistic topic model analyzing texts.
result TBIP separates lawmakers by party and infers ideal points close to vote-based.
New method improves conformal prediction for ambiguous labels.
problem Uncertainty in expert voting labels affects CP guarantees.
method Develops Monte Carlo CP procedures approximating true posterior.
result Monte Carlo CP closes coverage gap with expert annotations.
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.
Approach to detect emotion from speech using majority voting and selected features.
problem Detecting human emotion from speech.
method Majority voting technique over machine learning models (NN, DT, SVM, KNN).
result Majority voting technique achieves better accuracy than individual models.
New margin bound improves generalization for voting classifiers.
problem Improving generalization bounds for voting classifiers.
method Established a new margin-based generalization bound.
result Derives an optimal weak-to-strong learner with matching theoretical lower bound.
We develop a model of issue-specific voting behavior. This model can be used to explore lawmakers' personal voting patterns of voting by issue area, providing an exploratory window into how the language of the law is correlated with political support. We derive approximate posterior inference algorithms based on variat…
Ensemble CNNs improve mode classification in smartphone travel surveys.
problem Classifying transportation modes from smartphone travel survey data.
method Developed an ensemble of CNN models with different architectures and hyper-parameters, combined using average voting, majority voting, optimal weights, and a Random Forest meta-learner.
result The ensemble method with Random Forest as meta-learner achieved 91.8% accuracy, surpassing other methods.
VORACE uses random classifiers to vote for the best class, saving time and expertise.
problem Finding the best classifier for a dataset is costly and requires domain expertise.
method Randomly generated classifiers vote to determine the best class ranking.
result VORACE outperforms state-of-the-art methods on various datasets.
Proposes a decentralized insurance protocol for DeFi.
problem Over-insurance and inefficiencies in DeFi collateral.
method Smart contract-based economic model without external dependencies.
result Solves over-insurance and capital inefficiencies.
Successful attempts to predict judges' votes shed light into how legal decisions are made and, ultimately, into the behavior and evolution of the judiciary. Here, we investigate to what extent it is possible to make predictions of a justice's vote based on the other justices' votes in the same case. For our predictions…
Activists align with large fund preferences for success.
problem Aligning with large fund preferences increases activist success.
method Analyzed previous proxy voting behavior to estimate preferences and correlated them with activist success.
result Campaigns with higher alignment receive more votes and are more successful.
Voting ensemble of robust models improves robustness.
problem Improving robustness of defensive models against adversarial attacks.
method Hard-label voting ensemble of pretrained robust models.
result Voting ensemble can boost robust error over individual models.
Majority Vote is optimal for reliable data labeling under certain conditions.
problem Reliable data labeling requires aggregating multiple annotators' labels, but the optimality of Majority Vote is not well understood.
method Characterized conditions under which Majority Vote achieves the optimal label estimation error.
result Majority Vote optimally recovers labels for a given class distribution under tolerable annotation noise limits.