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

3468101135 · May 202619922001200920172026
48 results for class-specific variances

A new probabilistic approach improves deep metric learning by considering image uncertainties and class-specific variances.

problem Proxy-based deep metric learning struggles with image uncertainties and class-specific structures.
method Introduces non-isotropic probabilistic proxy-based deep metric learning using directional von Mises-Fisher distributions.
result Improves generalization performance and competitive on standard benchmarks.

In this paper we formulate a probabilistic model for class-specific discriminant subspace learning. The proposed model can naturally incorporate the multi-modal structure of the negative class, which is neglected by existing class-specific methods. Moreover, it can be directly used to define a class-specific probabilis…

2018-12-14abs ↗pdf ↗

In this paper, we carry out null space analysis for Class-Specific Discriminant Analysis (CSDA) and formulate a number of solutions based on the analysis. We analyze both theoretically and experimentally the significance of each algorithmic step. The innate subspace dimensionality resulting from the proposed solutions …

2019-08-13abs ↗pdf ↗

SCRIB assigns multiple labels to each example to control class-specific prediction risks.

problem Lack of a sound mechanism to decide when to refrain from predicting in DL classifiers.
method Set-classifier with Class-specific Risk Bounds (SCRIB) that assigns multiple labels to each example and controls class-specific prediction risks.
result SCRIB obtained class-specific risks 35%-88% closer to the target risks than baseline methods.

XNB classifier improves model interpretability by selecting class-specific features.

problem Overfitting and poor model accuracy in high-dimensional datasets.
method XNB classifier uses Kernel Density Estimation and class-specific feature subsets.
result XNB classifier matches traditional Naive Bayes performance while improving interpretability.

Wide networks learn from adversarial perturbations effectively.

problem Understanding why adversarial examples deceive classifiers and transfer between models.
method Assumed wide two-layer networks, proved with theoretical analysis.
result Adversarial perturbations contain class-specific features for networks to generalize.

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

The paper develops distribution-free methods for ordinal classification.

problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.

New methods improve feature extraction and representation quality in supervised and unsupervised DR.

problem Statistical dependence, data diversity, contrast, and interpretability in conventional DR methods.
method Combines linear and nonlinear formulations for three new independence criteria.
result Significant improvements in contrast, accuracy, and interpretability over baselines.

New method tackles label noise on imbalanced datasets by considering class-specific uncertainty.

problem Label noise and class imbalance in imbalanced datasets.
method Epistemic and aleatoric uncertainty-aware class-specific noise modeling.
result Proposed ULC framework improves performance on imbalanced datasets.

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.

Diffusion-based classifiers such as those relying on the Personalized PageRank and the Heat kernel, enjoy remarkable classification accuracy at modest computational requirements. Their performance however is affected by the extent to which the chosen diffusion captures a typically unknown label propagation mechanism, t…

2018-04-05abs ↗pdf ↗

New study on guidance in masked diffusion models, showing how it shapes sampling dynamics.

problem Understanding how guidance influences the sampling behavior of masked diffusion models.
method Derived explicit solution to guided reverse dynamics, analyzing effects in 1D and 2D.
result Guidance amplifies class-specific regions and suppresses shared regions, affecting covariance structures.

Proposes a new framework for image generation using classification latent space representations.

problem Combining discriminative and dense representations for image generation and reconstruction.
method Discriminative modeling framework using manipulated supervised latent representations.
result Higher classification accuracy and visually realistic image generation compared to existing models.

Study characterizes and mitigates imbalances in neurosymbolic learning.

problem Characterizing and mitigating class-specific risks in neural classifiers.
method Theoretical analysis and practical techniques including estimating marginal gold labels and mitigating imbalances at training and testing time.
result Learning imbalances can be greatly impacted by the symbolic component σ, unlike in supervised and weakly supervised learning.

Proposes class-agnostic object detection to handle all objects without class labels.

problem Difficulty and cost in creating annotated datasets limit conventional object detection models to specific object types.
method Proposes class-agnostic object detection as a new problem and proposes training and evaluation protocols. Uses adversarial learning to exclude class-specific information.
result Adversarial learning improves class-agnostic detection efficacy.

BCCP uses bandit feedback to provide reliable predictions with limited labeled data.

problem Limited labeled data and bandit feedback challenge online set-valued classification.
method BCCP uses stochastic gradient descent to train model and make set-valued inferences with unbiased estimation of true label.
result BCCP offers coverage guarantees on a class-specific granularity.

We propose a fast, model agnostic method for finding interpretable counterfactual explanations of classifier predictions by using class prototypes. We show that class prototypes, obtained using either an encoder or through class specific k-d trees, significantly speed up the the search for counterfactual instances and …

