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,786 papers · 148 categories

Trend · papers per month

3.8%7.7%11.5%15.4% · Dec 201919922001200920172026
48 results for Individualized Classifier Ensemble

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.

Random Hyperboxes is a simple yet effective ensemble classifier.

problem Improving classification accuracy using ensemble methods.
method Random subsets of sample and feature spaces are used to train individual hyperbox-based classifiers, which are then combined into an ensemble.
result The proposed classifier outperforms other fuzzy min-max neural networks and ensemble methods on 20 datasets.

In ensemble methods, the outputs of a collection of diverse classifiers are combined in the expectation that the global prediction be more accurate than the individual ones. Heterogeneous ensembles consist of predictors of different types, which are likely to have different biases. If these biases are complementary, th…

2018-02-21abs ↗pdf ↗

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.

Learning algorithms that aggregate predictions from an ensemble of diverse base classifiers consistently outperform individual methods. Many of these strategies have been developed in a supervised setting, where the accuracy of each base classifier can be empirically measured and this information is incorporated in the…

2018-02-13abs ↗pdf ↗

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 how diverse neural network ensembles improve prediction accuracy and robustness against deception.

problem Improving prediction accuracy and robustness of neural networks against adversarial attacks.
method Examines and measures ensemble diversity, develops algorithms for creating and combining diverse ensembles.
result Greater diversity in neural network ensembles leads to higher accuracy and robustness against deception.

XGBOD combines unsupervised and supervised methods for better outlier detection.

problem Enhanced outlier detection from normal observations in various datasets.
method Hybrid approach using unsupervised representation learning to improve a supervised classifier.
result XGBOD outperforms competing methods across seven datasets.

Paper combines RL with classifiers to improve financial trading strategies.

problem Enhancing risk-return trade-offs in trading strategies.
method Combining Reinforcement Learning (RL) models with traditional classifiers like SVM, Decision Trees, and Logistic Regression.
result Ensemble methods often outperform base models in risk-adjusted returns.

This paper describes structuring data and constructing plots to explore forest classification models interactively. A forest classifier is an example of an ensemble, produced by bagging multiple trees. The process of bagging and combining results from multiple trees, produces numerous diagnostics which, with interactiv…

2017-04-08abs ↗pdf ↗

Quantum algorithm improves ensemble classification with reduced memory and time requirements.

problem High memory and computational time requirements in ensemble methods.
method Quantum superposition, entanglement, and interference to build an ensemble of classification models.
result Exponential growth of ensemble size with linear increase in depth of circuit.

XEM improves multivariate time series classification with explainable models.

problem Multivariate time series classification challenges.
method Hybrid ensemble method combining explicit boosting-bagging and implicit divide-and-conquer.
result XEM outperforms state-of-the-art MTS classifiers on public datasets.

Methods for unsupervised anomaly detection suffer from the fact that the data is unlabeled, making it difficult to assess the optimality of detection algorithms. Ensemble learning has shown exceptional results in classification and clustering problems, but has not seen as much research in the context of outlier detecti…

2016-10-24abs ↗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.

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 ↗

WRSE predicts dynamic survival distributions in ICU patients.

problem Dynamic assessment of ICU patient mortality risk.
method Non-parametric weighted-resolution ensemble model combining binary classifiers.
result Competitive results with state-of-the-art models, reducing training time.

This paper improves deep learning model consistency through ensemble methods.

problem Consistency and correct-consistency issues in deep learning models.
method Formal definition of consistency and correct-consistency, proving ensemble improvement, proposing dynamic snapshot ensemble method.
result Ensemble methods can improve correct-consistency of deep learning models.

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.

Though deep neural networks have achieved significant progress on various tasks, often enhanced by model ensemble, existing high-performance models can be vulnerable to adversarial attacks. Many efforts have been devoted to enhancing the robustness of individual networks and then constructing a straightforward ensemble…

2019-01-25abs ↗pdf ↗

Improved stock trading model using feature selection and ensemble learning.

problem Challenges in making profit in the US stock market.
method Feature selection from 148 to 30, dynamic selection of top 25 features, ensemble learning with four classifiers.
result Best model generated 54.35% profit over 18 months.

FAST-DAD distills complex ensemble models into faster, more accurate individual models.

problem Deploying complex AutoML ensemble predictors on tabular data is slow, large, and opaque.
method Data augmentation strategy based on Gibbs sampling from a self-attention pseudolikelihood estimator.
result FAST-DAD distillation produces significantly better individual models than standard training.

Ensemble learning that can be used to combine the predictions from multiple learners has been widely applied in pattern recognition, and has been reported to be more robust and accurate than the individual learners. This ensemble logic has recently also been more applied in feature selection. There are basically two st…

2018-11-19abs ↗pdf ↗

Consider a binary decision making process where a single machine learning classifier replaces a multitude of humans. We raise questions about the resulting loss of diversity in the decision making process. We study the potential benefits of using random classifier ensembles instead of a single classifier in the context…

2017-06-30abs ↗pdf ↗

We propose and evaluate alternative ensemble schemes for a new instance based learning classifier, the Randomised Sphere Cover (RSC) classifier. RSC fuses instances into spheres, then bases classification on distance to spheres rather than distance to instances. The randomised nature of RSC makes it ideal for use in en…

2014-09-17abs ↗pdf ↗

Stabilizes online learning by using weighted reservoir sampling.

problem Real-world deployment sensitivity to outliers causes low accuracy in final solutions.
method Weighted reservoir sampling to stabilize ensemble model without additional data passes.
result Risk of ensemble classifier is bounded with respect to the underlying online learning method's regret.

Ensembles improve classifier performance by reducing bias, not variance.

problem Improving classifier performance through ensemble methods.
method Extended bias-variance decomposition for classification tasks, introducing dual reparameterization.
result Ensembling reduces bias in classifiers, contrary to the traditional view.

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 ↗

Suppose some classifiers are selected from a set of hypothesis classifiers to form an equally-weighted ensemble that selects a member classifier at random for each input example. Then the ensemble has an error bound consisting of the average error bound for the member classifiers, a term for selectivity that varies fro…

2016-10-04abs ↗pdf ↗

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.

In multiple instance learning, objects are sets (bags) of feature vectors (instances) rather than individual feature vectors. In this paper we address the problem of how these bags can best be represented. Two standard approaches are to use (dis)similarities between bags and prototype bags, or between bags and prototyp…

2014-02-06abs ↗pdf ↗

A new adaptive kNN classifier outperforms Random Forests.

problem Improving classification accuracy using nearest neighbors.
method Finding discriminant subspaces for efficient nearest neighbor classification, leveraging bagging for diversity.
result The proposed method outperforms Random Forests and other nearest neighbors ensembles.

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.

Jointly tuning ensemble models improves performance and uncertainty calibration.

problem Improving both predictive performance and uncertainty calibration in deep ensembles.
method Investigated the impact of jointly tuning weight decay, temperature scaling, and early stopping.
result Jointly tuning ensemble models generally matches or improves performance, with significant variation across tasks.

A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively applies binary splits to divide the set of classes into two subsets, and trains a binary classifier for each split. Many methods have been proposed to perform this split, each …

2018-09-08abs ↗pdf ↗

DiwE uses regional distribution changes to create diverse ensemble classifiers for concept drift.

problem Handling concept drift in evolving data streams.
method DiwE measures diversity based on regional distribution disagreement and uses it to weight instances and select classifiers.
result DiwE outperforms other algorithms on various synthetic and real-world data stream benchmarks.