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

Trend · papers per month

2675358021,069 · Jun 202019922001200920172026
48 results for network classifiers

The paper introduces new Bayesian network classifiers for better classification accuracy.

problem Improving supervised classification accuracy using Bayesian network classifiers.
method Developed novel classes of generative classifiers based on staged tree models, extending Bayesian networks.
result Data-driven learning routines enhance the accuracy of the new classifiers.

Two strategies for training network classifiers with feature heterogeneity.

problem Training network classifiers with agents having varying feature sizes and unreliable local decisions.
method Promotes global and local smoothing of classifier outputs.
result Output smoothing makes network classifier dynamics more complex, requiring regularization of parameters.

New neural network improves audio classification accuracy.

problem Challenging audio classification problem in pattern recognition.
method Introduces a Classifier-Attention-Based Convolutional Neural Network (CAB-CNN) with an attention mechanism to reduce classifier complexity.
result Significantly improves audio classification performance, achieving more than 10% improvements.

Bayesian network classifiers are used in many fields, and one common class of classifiers are naive Bayes classifiers. In this paper, we introduce an approach for reasoning about Bayesian network classifiers in which we explicitly convert them into Ordered Decision Diagrams (ODDs), which are then used to reason about t…

2012-10-19abs ↗pdf ↗

In this paper, we empirically evaluate algorithms for learning four types of Bayesian network (BN) classifiers - Naive-Bayes, tree augmented Naive-Bayes, BN augmented Naive-Bayes and general BNs, where the latter two are learned using two variants of a conditional-independence (CI) based BN-learning algorithm. Experime…

2013-01-23abs ↗pdf ↗

This paper analyzes neural network classifiers' performance in binary classification.

problem Performance of neural network classifiers in binary classification problems.
method Plug-in classifiers based on neural networks, considering a more general function class and surrogate loss.
result Dimension-free, uniform rate of convergence for the excess risk of neural networks, showing minimax optimality.

New insights into how linear classifiers and leaky ReLU networks can overfit without harming generalization.

problem Understanding conditions for benign overfitting in linear classifiers and leaky ReLU networks.
method Utilizing Karush--Kuhn--Tucker (KKT) conditions for margin maximization.
result Satisfaction of KKT conditions leads to benign overfitting in linear classifiers and leaky ReLU networks.

Study adversarial attacks on cost-sensitive classifiers.

problem Safety-critical classification problems with cost-sensitive predictions.
method Used state-of-the-art adversarially-resistant neural networks and analyzed as a two-player zero-sum game.
result Introduced a new cost-sensitive attack that performs better than targeted attacks in some cases.

New method reconstructs significant parts of training data from neural networks.

problem Understanding and reconstructing training data from neural networks.
method Proposes a novel reconstruction scheme based on recent theoretical results about neural network training.
result Shows that a significant fraction of training data can be reconstructed from neural network parameters.

Traditional classifiers can generate high-quality images comparable to generative models.

problem Separation between classifiers and generators in neural networks.
method Optimizing input gradients to produce images, using mask-based stochastic reconstruction, progressive-resolution technique, and distance metric loss.
result Traditional classifiers can generate high-fidelity images of 256imes imes256 resolution on ImageNet.

Optimal classifiers derived from GMMs are approximated by deep neural networks.

problem Binary classification of high-dimensional overlapping Gaussian mixtures.
method Closed-form expressions for Bayes optimal decision boundaries derived from GMMs' eigenstructure. Empirical validation through synthetic and real-world data.
result Deep neural networks approximate optimal classifiers for GMMs, with decision thresholds related to covariance eigenvectors.

New approach detects out-of-distribution inputs without needing OOD samples.

problem Detecting incorrect classification of out-of-distribution inputs in deep neural networks.
method A one-class classifier trained on an early layer's output of the original classifier.
result Substantially better results compared to state-of-the-art approaches.

Ideally, what confuses neural network should be confusing to humans. However, recent experiments have shown that small, imperceptible perturbations can change the network prediction. To address this gap in perception, we propose a novel approach for learning robust classifier. Our main idea is: adversarial examples for…

2018-10-30abs ↗pdf ↗

DSI measures dataset separability for neural networks.