2019-07-03abs ↗pdf ↗

We present an algorithm for computing class-specific universal adversarial perturbations for deep neural networks. Such perturbations can induce misclassification in a large fraction of images of a specific class. Unlike previous methods that use iterative optimization for computing a universal perturbation, the propos…

2019-12-01abs ↗pdf ↗

RATIO improves neural network robustness and explainability.

problem Neural networks' lack of robustness to adversarial changes and uncertainty on out-distribution samples.
method RATIO: Adversarial Training on In- and Out-distribution.
result RATIO leads to robust models with reliable confidence estimates on out-distribution samples.

We propose a technique for making Convolutional Neural Network (CNN)-based models more transparent by visualizing input regions that are 'important' for predictions -- or visual explanations. Our approach, called Gradient-weighted Class Activation Mapping (Grad-CAM), uses class-specific gradient information to localize…

2016-11-22abs ↗pdf ↗

This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation. The proposed method, meta classification learning, optimizes a binary classifier for pairwise similarity prediction a…

2019-01-02abs ↗pdf ↗

Batch Normalization (BN) is a common technique used to speed-up and stabilize training. On the other hand, the learnable parameters of BN are commonly used in conditional Generative Adversarial Networks (cGANs) for representing class-specific information using conditional Batch Normalization (cBN). In this paper we pro…

2018-06-01abs ↗pdf ↗

Adaptive optimal transport priors improve few-shot learning robustness.

problem Limited supervision and distribution shifts in few-shot learning.
method Prototype-Guided Distributionally Robust Optimization (PG-DRO) framework.
result PG-DRO achieves stronger robust generalization in few-shot scenarios.

Energy-efficient detection of natural errors in deep networks.

problem Deep networks lack error detection capability without additional energy costs.
method Append RACs at hidden layers to detect natural errors with early classification termination.
result Early classification termination reduces energy consumption.

New taxonomy reveals different detection limits for various types of fraud.

problem Existing fraud detection treats all fraud as the same, ignoring its diverse forms.
method Introduced an observation-mechanism taxonomy with five fraud classes.
result Separate estimation by fraud class outperforms pooled estimation.

Large-scale datasets play a fundamental role in training deep learning models. However, dataset collection is difficult in domains that involve sensitive information. Collaborative learning techniques provide a privacy-preserving solution, by enabling training over a number of private datasets that are not shared by th…

2019-08-27abs ↗pdf ↗

Predicts optimal training dataset sizes per class for machine learning models.

problem Optimizing training dataset sizes for class-specific machine learning models.
method Algorithm based on space-filling design of experiments, models like powerlaw curves and generalized linear models.
result The algorithm predicts optimal training dataset sizes per class for improved model performance.

This paper studies the problem of Generalized Zero-shot Learning (G-ZSL), whose goal is to classify instances belonging to both seen and unseen classes at the test time. We propose a novel space decomposition method to solve G-ZSL. Some previous models with space decomposition operations only calibrate the confident pr…

2018-10-17abs ↗pdf ↗

Despite their impressive performance, deep neural networks exhibit striking failures on out-of-distribution inputs. One core idea of adversarial example research is to reveal neural network errors under such distribution shifts. We decompose these errors into two complementary sources: sensitivity and invariance. We sh…

2018-11-01abs ↗pdf ↗

The paper develops a neural network-based classifier for diffusion process drifts.

problem Classifying diffusion processes with distinct drift functions from discrete observations.
method Derives a Bayes rule and constructs a plug-in classifier using neural networks to estimate drifts.
result Establishes convergence rates for misclassification risk, highlighting benefits of diffusion structure.

Researchers use information geometry to analyze and improve DRWs for node classification.

problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.

To overcome the absence of training data for unseen classes, conventional zero-shot learning approaches mainly train their model on seen datapoints and leverage the semantic descriptions for both seen and unseen classes. Beyond exploiting relations between classes of seen and unseen, we present a deep generative model …

2019-10-21abs ↗pdf ↗

PointGMM learns hGMMs from point clouds for 3D shape representation.

problem Lack of shape priors and non-local information in point cloud representations.
method Neural network that learns hierarchical Gaussian mixture models (hGMMs) for 3D shapes.
result Generative model learns meaningful latent space for interpolations and novel shape synthesis.

Proposes a method to estimate acceptance regions for many classes, including new ones.

problem Lack of methods to handle new classes in set-valued classification.
method Generalized Prediction Set (GPS) approach to estimate acceptance regions.
result Achieves a good balance between accuracy, efficiency, and anomaly detection.