Accurate image classification given small amounts of labelled data (few-shot classification) remains an open problem in computer vision. In this work we examine how the known texture bias of Convolutional Neural Networks (CNNs) affects few-shot classification performance. Although texture bias can help in standard imag…
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,695 papers · 148 categories
Trend · papers per month
48 results for “Classification Performance”
Unified framework for comparing classification metrics across different imbalance rates.
problem Differences in scale and sensitivity to class imbalance rates in classification metrics.
method Introduces outperformance standardization (OPS) function to map metrics to a common scale.
result Unified o-value metric provides clear comparison across different imbalance rates.
We study the classification performance of Kronecker-structured models in two asymptotic regimes and developed an algorithm for separable, fast and compact K-S dictionary learning for better classification and representation of multidimensional signals by exploiting the structure in the signal. First, we study the clas…
The objective of this research is to enhance performance of Stochastic Gradient Descent (SGD) algorithm in text classification. In our research, we proposed using SGD learning with Grid-Search approach to fine-tuning hyper-parameters in order to enhance the performance of SGD classification. We explored different setti…
C-HMCNN(h) improves HMC classification by leveraging class hierarchy.
problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.
Revisit Time Series Classification Benchmark: The Impact of Temporal Information for Classificationcs.LG
Temporal information impacts only a fraction of time series datasets, skewing benchmark evaluations.
problem Temporal information's impact on time series classification is often overestimated.
method Permutation tests on UCR archive to identify datasets where temporal info is irrelevant.
result Many tabular datasets perform well without temporal info, skewing benchmark evaluations.
Study identifies pitfalls in assessing hierarchies for multi-class classification.
problem Lack of understanding in selecting hierarchies for multi-class classification.
method Analyzed and compared popular approaches to extracting hierarchies.
result Hierarchy quality becomes irrelevant when using powerful classifiers.
A deep learning approach classifies medical images hierarchically.
problem Limitations of traditional supervised classifiers in medical image classification.
method Hierarchical Medical Image Classification (HMIC) using deep learning models.
result HMIC achieved better performance in classifying medical images hierarchically.
New metrics improve performance in imbalanced classification problems.
problem Established metrics favor classifiers ignoring minority classes.
method Introduce robust modifications of F-score and MCC.
result TPR is bounded away from 0 in imbalanced settings.
A method selects key genes from tumor transcriptomics data using kernel methods and improves classification performance.
problem Feature selection for tumor classification using gene expression data.
method Multiple Kernel Learning with latent regularization and non-linear dimensionality reduction.
result Improved tumor classification performance on unseen test samples.
Corrected graph convolutions improve node classification on graphs.
problem Oversmoothing in graph convolutions degrades performance.
method Theoretical analysis based on CSBM, spectral analysis for k rounds of corrected graph convolutions.
result Corrected graph convolutions can improve node classification performance exponentially.
Conventional techniques for supervised classification constrain the classification rules considered and use surrogate losses for classification 0-1 loss. Favored families of classification rules are those that enjoy parametric representations suitable for surrogate loss minimization, and low complexity properties suita…
New framework models algorithmic decisions affecting data distribution, enabling efficient learning.
problem Algorithmic decisions can alter data distribution, affecting model performance.
method Model performative effects as push-forward measures, estimating gradients under shift operators.
result Prove convexity of performative risk, allowing more accurate models to be harder to classify.
MODWST improves classification tasks with wavelet scattering.
problem Signal classification challenges.
method Combines MODWT and WST for feature extraction.
result MODWST outperforms CNNs in limited data scenarios.
This study integrates cost-sensitive and causal classification methods.
problem Improving classification model performance in business decision-making.
method A unifying evaluation framework for cost-sensitive and causal classification.
result Conventional classification is a specific case of causal classification.
DeepJet improves jet flavor classification and quark-gluon tagging.
problem Jet flavor classification in high-energy physics experiments.
method Proposes a novel deep learning architecture, DeepJet, for improved performance.
result Improves heavy flavor classification performance and extends to quark-gluon tagging.
Limits to classification performance by relating Kullback-Leibler divergence to Cohen's Kappastat.ML
Machine learning classification limits estimated using Kullback-Leibler divergence and Cohen's Kappa.
problem Estimating the best possible performance of machine learning classification algorithms.
method Relating Kullback-Leibler divergence to Cohen's Kappa and using the Chernoff-Stein Lemma to estimate error rates.
result Classification algorithms could not have performed any better due to underlying probability density functions for the two classes.
MRCs minimize worst-case expected 0-1 loss and provide performance guarantees.
problem Minimizing expected 0-1 loss in classification.
method Minimizes worst-case expected 0-1 loss over uncertainty sets defined by linear constraints.
result Achieves efficient learning and generalization with performance guarantees.
Study improves pollen detection in optical and holographic images using deep learning.
problem Improving pollen detection accuracy in holographic microscopy images.
method Used YOLOv8s for detection and MobileNetV3L for classification, addressing performance gaps through dataset expansion and automated labeling.
result Significant improvement in detection and classification performance on holographic images.
We provide a general theoretical analysis of expected out-of-sample utility, also referred to as decision-theoretic classification, for non-decomposable binary classification metrics such as F-measure and Jaccard coefficient. Our key result is that the expected out-of-sample utility for many performance metrics is prov…
Beam search improves feature selection for better model performance.
problem Improving feature selection for better model performance.
method Proposed beam search as a generalization of forward selection for feature selection.
result Beam search can outperform forward selection, especially with correlated features.
Butterfly Effect: Bidirectional Control of Classification Performance by Small Additive Perturbationcs.LG
This paper proposes a new algorithm for controlling classification results by generating a small additive perturbation without changing the classifier network. Our work is inspired by existing works generating adversarial perturbation that worsens classification performance. In contrast to the existing methods, our wor…
Paper shows similarity learning can lead to strong binary classification performance.
problem How similarity learning can lead to good classification performance.
method Product-type formulation of similarity learning is connected to binary classification through an excess risk bound.
result Similarity learning can directly elicit a decision boundary for binary classification.
This paper reviews metrics for evaluating multi-class classification models.
problem Evaluating and comparing multi-class classification models.
method Review and analysis of metrics.
result Promising multi-class metrics are highlighted and their usages are demonstrated.
Classification of audio samples is an important part of many auditory systems. Deep learning models based on the Convolutional and the Recurrent layers are state-of-the-art in many such tasks. In this paper, we approach audio classification tasks using capsule networks trained by recently proposed dynamic routing-by-ag…
AF improves classification models by adaptively weighting trees.
problem Improving classification model performance.
method AF combines OP2T for input-dependent weights and MIO for dynamic refinement.
result AF consistently outperforms RF, XGBoost, and other weighted RF.
The study analyzes performance indices for class-imbalanced data and identifies conditions they must meet.
problem Distortions in performance indices under class imbalance.
method Identified two conditions for performance indices and analyzed four binary and five multi-class indices.
result Recommended appropriate indices for evaluating classifiers in class-imbalanced scenarios.
Paper analyzes cyber risk classifications for forecasting performance.
problem Lack of effective out-of-sample forecasting performance in current cyber risk classifications.
method Rolling window analysis using threshold weighted scoring functions.
result Dynamic and impact-based cyber risk classifiers outperform others in forecasting future cyber risk losses.
Unequal Covariance Awareness for Fisher Discriminant Analysis and Its Variants in Classificationcs.LG
A new classification rule for FDA improves classification performance by accounting for unequal covariance matrices.
problem Unequal covariance matrices in practical situations affect the performance of FDA and its variants.
method Proposes a novel classification rule for FDA that accounts for unequal covariance matrices, applicable to many FDA variants.
result The new classification rule improves classification performance compared to original FDA and variants.
Survey of resampling techniques for improving classification performance in unbalanced datasetsstat.AP
A number of classification problems need to deal with data imbalance between classes. Often it is desired to have a high recall on the minority class while maintaining a high precision on the majority class. In this paper, we review a number of resampling techniques proposed in literature to handle unbalanced datasets …
Directly compute classification by learning features with class scores.
problem Classification efficiency and accuracy on various datasets.
method PCA for feature encoding, supervised learning model with encoder-decoder structure.
result Effective classification performance on multiple datasets.
Paper proposes GSSNMF for legal document classification and topic modeling.
problem Lack of methods that can both classify and model topics with guidance.
method Guided Semi-Supervised Non-negative Matrix Factorization (GSSNMF).
result Improves both classification accuracy and topic coherence.
Study improves radio show segmentation using audio embeddings.
problem Automated segmentation of radio shows.
method Created audio embeddings from multi-class classification tasks on different datasets, evaluated performance against text-only baseline.
result Audio embeddings from non-speech sound event classification significantly outperformed text-only baseline by 32.3% in F1-measure.
Representation learning, especially which by using deep learning, has been widely applied in classification. However, how to use limited size of labeled data to achieve good classification performance with deep neural network, and how can the learned features further improve classification remain indefinite. In this pa…
An Algorithm to perform Covariance-Adjusted Support Vector Classification in Non-Euclidean Spacescs.LG
Algorithm improves SVM classification in non-Euclidean spaces.
problem Limitations of traditional SVM in non-Euclidean spaces.
method Covariance-adjusted SVM using Cholesky Decomposition.
result Cholesky-SVM outperforms traditional SVM in non-Euclidean spaces.
This work improves metric learning models by incorporating class hierarchies.
problem Class hierarchies are often ignored in classification-based metric learning models.
method Trained softmax classifier and metric learning models with predefined class hierarchies.
result ProxyDR model performs better in hierarchical inference and hierarchy-informed performance.
Develops a new minimax probability machine for imbalanced classification tasks.
problem Imbalanced classification tasks with non-decomposable performance measures.
method Derives an equivalent form of the MPMF model for solving linear and nonlinear classifiers.
result Demonstrates the effectiveness of the new model on real-world datasets.
In this paper, we present a novel sequential paradigm for classification in crowdsourcing systems. Considering that workers are unreliable and they perform the tests with errors, we study the construction of decision trees so as to minimize the probability of mis-classification. By exploiting the connection between pro…
Comment classification on cookery channels using BERT and traditional models.
problem Volume of multilingual comments, variable lengths, slang, symbols, and abbreviations make comment classification challenging.
method Evaluated traditional machine learning models (Naive Bayes, KNN, SVM, Random Forest, Decision Trees) and BERT-based models (BERT, DISTILBERT, XLM) for multilingual comment classification.
result XLM was the top-performing BERT model with an accuracy of 67.31, while Random Forest with Term Frequency Vectorizer was the best traditional model with 63.59 accuracy.
This paper improves binary classification methods beyond accuracy, especially in imbalanced datasets.
problem Binary classification performance metrics often fail to reflect real-world consequences, especially in imbalanced datasets.
method Derives a generalized Bayes-optimal classifier from accuracy to any performance metric, removing assumptions and providing finite-sample statistical guarantees.
result Optimal classification performance depends on class imbalance properties, providing new insights and guarantees.
DAEDL improves EDL's OOD detection and classification performance by integrating feature space density.
problem Limited OOD detection and classification performance of EDL.
method Integrates feature space density with EDL's output and uses a novel parameterization.
result Demonstrates state-of-the-art performance across uncertainty estimation and classification tasks.
GeoStat simplifies time series classification with fast, intuitive features.
problem Efficiently classify time series data without high computational costs.
method GeoStat representations based on differential geometric statistics.
result Simple KNN and SVM classifiers achieve state-of-the-art performance.
Data in real-world application often exhibit skewed class distribution which poses an intense challenge for machine learning. Conventional classification algorithms are not effective in the case of imbalanced data distribution, and may fail when the data distribution is highly imbalanced. To address this issue, we prop…
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.
Proposes a method to evaluate meta-learning performance based on task similarity.
problem Meta-learning performance evaluation ignores task similarity, leading to biased results.
method Generative approach using Latent Dirichlet Allocation to analyze task similarity.
result The proposed method provides an insightful evaluation of meta-learning algorithms, matching common intuition.
Quantum annealer speeds up RBM training for image classification.
problem Training RBM with contrastive divergence (CD) is slow and computationally expensive.
method Used D-Wave 2000Q quantum annealer to calculate model expectation of gradient learning for RBM.
result Quantum training yields similar classification performance to CD but faster.
Improved GP models for fast training and good performance.
problem Training scalable Gaussian process models efficiently.
method Cross-validation and nearest neighbor truncation for scalable GP training.
result Our method offers fast training and excellent predictive performance.
Kernel based methods have shown effective performance in many remote sensing classification tasks. However their performance significantly depend on its hyper-parameters. The conventional technique to estimate the parameter comes with high computational complexity. Thus, the objective of this letter is to propose an fa…