Optimal adversarial noise algorithms for multiple classifiers using game theory.
problem Designing robust attacks against multiple classifiers.
method Formulating the problem as a two-player, zero-sum game and using Multiplicative Weights Update framework with best response oracles.
result Demonstrated the effectiveness of randomization in adversarial attacks and optimal mixed strategies.
New classifier combines locally linear kernels for fast and accurate non-linear classification.
problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a ℓ1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels. result The resulting classifier achieves high accuracy with fast inference time.
Paper proposes a new method to compare classifiers across multiple datasets.
problem Comparing classifiers over multiple datasets with multiple criteria.
method Adopting decision theory, the paper introduces generalized stochastic dominance for ranking classifiers.
result Generalized stochastic dominance can be used to rank classifiers and statistically tested.
Classifies compact multiplicity free quasi-Hamiltonian manifolds.
problem Classifying compact, multiplicity free, quasi-Hamiltonian manifolds.
method Symplectic reductions and Lie group analysis.
result Recover old and find new examples of these structures.
The paper classifies symmetric triads with multiplicities and their applications.
problem Classifying symmetric triads with multiplicities and their applications.
method Developed the theory of symmetric triads with multiplicities, classified abstract triads, and determined corresponding triads for commutative compact triads.
result Classified symmetric triads with multiplicities and their applications.
DMT improves accuracy on noisy biomedical data.
problem Noisy data affects classification accuracy.
method Diversified Multiple Tree (DMT) ensemble classifier.
result DMT outperforms other classifiers on noisy data.
The paper classifies multiplicity free Hamiltonian actions and quasi-Hamiltonian manifolds.
problem Classifying multiplicity free Hamiltonian actions and quasi-Hamiltonian manifolds.
method Classification through symplectic reductions and actions on loop groups.
result Recovery of old and new examples of multiplicity free structures.
Improved indoor localization using multiple fingerprints from multiple antennas.
problem Susceptibility of single fingerprint approaches to changing environments and multi-path propagation.
method Fused Group of Fingerprints (FAGOT) via multiple antennas, parallel GOOF multiple classifiers, MUCUS fusion algorithm.
result Significantly improved prediction accuracy compared to single fingerprint approaches.
A fusion of multiple classifiers improves indoor localization using visible light.
problem Indoor localization accuracy and robustness using visible light.
method Transmit different intensity modulated sinusoidal signals, capture peaks of PSD, train multiple classifiers, and combine their outputs using robust fusion algorithms.
result The proposed algorithms significantly improve localization accuracy and robustness compared to existing methods.
ActiveLab improves classifier accuracy with fewer annotations by re-labeling.
problem Imperfect labels from multiple annotators in real-world data.
method ActiveLab automatically decides when to re-label examples for better classifier training.
result ActiveLab trains more accurate classifiers with fewer annotations.
Adversaries with multiple antennas can fool deep learning modulators more effectively.
problem Improving evasion attacks on deep learning-based modulation classifiers.
method Utilizing multiple antennas to enhance adversarial attacks on deep learning classifiers.
result Adversarial attacks with multiple antennas significantly improve classifier accuracy.
StylEx trains a GAN to explain classifier decisions in StyleSpace.
problem Creating meaningful image-specific explanations for classifier decisions.
method Training a StyleGAN to learn a classifier-specific StyleSpace, incorporating the classifier model.
result StylEx finds attributes that align with semantic ones and generates human-interpretable explanations.
Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.
problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.
ICE improves classification performance by leveraging internal patterns among instances.
problem Inconsistent results for different MCS algorithms on specific problems.
method ICE groups training data into overlapping clusters, builds classifiers for each cluster, and predicts class labels by averaging predictions from top-performing models.
result ICE provides a stable improvement on a significant proportion of datasets over existing MCS methods.
New classifiers ensure fairness by adjusting a base classifier's operating characteristics.
problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.
Bayesian model fuses multiple classifiers with explicit correlation modeling.
problem Combining outputs of multiple classifiers with explicit correlation.
method Hierarchical Bayesian model with correlated Dirichlet distribution.
result Fused classifier performance can be Bayes optimal even for highly correlated base classifiers.
Proposes a new scoring function for linear classifiers to improve object positioning in feature space.
problem Lack of information about relative positions of recognized objects in feature space.
method Calculates a scoring function based on object distance from decision boundary and class centroid.
result Demonstrates effectiveness of the proposed method compared to other ensemble algorithms on multiple datasets.
The paper introduces a method to find multiple interpretable classifiers from a dataset.
problem Finding multiple accurate classifiers that are also interpretable.
method Introduces a method to identify a maximal set of distinct but accurate models for a dataset.
result Empirically demonstrates simpler, more interpretable classifiers are recovered.
Improved average distance classifier for HDLSS settings with multiple population differences.
problem Poor performance of average distance classifier in HDLSS settings with location and scale differences.
method Proposed transformations to the average distance classifier to handle multiple population differences.
result The proposed classifiers perform well even when populations differ in other aspects than location and scale.
Bayesian model compares classifier accuracies across multiple datasets.
problem Shortcomings of null hypothesis significance tests in comparing classifier accuracies.
method Bayesian hierarchical model analyzing cross-validation results.
result Posterior probability of classifier accuracies being equivalent or different.
A model finds interpretable prototypes for MIL datasets.
problem Finding interpretable prototypes for multiple instance learning.
method Permutation invariant maximally predictive prototype generator.
result The model outperforms existing approaches in accuracy and efficiency.
Proposes a new MIL formulation using infinitely many shapelets.
problem Weakness of single shapelet classifiers and lack of theoretical guarantee for multiple shapelets.
method Formulates a new MIL approach with infinitely many shapelets and provides an efficient algorithm.
result Empirical study shows effectiveness in MIL and Shapelet Learning.
Classifies Hamiltonian and quasi-Hamiltonian manifolds with specific group actions.
problem Classifying specific types of manifolds under group actions.
method General classification of multiplicity free manifolds, focusing on rank one.
result Obtained numerous new concrete examples of quasi-Hamiltonian manifolds.
The paper tackles fair classification with multiple sensitive features.
problem Existing fair classification methods often consider a single sensitive feature, but in practice, individuals are defined by multiple sensitive features.
method Characterizes Bayes-optimal fair classifiers for multiple sensitive features under various fairness measures, proposing in-processing and post-processing algorithms.
result Bayes-optimal fair classifiers for multiple sensitive features are instance-dependent thresholding rules that rely on a weighted sum of group membership probabilities.
This paper uses MIL and MHCNN-RNN to predict precursors to aviation safety events.
problem Identifying events that precede aviation safety incidents.
method Multiple-instance learning (MIL) framework combined with a Multi-Head Convolutional Neural Network-Recurrent Neural Network (MHCNN-RNN) architecture.
result Multiple binary classifiers outperform in predicting high speed and high path angle events during the approach phase.
Proposes a method to evaluate classifiers with missing labels using multiple imputation.
problem Missing labels during model evaluation can introduce bias, especially in Missing Not At Random (MNAR) data.
method Develops a multiple imputation technique to estimate and provide predictive distributions for metrics like precision, recall, and ROC-AUC.
result The predictive distribution's location and shape are generally correct, even in the MNAR regime.
In various situations one is given only the predictions of multiple classifiers over a large unlabeled test data. This scenario raises the following questions: Without any labeled data and without any a-priori knowledge about the reliability of these different classifiers, is it possible to consistently and computation…
Paper presents an efficient algorithm for learning minimax risk classifiers with large-scale data.
problem Efficient learning of minimax risk classifiers for large-scale data with multiple classes.
method Combination of constraint and column generation for efficient learning.
result 10x speedup for general large-scale data and 100x speedup with many classes.
The study examines instance label stability in MIL classifiers trained on global image annotations.
problem Instance labels in MIL classifiers can be unstable, leading to incorrect fine-grained annotations.
method Investigated instance stability on 5 datasets, proposing an unsupervised measure.
result A performance-stability trade-off can be made when comparing MIL classifiers.
Collaborative learning improves deep neural networks by combining multiple classifier heads.
problem Improving generalization and robustness to label noise in deep neural networks.
method Simultaneously training multiple classifier heads on the same data, using supplementary information and gradient aggregation.
result Deep neural networks perform better with collaborative learning, reducing generalization error and robustness to label noise.
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.
Efficient method estimates classifier accuracy with unlabeled data and logical constraints.
problem Estimating classifier accuracy using only unlabeled data with logical constraints.
method Based on the agreement of classifiers and logical constraints violations.
result Accuracy estimates within a few percent of true accuracy, outperforming existing solutions.
Efficient algorithm for evaluating hierarchical classification methods at multiple operating points.
problem Evaluating hierarchical classification methods at multiple operating points.
method Efficient algorithm to produce operating characteristic curves for any method that assigns scores to every class in the hierarchy.
result Top-down classifiers are dominated by a naive flat softmax classifier across the entire operating range.
Weakly Einstein Kähler surfaces are characterized and classified.
problem Characterizing and classifying weakly Einstein Kähler surfaces.
method Several conditions and constructions to characterize and classify weakly Einstein Kähler surfaces.
result Classification of weakly Einstein Kähler surfaces with specific properties and construction of new examples.
Improved signal classification using multiple wavelets and their smooth coefficients.
problem Signal classification accuracy declines with reduced attributes.
method Transform data with multiple wavelets, combine outputs, apply ensemble classifiers.
result Proposed technique outperforms raw data and single wavelet approaches.
Meta-learning method for accurate classifier from noisy annotators' data.
problem Accurate learning from noisy labels provided by multiple annotators.
method Meta-learning neural network to embed examples in latent space and estimate annotators' abilities, then adapt classifiers using EM algorithm.
result Meta-learning method improves classifier performance with minimal labeled data.
A blind scheme combines multiple classifiers without knowing their training labels.
problem Combining multiple classifiers to achieve high performance.
method Moment matching method using tensor and matrix factorization.
result Proposed blind scheme outperforms known methods on synthetic and real datasets.
Optimal kernel sum classifiers analyzed for statistical efficiency.
problem Analyzing the statistical efficiency of optimal kernel sum classifiers.
method Combining optimization tools with learning theory bounds to analyze sample complexity.
result Justifies assumptions in prior work on multiple kernel learning and provides a new form of Rademacher complexity.
Efficient learning of minimax risk classifiers in high dimensions.
problem Efficient learning of classifiers in high-dimensional data.
method Iterative algorithm leveraging constraint generation methods for minimax risk classifiers.
result The algorithm provides efficient learning and feature selection in high-dimensional scenarios.
In a broad range of classification and decision making problems, one is given the advice or predictions of several classifiers, of unknown reliability, over multiple questions or queries. This scenario is different from the standard supervised setting, where each classifier accuracy can be assessed using available labe…
Kernel and MKCCA classify schizophrenia patients from imaging and genetic data.
problem Classifying schizophrenia patients from imaging and genetic data.
method Employed Kernel and Multiple Kernel Canonical Correlation Analysis (CCA) for classification.
result Kernel and Multiple Kernel CCA significantly outperform regularized linear CCA in classification accuracy.
The paper briefly introduces multiple classifier systems and describes a new algorithm, which improves classification accuracy by means of recommendation of a proper algorithm to an object classification. This recommendation is done assuming that a classifier is likely to predict the label of the object correctly if it…
Study rectifying curves in 3D multiplicative Euclidean space.
problem Investigate rectifying curves in a non-Newtonian geometry setting.
method Apply multiplicative differential-geometric concepts to rectifying curves.
result Classify multiplicative rectifying curves using spherical curves.
Improves multi-label classification with a new network model.
problem Improving multi-label classification accuracy.
method Introduces Classifier Chain Network (CCN) for multi-label classification.
result CCN outperforms benchmark methods in simulations and real data.
Fused Group of Fingerprints improves indoor localization accuracy and reduces fingerprint building time.
problem Susceptibility to changing environment, multipath, and NLOS propagation in SIOF; time-consuming fingerprint building.
method Building a GOOF from multiple antenna transformations, training GOOF-RF classifiers, SWIM fusion algorithm.
result Significantly improved localization accuracy and reduced fingerprint building time.
A neural network approach solves multiple-instance problems more effectively.
problem Difficult to describe objects by a single vector, requiring bag-level classification.
method Proposes a neural network formalism for MIL problems, optimizing with modified back-propagation.
result Shows superior performance compared to existing classifiers on 14 benchmark datasets.
Learning multiple tasks across heterogeneous domains is a challenging problem since the feature space may not be the same for different tasks. We assume the data in multiple tasks are generated from a latent common domain via sparse domain transforms and propose a latent probit model (LPM) to jointly learn the domain t…
Paper proposes MCMA architecture for neural approximate computing with higher invocation rate and energy savings.
problem Limited invocation rate of neural approximators leading to suboptimal energy efficiency.
method Introduces MCMA architecture with a multiclass classifier and multiple approximators, sharing hardware resources and efficiently swapping approximators.
result Significantly higher invocation rate and energy savings compared to existing methods.