The paper classifies vehicle shapes and colors using deep neural networks.
problem Vehicle reidentification and classification challenges.
method Used deeper neural networks for classification accuracy.
result Good classification accuracy on make/model and color.
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.
This paper studies the problems of vehicle make & model classification. Some of the main challenges are reaching high classification accuracy and reducing the annotation time of the images. To address these problems, we have created a fine-grained database using online vehicle marketplaces of Turkey. A pipeline is prop…
Study selective classification with limited feedback in online learning.
problem Resource-limited and safety-critical domains where feedback is only received on abstentions.
method Versioning-based schemes for minimizing mistakes and abstentions.
result Constructed schemes that make few mistakes and minimal excess abstentions.
A framework for causal classification using uplift and causal heterogeneity methods.
problem Predicting the effect of interventions on different individuals from data.
method Causal classification framework using off-the-shelf supervised methods.
result Framework works for causal classification and uplift modelling, competitive with other methods.
In the sentence classification task, context formed from sentences adjacent to the sentence being classified can provide important information for classification. This context is, however, often ignored. Where methods do make use of context, only small amounts are considered, making it difficult to scale. We present a …
Optimal cutoff interval for risk scores improves binary classification accuracy.
problem Improving binary classification accuracy with abstention.
method Determines optimal cutoff interval for risk scores, refraining from decisions outside this interval.
result Minimizes classification margin and maximizes accuracy within the interval.
Language models help text classification tasks by predicting next words.
problem Lack of theoretical understanding of why language models perform well on downstream tasks.
method Mathematical study of the connection between next word prediction and text classification, formalizing it and quantifying the benefit.
result Language models that are ε-optimal in cross-entropy learn features that can solve classification tasks with linear approximation.
Gaussian processes (GP) provide a prior over functions and allow finding complex regularities in data. Gaussian processes are successfully used for classification/regression problems and dimensionality reduction. In this work we consider the classification problem only. The complexity of standard methods for GP-classif…
Extends expected value framework for cost-sensitive causal decision-making.
problem Optimizing operational decision-making with cost-sensitive causal classification.
method Introduces a cost-sensitive decision boundary based on estimated individual treatment effects, positive outcome probability, and cost parameters.
result Effective in maximizing expected causal profit, outperforming cost-insensitive ranking approach.
Benchmarking 18 deep neural network selective classification models on various datasets.
problem Designing a model that can abstain from making predictions when there's high risk of error.
method Evaluation of 18 selective classification models using multiple criteria.
result No single model is the clear winner; best model depends on objectives.
SigD2 reduces noisy rules in rule-based classifiers for better accuracy and readability.
problem Redundant and noisy rules in rule-based classifiers reduce model accuracy and readability.
method Two-stage pruning strategy and ensemble methods (bagging and boosting) to reduce noise and improve model performance.
result SigD2 and ACboost ensemble models outperform state-of-the-art classifiers in terms of accuracy and rule count.
Adversarial regularization helps learn interpretable shapelets for time series classification.
problem Difficult to interpret learned shapelets in time series classification.
method Use of adversarial regularization to constrain model to learn more interpretable shapelets.
result Adversarially regularized method learns interpretable shapelets.
Remote sensing satellites capture the cyclic dynamics of our Planet in regular time intervals recorded in satellite time series data. End-to-end trained deep learning models use this time series data to make predictions at a large scale, for instance, to produce up-to-date crop cover maps. Most time series classificati…
Information theoretic active learning has been widely studied for probabilistic models. For simple regression an optimal myopic policy is easily tractable. However, for other tasks and with more complex models, such as classification with nonparametric models, the optimal solution is harder to compute. Current approach…
Advances rule-based multi-label classification using conformal prediction.
problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.
Self-attention improves satellite time series classification without preprocessing.
problem Efficiently classifying raw satellite time series data.
method Comparison of deep learning models including self-attention, 1D-convolutions, recurrence, and random forest.
result Self-attention and recurrent neural networks outperform convolutional neural networks on raw satellite time series.
The paper explores how neural networks make predictions using probabilistic programming.
problem Understanding how neural networks make individual predictions.
method Defining and sampling prediction level sets using probabilistic programming.
result The method can obtain examples that result in specified predictions by neural networks.
LLMs produce volatile sentence-level sentiment classifications that affect financial decision-making.
problem Volatile outputs from LLMs impact financial text understanding tasks.
method Case study on US equity market investing via news sentiment analysis.
result Volatile LLM outputs lead to significant variations in portfolio construction and returns.
We address the problem of graph classification based only on structural information. Inspired by natural language processing techniques (NLP), our model sequentially embeds information to estimate class membership probabilities. Besides, we experiment with NLP-like variational regularization techniques, making the mode…
New method visualizes decision boundaries of classification models.
problem Difficulty in understanding how classification models interpret data.
method Hybrid supervised-unsupervised technique for visualizing decision boundaries.
result Provides interpretable maps for qualitative and quantitative analysis.
A method for selective classification using gambling-inspired loss function.
problem Achieving high performance while covering all data points.
method Transformed classification to selective classification problem, using portfolio theory-inspired loss function.
result Our method identifies uncertainty and achieves strong results on datasets.
Proposes a new machine learning problem for automated temporal decision-making.
problem Automating human involvement in temporal decision-making processes.
method Develops a deep Bayesian neural network, ForeClassNet, with Boltzmann convolutions.
result Achieves superior performance in real-world Foreclassing datasets.
SOAR generates rules for both positive and negative classes in binary classification.
problem Lack of interpretability in machine learning models for binary classification.
method Extends or-of-and classification technique to both positive and negative classes.
result Competitive classification performance with simulated-annealing optimization.
This paper introduces collective counterfactual explanations for groups of instances in classification models.
problem Understanding how classification models make decisions for groups of instances.
method Novel Mathematical Optimization models to find collective counterfactual explanations that minimize total perturbation cost.
result Detects critical features for entire dataset classification and handles outliers.
Paper proposes scalable multi-label classification for edge devices using CNN.
problem Challenges in deploying multi-label CNN models on edge devices due to high computation and memory requirements.
method Extends existing multi-label classification methods with a single CNN model and multiple loss and accuracy layers.
result Achieves comparable accuracy with 1.8x less MACC operations, 0.97x reduction in latency and 0.5x, 0.84x, 0.97x reduction in size for generated CNN models.
Estimating the difficulty level of math word problems is an important task for many educational applications. Identification of relevant and irrelevant sentences in math word problems is an important step for calculating the difficulty levels of such problems. This paper addresses a novel application of text categoriza…
This paper introduces a method to make deep neural networks more robust to adversarial attacks.
problem Deep neural networks are vulnerable to adversarial attacks, leading to incorrect classifications.
method Introduces sensible adversarial learning to balance robustness and natural accuracy.
result Demonstrates that the Bayes classifier is the most robust multi-class classifier under sensible adversarial learning.
New metric reduces arbitrariness in fair binary classification predictions.
problem Variance in predictions leads to arbitrary decisions in fair classification.
method Developed a self-consistency metric and an abstention algorithm.
result Fair binary classification is often close to fair due to variance, not interventions.
Enhances graph classification models on small datasets.
problem Over-fitting and undergeneralization on small-scale benchmark datasets.
method Data augmentation via graph structure transformation and model evolution framework.
result Average improvement of 3 - 13% accuracy on graph classification tasks.
Paper introduces variance-based measures for second-order uncertainty quantification in classification problems.
problem Uncertainty in machine learning predictions and decision-making.
method Second-order uncertainty quantification using variance-based measures.
result Variance-based measures effectively quantify uncertainty on a class-based level and are competitive with entropy-based measures.
This paper proposes CSADA to make DNNs cost-sensitive.
problem Over-parameterization challenges cost-sensitive classification in DNNs.
method CSADA framework using adversarial data augmentation.
result CSADA effectively minimizes overall cost and reduces critical errors.
The sparse representation classifier (SRC) has been utilized in various classification problems, which makes use of L1 minimization and works well for image recognition satisfying a subspace assumption. In this paper we propose a new implementation of SRC via screening, establish its equivalence to the original SRC und…
In text classification, the problem of overfitting arises due to the high dimensionality, making regularization essential. Although classic regularizers provide sparsity, they fail to return highly accurate models. On the contrary, state-of-the-art group-lasso regularizers provide better results at the expense of low s…
The paper analyzes how overparameterized models can generalize well in multiclass classification.
problem Generalization in multiclass classification with overparameterized models.
method Survival/contamination analysis framework adapted for multiclass classification.
result Multiclass classification can generalize well even with many classes, unlike regression tasks.
Adversarial method improves pneumonia classifier's performance across hospitals.
problem Robust classification of pneumonia from chest radiographs across different hospitals.
method Adversarial optimization to learn models invariant to confounders.
result Improved out-of-hospital generalization performance compared to baselines.
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…
We empirically characterize the performance of discriminative and generative LSTM models for text classification. We find that although RNN-based generative models are more powerful than their bag-of-words ancestors (e.g., they account for conditional dependencies across words in a document), they have higher asymptoti…
OmiVAE combines variational autoencoders and a classification network to classify multi-omics data.
problem Classifying samples from high-dimensional multi-omics data.
method OmiVAE integrates variational autoencoders and a classification network to extract features and classify samples.
result OmiVAE achieved an average classification accuracy of 97.49% across 33 tumour types and normal samples.
Minimizes indecisions in selective classification to control misclassification rates.
problem Controlling misclassification rates in high-risk scenarios.
method Using indecisions to control misclassification rates, even below Bayes optimal.
result Control of misclassification rates to any user-specified level, even below Bayes optimal.
Deep learning models detect and classify log anomalies.
problem Anomaly detection in unstructured log data.
method Auto-LSTM, Auto-BLSTM, and Auto-GRU models for feature extraction.
result Models outperform other algorithms on various log data sets.
New split rules improve subpopulation targeting in policy-making.
problem Improving binary classification for subpopulation targeting in policy-making.
method MDFS, PFS, wEFS for maximizing distance and penalizing final splits.
result Proposed methods target more vulnerable subpopulations than classic CART/KD-CART.
Paper introduces MLRH, a probabilistic model for multilabel classification.
problem Multilabel classification challenges in various domains.
method Introduces hidden variables to relax one-hot-encoding in logistic regression.
result Probabilistic model achieves competitive performance compared to other algorithms.
FrequentNet uses frequency domain basis vectors for image classification, making models more interpretable and efficient.
problem Image classification models are often complex and hard to interpret.
method FrequentNet selects filter vectors from frequency domain basis vectors instead of training them with back propagation.
result The method improves interpretability and efficiency of image classification models.
Triplet networks are widely used models that are characterized by good performance in classification and retrieval tasks. In this work we propose to train a triplet network by putting it as the discriminator in Generative Adversarial Nets (GANs). We make use of the good capability of representation learning of the disc…
Proposes LMSSC for multi-view semi-supervised classification.
problem Leveraging multiple complementary views for improved classification.
method Semi-supervised classification with latent multi-view representation learning.
result Unified framework for latent representation learning, graph construction, and label propagation.
A model classifies music genres from MP3 files using metric learning and feature extraction.
problem Classifying music genres from MP3 files efficiently and accurately.
method Metric learning and feature extraction using MFCC and PCA.
result Promising results in classification accuracy compared to baseline algorithms.
Existing relation classification methods that rely on distant supervision assume that a bag of sentences mentioning an entity pair are all describing a relation for the entity pair. Such methods, performing classification at the bag level, cannot identify the mapping between a relation and a sentence, and largely suffe…