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.

169,181 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920182026
48 results for Misclassification ratios

ClassSim measures similarity between classes using misclassification ratios of trained classifiers.

problem Evaluating similarities between similar classes in real-world datasets.
method ClassSim metric based on misclassification ratios of trained DNNs.
result ClassSim provides better similarities than existing methods for image recognition.

Develops NPMC method for noisy labels, improving multiclass classification accuracy.

problem Asymmetric misclassification costs and label noise in multiclass classification.
method Empirical likelihood approach using exponential tilting density ratio model.
result Root n consistent and asymptotically normal estimators for clean labels and noise mechanism.

Study identifies and mitigates causes of image misclassifications in CNN models.

problem Improving model interpretability and accuracy in image classification.
method Trained six CNN architectures on CIFAR-10, used conditional confusion matrices and misclassification networks to identify morphological similarity and non-essential information interference as causes of misclassification. Developed a method to reduce misclassifications by erasing pixels within top 5% saliency map bounding boxes.
result Identified two causes of misclassification: morphological similarity and non-essential information interference, and developed a method to reduce misclassifications caused by the latter.

Proposes a novel SVM model for binary classification with different misclassification costs.

problem Real-world classification problems with varying misclassification costs.
method Incorporates performance constraints in SVM formulation to seek a hyperplane with maximal margin and misclassification rates below given thresholds.
result The proposed model gives users control over misclassification rates in one class at the expense of the other.

New model predicts links in community-based networks robustly.

problem Link prediction in community-based networks with local clustering errors.
method Markov Stochastic Block Model (MSBM) with Hidden Markov Model (HMM) predictions.
result Misclassification error decays exponentially with relevant signal-to-noise ratio (SNR).

Paper introduces a new uncertainty measure for misclassification detection.

problem Effective detection of unreliable model predictions in machine learning.
method Data-driven measure of uncertainty relative to an observer based on soft-predictions.
result Demonstrates improved misclassification detection over state-of-the-art methods.

A new activation function improves credit scoring accuracy for imbalanced datasets.

problem Imbalanced datasets in credit scoring lead to underestimation of misclassification costs.
method Introduces ASIG, an asymmetric adjusted Sigmoid function.
result ASIG-embedded classifier outperforms traditional classifiers across various imbalance ratios.

Detects misclassifications and adversarial examples using neural network logits.

problem Unable to detect misclassifications and adversarial examples in neural networks.
method Introspection using pretrained neural network logits.
result Simple 3-layer neural network trained on logits detects misclassifications competitively.

Decision tree is an important method for both induction research and data mining, which is mainly used for model classification and prediction. ID3 algorithm is the most widely used algorithm in the decision tree so far. In this paper, the shortcoming of ID3's inclining to choose attributes with many values is discusse…

2016-12-01abs ↗pdf ↗

A new framework selects information sources to test hypotheses robustly, even with misclassifications.

problem Robust hypothesis testing with misclassification penalties.
method Introduces a misclassification penalty framework and an efficient greedy algorithm.
result Proposes a submodular surrogate metric for better selection.

Efficient algorithm for CLSBM reduces misclassification rate.

problem Reducing misclassification in community detection for CLSBM.
method Spectral-based algorithm for CLSBM, with theoretical misclassification bounds.
result Upper bound on misclassification rate of efficient algorithm.

Method finds optimal binary classification rules under weighted misclassification loss.

problem Optimal binary classification rules for resource-limited settings with cost-sensitive decisions.
method Ensemble learning to derive prediction scores and associated thresholds minimizing weighted misclassification loss.
result Jointly derived score and threshold outperforms methods that derive score first and threshold second.

The paper develops a classification method using penalties on feature selection for high-dimensional data.

problem High-dimensional binary classification with many irrelevant features.
method Empirical risk minimization with l0-penalization for feature selection.
result The method achieves a sparse solution close to true sparsity with high probability and converges to low misclassification risk.

New algorithm reduces misclassification costs in neural networks.

problem Reduces costs of misclassified instances in neural networks.
method Adaptive Cost-Sensitive Learning (AdaCSL) adjusts loss function to bridge class distribution mismatches.
result Deep neural networks with AdaCSL outperform other methods on cost-sensitive binary classification tasks.

Paper analyzes adversarial training's performance in binary classification.

problem Understanding the generalization performance of adversarial training.
method Derives precise theoretical predictions for adversarial training performance.
result Provides exact asymptotics for test errors of adversarial training.

Convolutional neural networks improve image classification accuracy.

problem Improving accuracy in image classification.
method Analyzing the convergence rate of misclassification risk for image classifiers.
result A rate of convergence independent of image dimension proves the effectiveness of CNNs.

Proposes a method to correct exposure misclassification bias in Cox models.

problem Challenges in estimating exposure-outcome associations with misclassified exposure data.
method An estimating equation method to correct for exposure misclassification-caused bias.
result Proposed method corrects bias in estimating PM2.5 level's association with lung cancer mortality.

Optimal subset selection for hypothesis testing with penalties.

problem Optimal subset selection of information sources for hypothesis testing with misclassification penalties.
method Proposes a misclassification penalty framework and studies two variants of subset selection problems under centralized Bayesian learning.
result Proves the submodularity of the objective and constraints of the subset selection problems and establishes performance guarantees for greedy algorithms.

