This paper presents a novel kernel-based generative classifier which is defined in a distortion subspace using polynomial series expansion, named Kernel-Distortion (KD) classifier. An iterative kernel selection algorithm is developed to steadily improve classification performance by repeatedly removing and adding kerne…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “classifier performance improvement”
Enhances classifier performance through feature space transformations and model selection.
problem Improving the accuracy of classifiers by reducing complexity.
method Combining feature mapping, prototype selection, and kernel function transformations to transform data into a more convenient distribution.
result Our methods produce competitive classifiers and are statistically different among them.
Ensemble Quantile Classifierstat.ML
Ensemble quantile classifier improves performance on high-dimensional data.
problem Discriminating high-dimensional data with heavy-tailed or skewed inputs.
method Regularized quantile classifier that assigns variable weights.
result Consistently estimates minimal population loss and is Bayes optimal.
Study evaluates when splitting classifiers can improve performance despite disparate treatment.
problem Impact of disparate treatment in classification models.
method Comparison of split classifiers and group-blind classifiers, quantifying performance improvement.
result Proves an equivalent expression for the benefit-of-splitting which can be efficiently computed.
SESSC clusters fuzzy rules for TSK classifiers, improving performance with label info.
problem Lack of supervised clustering for TSK fuzzy classifiers.
method SESSC integrates within-cluster compactness, between-cluster separation, and label information.
result SESSC initialization outperforms other clustering methods, especially for small rule numbers.
New AI error correctors improve classifier performance with provable guarantees.
problem Improving AI classifier performance with scarce training data.
method Weakly supervised AI error correctors with performance guarantees.
result Provable performance guarantees for AI error correction.
Proposes an IRT-based ensemble method to improve machine learning accuracy.
problem Improving the accuracy of machine learning models, especially for hard-to-classify instances.
method Introduces Item Response Theory (IRT) to evaluate sample difficulty and classifier ability, creating three models with different assumptions.
result The proposed IRT ensemble model outperforms other methods on 19 datasets.
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.
We propose a generic and interpretable learning framework for building robust text classification model that achieves accuracy comparable to full models under test-time budget constraints. Our approach learns a selector to identify words that are relevant to the prediction tasks and passes them to the classifier for pr…
AutoML explores vs. exploits promising classifiers to improve performance.
problem Maximizing ML pipeline performance within limited time and resource constraints.
method Empirical study comparing exploiting vs. exploring the search space for promising classifiers.
result Exploiting the most promising classifiers does not statistically improve pipeline performance.
Improved ECG classification using multi-task learning.
problem Low frequency of rare diagnoses in ECGs.
method Developed a multi-task CNN to classify multiple diagnoses from 12-lead ECGs.
result Adding common classes improves performance on rarer classes.
In this paper we present a new Bayesian network model for classification that combines the naive-Bayes (NB) classifier and the finite-mixture (FM) classifier. The resulting classifier aims at relaxing the strong assumptions on which the two component models are based, in an attempt to improve on their classification pe…
Improved image classifier performance with faster training using adaptive learning rates.
problem Lower accuracy and training time in small datasets.
method Dynamic learning rate tuning for different model architectures.
result Two-fold to ten-fold speedup in accuracy over state-of-the-art methods.
Enhances multi-tag classification using low-dimensional vector representations and virtual data.
problem Improving the performance of multi-tag classifiers.
method Embedding raw data into a low-dimensional feature space, then generating virtual data from linear operations on these vectors, to train multi-tag classifiers.
result Significant improvement in F1 scores (up to 224%) compared to training directly with raw data.
Improved R-QDA classifier performs well in unbalanced data settings.
problem High sensitivity of R-QDA to covariance matrix estimation noise in unbalanced data.
method Proposes an improved R-QDA with two regularization parameters and a modified bias.
result Significantly better classification performance compared to traditional R-QDA.
Dynamic classifier selection systems aim to select a group of classifiers that is most adequate for a specific query pattern. This is done by defining a region around the query pattern and analyzing the competence of the classifiers in this region. However, the regions are often surrounded by noise which can difficult …
New method improves robustness of smoothed classifiers against adversarial attacks.
problem Improving robustness of smoothed classifiers against adversarial attacks.
method Proposes worst-case adversarial loss over input distributions as a robustness certificate, and uses duality and smoothness properties to provide an easy-to-compute upper bound.
result Shows superior robustness performance over state-of-the-art certified or heuristic methods.
Classifier chains link binary classifiers for multi-label learning, achieving state-of-the-art performance.
problem Multi-label learning problems where multiple labels can be assigned to instances.
method Linking off-the-shelf binary classifiers in a chain structure.
result Classifier chains achieve state-of-the-art performance across various datasets and metrics.
Autoencoders improve anomaly detection by deriving features and augmenting data.
problem Poor performance of one-class classifiers in high-dimensionality and sparsity.
method Uses autoencoders to derive meaningful latent variables and augment data for OCC training.
result Enhances OCC algorithms' performance and outperforms other methods.
SGD improves performance by learning increasingly complex functions.
problem Understanding how SGD learns complex functions in neural networks.
method Experimental study of SGD dynamics in neural networks.
result SGD learns functions of increasing complexity over time.
New correlation measures improve classifier performance assessment.
problem Improving assessment of classifiers and raters.
method Introducing CO-, ANTI-, and COANTI-correlation coefficients.
result Demonstrated new measures are powerful for classifying confusion matrices.
Adversarial robustness improved by abstaining from decisions.
problem Improving classification accuracy in the presence of adversarial perturbations.
method Introducing an abstain option in binary classification problems, using metrics to quantify performance and robustness.
result There is a tradeoff between nominal performance and adversarial robustness.
Classifier learns to ignore unreliable feedback from end users.
problem Improving classifier performance by filtering unreliable feedback.
method Modeling end users as autonomous agents, periodically retraining classifier with filtered feedback.
result Classifier can identify and filter out unreliable feedback, improving performance.
Generative GAN improves classifier performance with limited training data.
problem Limited training data for black-box API attacks.
method Generative adversarial network (GAN) to generate synthetic training data.
result Improves classifier performance with synthetic data.
Better calibration for small datasets improves probability estimates.
problem Limited data hinders traditional calibration methods.
method Generating additional calibration data improves classifier performance.
result The proposed approach enhances calibration for small datasets.
Context improves one-class classifiers in dynamic data streams.
problem Improving one-class classification in data streams with limited training data.
method Proposes using context to guide one-class classifier learning in data streams, presenting three frameworks.
result The use of context can improve the performance of streaming one-class classifiers.
Paper proposes a classifier to improve medical image classification with limited data.
problem Limited training data leads to overfitting in medical image classification.
method Uses reinforcement learning to update classifier parameters with generalization feedback from a subset of training data.
result Improves classification performance and demonstrates generalized learning.
Machine learning improves fiber nonlinearity detection.
problem Mitigating nonlinear effects in optical fiber channels.
method Parzen window classifier applied to detect nonlinear fiber channel.
result Performance improvement in dispersion managed and unmanaged systems.
NCC is inefficient in higher dimensions, NCDA improves performance.
problem Inefficiency of NCC in higher dimensions.
method Combining NCC with LDA to create NCDA.
result NCDA outperforms NCC and competes with LDA and QDA.
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.
Improved scalability of BOSS ensemble for time series classification.
problem Non-trivial scalability issues in BOSS and WEASEL.
method Random selection of classifiers, ensembling techniques, and build time reduction.
result Significant reduction in build time with minimal accuracy loss.
HET-XL improves heteroscedastic classifiers for large-scale image classification.
problem Scaling heteroscedastic classifiers to handle large numbers of classes and tuning the temperature hyperparameter.
method HET-XL, a heteroscedastic classifier with independent parameter count from the number of classes, learns the temperature hyperparameter directly from training data.
result HET-XL requires 14X fewer additional parameters and performs better than baseline heteroscedastic classifiers on large image classification datasets.
New method uses off-the-shelf classifiers to improve diffusion generation without extra training.
problem Improving sample quality and controllability in conditional diffusion generation.
method Leveraging off-the-shelf classifiers in a training-free fashion with calibration and pre-conditioning techniques.
result Significant performance improvements (up to 20%) over existing guidance schemes.
Paper proposes CCVR to improve classifier calibration in federated learning with non-IID data.
problem Improving classifier calibration in federated learning with non-IID data.
method Proposes CCVR, a simple algorithm that adjusts the classifier using virtual representations.
result CCVR achieves state-of-the-art performance on popular federated learning benchmarks.
Subset selection improves weak supervision performance.
problem Optimizing the use of weakly-labeled data.
method Combining pretrained data representations with the cut statistic for subset selection.
result Subset selection improves weak supervision performance by up to 19%.
Paper uses AC-GAN to generate high-quality relational sentences for relation extraction.
problem Limited training data for relation extraction models.
method Auxiliary Classifier Generative Adversarial Networks (AC-GANs).
result Significantly improved performance of relation extraction.
In practice, the data distribution at test time often differs, to a smaller or larger extent, from that of the original training data. Consequentially, the so-called source classifier, trained on the available labelled data, deteriorates on the test, or target, data. Domain adaptive classifiers aim to combat this probl…
The standard approach to supervised classification involves the minimization of a log-loss as an upper bound to the classification error. While this is a tight bound early on in the optimization, it overemphasizes the influence of incorrectly classified examples far from the decision boundary. Updating the upper bound …
LAGCN improves GCN performance by identifying and using valuable neighbors.
problem Existing GCN models do not identify valuable neighbors, potentially harming performance.
method LAGCN introduces a label-aware edge classifier to refine the graph and enhance learning performance.
result LAGCN significantly improves node classification performance on benchmark datasets.
Enhances projection pursuit tree classifier with visual diagnostics for better multi-class classification.
problem Rigidity of original algorithm limits performance in complex high-dimensional classification problems.
method Allowing more splits and flexible class groupings in projection pursuit computation, and developing visual diagnostics.
result Demonstrates enhanced classifier performs as intended through interactive visual diagnostics.
Paper investigates methods to improve classification by inducing a hierarchy from flat labels.
problem Improving classification performance on datasets lacking a natural hierarchy.
method The approach involves clustering conditional distributions and using a hierarchical classifier with the induced hierarchy.
result The methods can discover latent hierarchies and improve accuracy in various applications.
Generative classifier derived from any discriminative classifier rejects illegal inputs.
problem Detecting and rejecting illegal inputs like adversarial examples and out-of-distribution samples.
method SDIM-logit: learns generative classifier from logits of any discriminative classifier, imposing statistical constraints.
result SDIM-logit inherits performance of base classifier without loss and can reject illegal inputs.
Learning from an imbalanced dataset is a tricky proposition. Because these datasets are biased towards one class, most existing classifiers tend not to perform well on minority class examples. Conventional classifiers usually aim to optimize the overall accuracy without considering the relative distribution of each cla…
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.
The study provides a sample complexity estimate for multi-category classifiers with bounded variation.
problem Controlling the deviation between empirical and generalization performances of multi-category classifiers.
method Using the empirical L1-norm covering number and fat-shattering dimension, the study derives a sample size estimate for classifiers of bounded variation.
result The sample size estimate is sufficient for the performances to be close with high probability, improving the dependency on the number of classes.
Toward a better trade-off between performance and fairness with kernel-based distribution matchingcs.LG
Paper introduces MinDiff framework for balancing classifier performance and fairness.
problem Balancing classifier performance and fairness in machine learning models.
method MinDiff framework with kernel-based statistical dependency tests.
result Demonstrates real-world improvements in classifier performance and fairness.
PLIs improve classifier performance by fine-tuning latent representations.
problem Difficult interpretation of high-dimensional latent representations in neural networks.
method Back-propagation of manual changes to low-dimensional embeddings using t-distributed stochastic neighbourhood embeddings.
result Manual separation of class clusters in latent space enhances classifier performance.
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.