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

Trend · papers per month

4692137183 · Jun 202019922001200920172026
48 results for misclassification detection

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.

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.

The paper improves uncertainty quantification for node classification using distance-based regularization.

problem Uncertainty in deep learning models, especially for node classification tasks.
method Graph posterior networks (GPNs) with UCE loss function, followed by a distance-based regularization.
result The proposed distance-based regularization outperforms state-of-the-art methods in OOD detection and misclassification detection.

Deep learning methods have shown state of the art performance in a range of tasks from computer vision to natural language processing. However, it is well known that such systems are vulnerable to attackers who craft inputs in order to cause misclassification. The level of perturbation an attacker needs to introduce in…

2019-10-09abs ↗pdf ↗

Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCB…

2016-07-24abs ↗pdf ↗

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.

Develops methods to improve reliability of deep learning for autonomous driving.

problem Safety concerns in deploying autonomous driving systems.
method Introduces a new criterion (true class probability) for estimating model confidence and learns it from data.
result Proposed method provides better failure prediction than current uncertainty measures.

Machine learning (ML) classifiers are vulnerable to adversarial examples. An adversarial example is an input sample which is slightly modified to induce misclassification in an ML classifier. In this work, we investigate white-box and grey-box evasion attacks to an ML-based malware detector and conduct performance eval…

2019-04-07abs ↗pdf ↗

New algorithm detects communities near KS threshold with optimal rate, even in noisy conditions.

problem Community detection in symmetric stochastic block models with noisy data.
method Polynomial-time algorithm using Sum-of-Squares framework and robust majority voting.
result Achieves minimax-optimal misclassification rate near Kesten-Stigum threshold, even with node corruption.

Nearest-neighbor (NN) procedures are well studied and widely used in both supervised and unsupervised learning problems. In this paper we are concerned with investigating the performance of NN-based methods for anomaly detection. We first show through extensive simulations that NN methods compare favorably to some of t…

2019-07-08abs ↗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.

We consider the multi-class classification problem when the training data and the out-of-sample test data may have different distributions and propose a method called BCOPS (balanced and conformal optimized prediction sets). BCOPS constructs a prediction set C(x)C(x) as a subset of class labels, possibly empty. It tries …

2019-05-10abs ↗pdf ↗

Unlike traditional programs (such as operating systems or word processors) which have large amounts of code, machine learning tasks use programs with relatively small amounts of code (written in machine learning libraries), but voluminous amounts of data. Just like developers of traditional programs debug errors in the…

2016-03-23abs ↗pdf ↗

Study detects boundaries in unlabeled noisy images without labels.

problem Detecting boundaries in unlabeled noisy images without labels.
method Proposed a continuous hinge-type surrogate loss for boundary detection, combined with deep neural networks.
result Deep neural network achieves minimax-optimal boundary recovery rate under piecewise smooth boundary model.

The convolutional neural network (CNN) architecture is increasingly being applied to new domains, such as malware detection, where it is able to learn malicious behavior from raw bytes extracted from executables. These architectures reach impressive performance with no feature engineering effort involved, but their rob…

2018-10-18abs ↗pdf ↗

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.

We propose an approach to distinguish between correct and incorrect image classifications. Our approach can detect misclassifications which either occur unintentionally\it{unintentionally} ("natural errors"), or due to intentional adversarial attacks\it{intentional~adversarial~attacks} ("adversarial errors"), both in a single unified framework\it{unified~framework}. Our appr…

2019-02-01abs ↗pdf ↗

We present a novel framework for augmenting data sets for machine learning based on counterexamples. Counterexamples are misclassified examples that have important properties for retraining and improving the model. Key components of our framework include a counterexample generator, which produces data items that are mi…

2018-05-17abs ↗pdf ↗

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.

Machine learning models have demonstrated vulnerability to adversarial attacks, more specifically misclassification of adversarial examples. In this paper, we propose a one-off and attack-agnostic Feature Manipulation (FM)-Defense to detect and purify adversarial examples in an interpretable and efficient manner. The i…

2020-02-03abs ↗pdf ↗

This paper studies adversarial examples in NIDS, revealing their vulnerability.

problem Vulnerability of machine learning-based NIDS to adversarial examples.
method Used evolutionary computation and deep learning to generate adversarial examples.
result Adversarial examples cause high misclassification rates in various machine learning models.

Imbalanced data classification problem has always been a popular topic in the field of machine learning research. In order to balance the samples between majority and minority class. Oversampling algorithm is used to synthesize new minority class samples, but it could bring in noise. Pointing to the noise problems, thi…

2019-08-30abs ↗pdf ↗

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.

Paper defends LSTM-based text classification models from backdoor attacks.

problem Backdoor attacks in LSTM models cause misclassification of spam or malicious speech.
method Backdoor Keyword Identification (BKI) to identify and exclude poisoned samples.
result BKI method effectively mitigates backdoor attacks in various text classification datasets.

Paper proposes a black-box technique to generate adversarial samples.

problem Robustness of Deep Neural Networks (DNNs) to adversarial samples.
method Black-box Momentum Iterative Fast Gradient Sign Method (BMI-FGSM) using Differential Evolution to approximate gradients.
result Achieves high success rates in generating adversarial samples and misclassification.

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.