This paper compares two clustering evaluation metrics, revealing their differences and properties.

problem Understanding the differences between misclassification error distance and adjusted Rand index.
method Population origins, data analysis examples, detailed case studies, and simulation study.
result Reveals previous misconceptions about the two metrics and their distributions.

The paper develops a method to accurately estimate the Bayes misclassification error rate.

problem Estimating the best achievable classifier performance without learning a Bayes-optimal classifier.
method Learning to benchmark using an ensemble of ε-ball estimators and Chebyshev approximation.
result The proposed method achieves an optimal mean squared error rate of O(N^(-1)) under a smoothness assumption.

New research shows logistic regression can achieve optimal error rate for agnostic learning of halfspaces.

problem Agnostic learning of homogeneous halfspaces with logistic loss.
method Constructing a well-behaved distribution and using logistic regression with additional convex optimization steps.
result Logistic regression can achieve Ω(extrmOPT)Ω(\sqrt{ extrm{OPT}}) misclassification risk, matching the upper bound.

Despite the wide use of machine learning in adversarial settings including computer security, recent studies have demonstrated vulnerabilities to evasion attacks---carefully crafted adversarial samples that closely resemble legitimate instances, but cause misclassification. In this paper, we examine the adequacy of the…

2017-04-06abs ↗pdf ↗

Develops GLRT for defending against adversarial attacks in hypothesis testing.

problem Adversarial attacks on machine learning models causing misclassification.
method Generalized likelihood ratio test applied to composite hypothesis testing problem.
result GLRT approach yields competitive robustness-accuracy tradeoff under various attacks.

Improved community detection in heterogeneous SBM with side information.

problem Misclassification in community detection with noisy labels.
method Optimal weighted message passing and minimum energy flow.
result Optimal weighting improves misclassification rate in heterogeneous SBM.

This work aims to reduce inexplicable errors in deep neural networks by obtaining class-level semantics and penalizing misclassifications.

problem Deep neural networks misclassify images, leading to inexplicable errors that can harm trust and societal impact.
method Obtain class-level semantics, propose Weighted Loss Functions (WLFs), and train classifiers with these methods.
result Trained networks have more explicable failure modes and comparable accuracy to existing methods.

Paper shows adversarial attacks are possible in real-time video classification systems.

problem Adversarial perturbations in real-time video classification systems.
method Exploits GAN architectures to generate stealthy adversarial samples.
result Generative adversarial networks can cause misclassification rates of over 80% in real-time video classification.

SDN mitigates overthinking in deep networks, reducing inference cost and preserving accuracy.

problem Overthinking in deep neural networks, leading to unnecessary computations and misclassifications.
method Introducing internal classifiers (Shallow-Deep Network) to SDNs, enabling early confidence-based exits.
result SDNs reduce inference cost by more than 50% and preserve accuracy, mitigating overthinking.

This research improves PAC-Bayesian bounds for classification tasks using convexified loss.

problem Deriving generalization bounds for classification tasks with non-convex loss functions.
method Shift focus to misclassification excess risk bounds for PAC-Bayesian classification using convex surrogate loss and leveraging PAC-Bayesian relative bounds in expectation.
result Improved PAC-Bayesian bounds for classification tasks with convex surrogate loss.

New attacks exploit transfer learning to misclassify text models.

problem Misclassification attacks against transfer learned text classifiers.
method Novel attack algorithms using unintended features from teacher models.
result Transfer learning increases vulnerability to misclassification attacks.

Study shows financial models are vulnerable to small data changes, but robust algorithms can protect them.

problem Financial models are vulnerable to small data changes, leading to misclassification.
method Used adversarial attacks and an original attack to explore model sensitivity, and developed a robust optimization algorithm.
result Robust optimization algorithm can build models resistant to misclassification on perturbations.

Convolutional neural networks converge quickly with gradient descent.

problem Learning efficient image classifiers with over-parameterized networks.
method Gradient descent for training over-parametrized CNNs with global average-pooling.
result Gradient descent quickly reduces the misclassification risk of CNNs.

A new method for high-dimensional data classification reduces misclassification errors.

problem High-dimensional data classification with limited samples.
method Compressive Regularized Discriminant Analysis (CRDA) using joint-sparsity promoting hard thresholding and regularized covariance matrix estimators.
result CRDA gives fewer misclassification errors than competitors and accurately selects features.

Paper defends machine learning models from adversarial attacks using GLRT.

problem Adversarial attacks on machine learning models leading to misclassification.
method Generalized likelihood ratio test (GLRT) for robust classification.
result GLRT yields performance competitive with minimax approach under worst-case attacks, and better trade-off under weaker attacks.

SEDA improves RLDA for high-dimensional data.

problem Inconsistent performance of RLDA in high-dimensional scenarios.
method Developed a non-asymptotic approximation of misclassification rate, derived new theoretical results on eigenvectors, and proposed SEDA algorithm.
result SEDA achieves higher classification accuracy and dimensionality reduction compared to existing LDA methods.

Proposes ECS-DBN for cost-sensitive deep belief network in imbalanced classification.

problem Imbalanced data classification with unequal misclassification costs.
method ECS-DBN uses adaptive differential evolution to optimize misclassification costs based on training data.
result ECS-DBN consistently outperforms state-of-the-art methods on benchmark and real-world datasets.