This work tackles domain shift in speech emotion recognition by proposing class-wise adversarial domain adaptation.
problem Domain shift between corpora poses a challenge for speech emotion recognition, especially for positive/negative emotions.
method Class-wise adversarial domain adaptation to reduce shift between different corpora.
result Our method is effective even with limited target labeled examples, as demonstrated on EMODB and Aibo corpora.
New adversarial attack method based on deep feature distributions.
problem Adversarial attacks on CNN classifiers using output layer information.
method Modeling and exploiting class-wise and layer-wise deep feature distributions.
result Achieves state-of-the-art transfer-based attack results for undefended ImageNet models.
Hidden cost: Smoothing shrinks decision boundaries, affecting class-wise accuracy.
problem The fragility of machine learning models and the need for robustness verification.
method Randomized smoothing approach to achieve statistical robustness.
result Smoothed classifiers' decision boundaries shrink, leading to class-wise accuracy disparity.
A fast method computes class-specific adversarial perturbations for deep networks.
problem Computing robust adversarial perturbations for deep networks.
method Linear function of weights, no training data, no hyper-parameters.
result Obtains 34% to 51% fooling rate on ImageNet, transfers across models.
Two methods improve calibration of probabilistic classifiers, especially for multi-class problems.
problem Improving calibration of probabilistic classifiers, especially for multi-class problems.
method Two techniques: reduced calibration and class-wise calibration.
result Class-wise reduced calibration algorithms reduce prediction and per-class calibration errors.
ART adapts class-wise resampling to improve imbalanced classification performance.
problem Class imbalance in classification tasks limits model performance.
method ART uses adaptive resampling based on class-wise performance metrics.
result ART consistently outperforms other methods on diverse benchmarks.
This paper improves multi-class calibration methods using mutual information maximization-based binning.
problem Calibration of deep neural network predictions, especially for small prior classes.
method I-Max concept for binning, shared class-wise calibration strategy.
result Improves multi-class ranking and calibration performance using a small calibration set.
Improved cGANs using GOLD measure for better data distribution alignment.
problem Improving the quality and controllability of cGANs.
method Measuring the discrepancy between data and model distributions using GOLD.
result Proposed GOLD measure improves cGANs in training, inference, and data selection.
Statistical characteristics of deep network representations, such as sparsity and correlation, are known to be relevant to the performance and interpretability of deep learning. When a statistical characteristic is desired, often an adequate regularizer can be designed and applied during the training phase. Typically, …
Training deep neural networks is known to require a large number of training samples. However, in many applications only few training samples are available. In this work, we tackle the issue of training neural networks for classification task when few training samples are available. We attempt to solve this issue by pr…
New method regularizes deep networks by distilling self-knowledge.
problem Overfitting in deep neural networks.
method Self-knowledge distillation to regularize class-wise predictions.
result Significant improvement in generalization and calibration.
New framework for evaluating multiclass classifier calibration.
problem Ensuring classifiers are well-calibrated for trustworthy predictions.
method Utility Calibration framework that measures calibration error relative to a utility function.
result Unified and robust interpretation of existing calibration metrics.
This paper tackles negative transfer in multi-task learning by introducing class-wise weights.
problem Negative transfer hampers function from achieving optimality in multi-task learning.
method Introduces class-wise weights to drive positive transfer and suppress negative transfer.
result Demonstrates improved performance in multi-task learning by reducing negative transfer.
Toy model study shows resampling/reweighting can improve feature learning in imbalanced classification.
problem Improving feature learning in imbalanced classification problems.
method High-dimensional toy model with replica method, class-wise resampling/reweighting, and simplified model.
result No resampling/reweighting can sometimes give best feature learning performance.
This paper rethinks confidence calibration under covariate shifts.
problem Calibration methods struggle with covariate shifts and unstable importance weighting.
method Derives Expectation consistency condition and proposes Expectation consistency loss (ECL).
result ECL loss is compatible with various types of calibration and has the same sample complexity as ECE.
Proposes top-label calibration and M2B framework for multiclass to binary calibration.
problem Multiclass calibration and interpretation issues.
method Top-label calibration and M2B reduction framework.
result M2B + HB achieves lower calibration error than other methods.
MMDCP improves outlier detection and classification with adaptive prediction sets.
problem Label shift and distribution differences in multi-class settings.
method Combines distance measures with full conformal prediction for adaptive prediction sets.
result Valid coverage and effective control of class-wise false discovery rate (CW-FDR).
S-GAI initializes MLPs using spectral geometry from data, improving performance.
problem Lack of guidance on initial weights encoding data geometry.
method S-GAI uses SVD to estimate spectral class geometry, initializing MLPs from training data.
result S-GAI-initialized MLPs start from a more informative hidden state and achieve comparable accuracy.
Paper explains learning property of logistic and softmax losses for balanced and imbalanced class data.
problem Understanding and optimizing loss functions for deep neural networks with class imbalances.
method Analyzing necessary conditions for convergence of logistic and softmax losses in CNNs.
result Proposes a novel reweighted logistic loss function that improves performance over softmax loss.
Proposes multi-neighborhood LBPs for land use classification.
problem Challenges in classifying land use images due to intra class variability and inter class similarities.
method Uses multi-neighborhood LBPs combined with nearest neighbor classifier.
result Achieved an accuracy of 77.76% on UC Merced 21 class land use image dataset.
LAVA values data without needing a specific learning algorithm.
problem Valuing data without knowing the learning algorithm beforehand.
method Develops a proxy for validation performance using Wasserstein distance and a novel method to value individual data points.
result Significant improvement in performance over state-of-the-art methods, with orders of magnitude faster computation.
We consider the problem of estimating the class prior in an unlabeled dataset. Under the assumption that an additional labeled dataset is available, the class prior can be estimated by fitting a mixture of class-wise data distributions to the unlabeled data distribution. However, in practice, such an additional labeled…
A new method for selective classification trades off accuracy for coverage.
problem Selective classification allows a classifier to abstain from predicting some instances.
method Optimizes a collection of class-wise decoupled one-sided empirical risks.
result The method achieves near-optimal coverage in high target accuracy regimes.
Generative model improves zero-shot sketch-based image retrieval.
problem Existing SBIR methods struggle with novel classes.
method Generative model learns to generate images conditioned on novel sketches.
result Significantly outperforms baselines on two challenging datasets.
New bounds improve graph node classification using optimal transport.
problem Improving transductive generalization bounds for graph node classification.
method Representation-based generalization bounds via optimal transport, expressed in terms of Wasserstein distances.
result Strong correlation between derived bounds and empirical generalization in graph node classification.
The study examines the generalization of Macro-AUC in multi-label learning, identifying label imbalance as a critical factor.
problem Theoretical understanding of Macro-AUC in multi-label learning is lacking.
method Characterization of generalization properties of learning algorithms based on surrogate losses w.r.t. Macro-AUC, identification of label imbalance as a critical factor.
result The widely-used univariate loss-based algorithm is more sensitive to label imbalance than pairwise and reweighted loss-based ones, implying worse performance.
New bounds study class-specific generalization error in machine learning.
problem Existing generalization theories assume uniform class performance, but in practice, classes vary significantly.
method Developed novel information-theoretic bounds using KL divergence and CMI.
result Theoretical bounds accurately capture complex class-generalization error behavior.
LEAK learns from mistakes to improve point cloud segmentation.
problem Improving point cloud semantic segmentation performance.
method Coarse-to-fine clustering, class-conditional prototypical feature alignment, fairness weighting.
result State-of-the-art performances on different architectures, datasets, and tasks.
Proposes a game-theoretic approach for class-dependent rationalization.
problem Optimizing feature selection for complex neural predictors.
method A game-theoretic approach where classes compete to find evidence for factual and counterfactual scenarios.
result The method identifies both factual and counterfactual rationales consistent with human rationalization.
Graph Attention Networks predict power outage durations from natural disasters.
problem Accurately predicting power outage durations from geospatial and weather data.
method Graph Attention Networks (GAT) for semi-supervised learning.
result GAT model outperforms existing methods by 2% - 15% in accuracy.
Noise makes data unlearnable by tricking models.
problem Unauthorized exploitation of personal data by deep learning models.
method Error-minimizing noise to reduce training examples' learnability.
result Error-minimizing noise can make training examples unlearnable by deep learning models.
Unified framework for spectral methods, kernel learning, and manifold unfolding.
problem Tackles the unification and optimization of spectral dimensionality reduction methods.
method Unified spectral methods as kernel PCA, kernel learning by SDP, and detailed explanation of MVU variants.
result Unified understanding and optimization of manifold learning techniques.
Paper proposes a few-shot learning method for human activity recognition.
problem Efficiently recognize human activities with limited labeled data.
method Uses deep learning for feature extraction and knowledge transfer from existing models.
result Promising results show the proposed method's advantages over traditional approaches.
LangDA improves domain adaptation for semantic segmentation by learning context-aware scene descriptions.
problem Improving domain adaptation for semantic segmentation with dense prediction tasks.
method LangDA learns contextual relationships between objects via VLM-generated scene descriptions and aligns image features with text representation.
result LangDA sets new state-of-the-art across three DASS benchmarks, outperforming existing methods.
The study quantifies the impact of fund miscategorization using machine learning.
problem The impact of fund miscategorization on investment decisions.
method Formulated as a distance-based outlier detection problem, used Random Forest based distance metric learning.
result Identified funds with strong relationship to future returns as outliers.
Enhances deep learning robustness to noise without sacrificing clean data accuracy.
problem Robustness of deep neural networks to input noise.
method Discriminative loss at penultimate layer and class-wise feature alignment with Gaussian noise.
result Improves robustness to various perturbations without degrading clean data accuracy.
This paper tackles worst-class error rate in classification tasks.
problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.
Paper tackles imbalanced binary classification by optimizing precision and recall directly.
problem Imbalanced binary classification where standard accuracy is misleading.
method Exact constrained reformulations for precision and recall optimization.
result ERO framework outperforms state-of-the-art methods on multiple datasets.
Proposes a new adversarial model to avoid accuracy vs. adversarial accuracy tradeoff.
problem Inherent tradeoff between accuracy and adversarial accuracy in existing adversarial robustness definitions.
method Introduces Voronoi-epsilon adversary that balances perturbation constraints.
result Voronoi-epsilon adversary avoids accuracy vs. adversarial accuracy tradeoff even with large ε. Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.
problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.
New method makes neural networks more resilient to location-optimized adversarial patches.
problem Neural networks' vulnerability to adversarial patches that are visible but still effective.
method Developed a practical approach to optimize patch locations and applied adversarial training.
result Significantly improved robustness against adversarial patches on CIFAR10 and GTSRB.
The study assesses machine learning generalization using various data set characteristics.
problem Estimating confidence in machine learning predictions and assessing generalization capabilities.
method Meta-analysis of 109 classification data sets, modeling generalization as a function of various characteristics.
result The convex hull of the training data is relevant for assessing machine learning generalization, challenging the common assumption about the curse of dimensionality.
Adversarial training achieves optimal test error for shallow networks.
problem Achieving optimal adversarial test error for general data distributions.
method Applying new Rademacher complexity bounds and properties of optimal adversarial predictors.
result Adversarial training can achieve optimal adversarial test error for general data distributions.
SPAT improves adversarial robustness by preserving semantics in adversarial training.
problem Adversarial examples often have different semantics than original data, introducing unintended biases.
method Semantics-preserving adversarial training (SPAT) that encourages pixel perturbation shared among all classes.
result SPAT improves adversarial robustness and achieves state-of-the-art results in CIFAR-10 and CIFAR-100.
New approach improves adversarial robustness without sacrificing natural generalization.
problem Balancing adversarial robustness and natural generalization in machine learning.
method Friendly adversarial training (FAT) using early-stopped PGD to find least adversarial data.
result Early-stopped PGD achieves adversarial robustness without compromising natural generalization.
Improves adversarial training generalization with domain adaptation.
problem Weak generalization of adversarial training due to lack of representative adversarial samples.
method Adversarial Training with Domain Adaptation (ATDA) method.
result ATDA greatly improves adversarial training generalization and model smoothness.
Adversarial training adds dynamic perturbations to neural networks for robustness.
problem Accuracy trade-off and lack of diversity in adversarial examples.
method Dynamic adversarial perturbations in the parameter space of neural networks, updating perturbation biases during training.
result Adversarial training with negligible cost and reduced accuracy trade-off.
Simple regularization methods mimic adversarial training's robustness.
problem Expensive adversarial training for robustness.
method Label smoothing and logit squeezing.
result Achieves strong adversarial robustness without adversarial examples.