problem Difficulty in separating different classes of data in neural networks.
method Created the Distance-based Separability Index (DSI) to quantify dataset separability.
result DSI effectively measures dataset separability and indicates similar distributions of different classes.

GIM uses neural networks with Gaussian distributions to detect out-of-distribution data.

problem Incorrect classification of out-of-distribution data by neural networks.
method GIM is a hybrid classifier based on neural networks with a new loss function that imposes Gaussian distributions on each class.
result GIM achieves state-of-the-art results on image recognition and sentiment analysis datasets.

Contextual PDA improves explanation of image classifications for saturated models.

problem Difficulty in explaining decisions of saturated classifiers.
method Proposes Contextual PDA, a faster method for explaining image classifications.
result Contextual PDA outperforms PDA in explaining image classifications of state-of-the-art deep networks.

Adversarial domain adaptation reduces sample bias in high energy physics classifier.

problem Sample bias in high energy physics classifier training.
method Adversarial domain adaptation using neural networks with gradient reversal layer.
result Successful bias removal on simulated events at the LHC.

Convolutional neural networks handle rotated image symmetries without dimensionality issues.

problem Binary image classification with rotational symmetry.
method Least squares plug-in classifiers based on convolutional neural networks under rotationally symmetric assumptions.
result Convolutional neural networks can circumvent the curse of dimensionality in binary image classification with rotational symmetry.

The paper extends calibration to sets of probabilistic classifiers, finding many ensembles are poorly calibrated.

problem Evaluating the validity of epistemic uncertainty in sets of probabilistic classifiers.
method Proposed a novel nonparametric calibration test for sets of probabilistic classifiers.
result Ensembles of deep neural networks are often not well calibrated.

A new method for measuring prediction uncertainty in classifiers.

problem Measuring uncertainty of predictions from machine learning methods.
method Density Based Calibration (DBCal) technique.
result Expected calibration error of less than 0.2% on binary classifiers and less than 3% on semantic segmentation networks.

The reliable measurement of confidence in classifiers' predictions is very important for many applications and is, therefore, an important part of classifier design. Yet, although deep learning has received tremendous attention in recent years, not much progress has been made in quantifying the prediction confidence of…

2017-09-28abs ↗pdf ↗

This paper considers the problem of removing costly features from a Bayesian network classifier. We want the classifier to be robust to these changes, and maintain its classification behavior. To this end, we propose a closeness metric between Bayesian classifiers, called the expected classification agreement (ECA). Ou…

2018-05-29abs ↗pdf ↗

CCAC calibrates DNN classifiers on OOD datasets by separating mis-classified samples.

problem Calibrating DNN classifiers on out-of-distribution datasets is challenging.
method CCAC introduces an auxiliary class to map DNN output to calibrated confidence, separating mis-classified from correctly classified samples.
result CCAC consistently outperforms prior methods on various DNN models, datasets, and applications.

New method generates realistic adversarial images with smaller perturbations.

problem Generating realistic adversarial images with small perturbations.
method Imposes spatial distortions (scaling, rotation, shear, translation) in addition to perturbations.
result Produces visually more realistic attacks that deceive classifiers without affecting human predictions.

Neural networks exhibit simplex symmetry in their final and penultimate layers.

problem Understanding the symmetry in neural network layers.
method Analytical and numerical studies of toy models and deep neural networks.
result Neural networks map data points from the same class to a single point in a high-dimensional space, forming a simplex.

Conventional deep learning classifiers are static in the sense that they are trained on a predefined set of classes and learning to classify a novel class typically requires re-training. In this work, we address the problem of Low-Shot network expansion learning. We introduce a learning framework which enables expandin…

2018-10-19abs ↗pdf ↗

Interpreting black box classifiers, such as deep networks, allows an analyst to validate a classifier before it is deployed in a high-stakes setting. A natural idea is to visualize the deep network's representations, so as to "see what the network sees". In this paper, we demonstrate that standard dimension reduction m…

2018-03-11abs ↗pdf ↗

Neural networks classify OOD images by their nearest neighbor in training data.

problem Understanding out-of-distribution prediction behavior of neural networks.
method Nearest category generalization (NCG) measure to assess OOD prediction accuracy.
result Adversarially robust networks have higher NCG accuracy than natural training, indicating local regularization impacts decision regions.