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

Trend · papers per month

78156233311 · May 202619922001200920172026
48 results for inter-class dependency

A new method makes adversarial domain adaptation aware of class relationships.

problem Ignoring inter-class semantic relationships in domain adaptation.
method RADA algorithm that aligns inter-class dependencies learned from domain discriminator with those from label predictor.
result Improves performance on benchmark datasets by incorporating class relationships.

This work studies the impact of intra-/inter-class diversity on pre-training datasets and finds a balance for optimal performance.

problem The impact of intra-/inter-class diversity on supervised pre-training datasets and their effect on downstream tasks.
method Empirical study and theoretical analysis of the relationship between diversity types and downstream performance.
result The optimal class-to-sample ratio is invariant to the size of the pre-training dataset and can be predicted.

The paper analyzes how well classes are separated in neural network feature space.

problem Understanding class separability in neural network feature space.
method Theoretical analysis of intra-class and inter-class distances in feature space.
result A lower bound for the probability of inter-class distance being greater than intra-class distance as a function of loss value.

AdaCAD improves semi-supervised classification by focusing on intra-class nodes.

problem Improving semi-supervised classification by addressing inter-class connections in graphs.
method AdaCAD uses a class-attentive diffusion process to adaptively aggregate nodes based on their class similarity.
result AdaCAD significantly outperforms state-of-the-art methods in semi-supervised classification.

This paper refines MMD for domain adaptation by balancing intra-class and inter-class distances.

problem Balancing intra-class and inter-class distances for better feature discriminability in domain adaptation.
method The paper theoretically proves two facts about MMD and proposes a novel discriminative MMD method to balance intra-class and inter-class distances.
result The proposed method improves feature discriminability and outperforms state-of-the-art methods.

Study improves speaker verification accuracy using angular based embedding learning.

problem Improving discriminative power of embeddings for open-set speaker verification.
method Optimizes angular distance and adds margin penalty, applying various angular margin embedding strategies and proposing inter-class regularization.
result Achieved impressive results with 16.5% improvement in EER and 18.2% improvement in minimum detection cost function.

Proposes a new layer for efficient 3D shape discrimination.

problem Irregular structure and redundancy in 3D point clouds hinder efficient inter-class discrimination.
method Integrates Blended Convolution and Synthesis layer that projects and synthesizes 3D point clouds, followed by 3D convolution in the unit ball.
result End-to-end architecture achieves compelling results on 3D shape recognition and retrieval.

A new method for few-shot learning using directional statistics.

problem Few-shot classification with limited training data.
method Generates class representatives using a mixture of von Mises-Fisher distributions to capture inter-class correlation.
result Outperforms other methods in miniImageNet and tieredImageNet datasets.

Paper proposes angular loss for better face recognition and object classification.

problem Improving intra-class compactness and preventing overfitting in face recognition and object classification.
method Angular loss function to maximize angular gradient, reducing overfitting and requiring only one adjustable constant.
result Our method outperforms other methods in accuracy, discriminative information, and time-efficiency.

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.

Proposes GM Score to evaluate GANs considering diversity, disentanglement, and discriminability.

problem Evaluation of GANs for sample quality and diversity.
method Integrates various factors including intra-class and inter-class diversity, disentanglement, and discriminability metrics.
result Demonstrates improved evaluation of GANs on MNIST dataset.

In this paper we propose the use of multiple local binary patterns(LBPs) to effectively classify land use images. We use the UC Merced 21 class land use image dataset. Task is challenging for classification as the dataset contains intra class variability and inter class similarities. Our proposed method of using multi-…

2019-02-07abs ↗pdf ↗

This work explores the relationship between expressivity and generalization in GNNs.

problem Understanding the trade-off between expressivity and generalization in GNNs.
method Introducing a novel framework that connects GNN generalization to the variance in graph structures they can capture.
result Theoretical findings align with empirical results, offering a deeper understanding of how expressivity enhances GNN generalization.

PSC classifier improves HDLSS classification on class-imbalanced data.

problem Classification on high-dimension low-sample-size data with class imbalance.
method Population Structure-learned Classifier (PSC) maximizing inter-class and intra-class scatter matrices.
result PSC outperforms state-of-the-art methods on IHDLSS.

COBRA reduces modality gap in cross-modal tasks.

problem Joint embedding spaces fail to sufficiently reduce modality gap in multi-modal tasks.
method COBRA trains image and text modalities in a joint fashion using Contrastive Predictive Coding and Noise Contrastive Estimation.
result COBRA significantly reduces the modality gap and generates robust joint-embedding space.

MPWTSVM improves multi-view learning by reducing redundancy and enhancing accuracy.

problem Improving multi-view learning models for better accuracy and efficiency.
method Proposes MPWTSVM, which combines WLTSVM's strengths with multi-view learning principles.
result Demonstrates better accuracy and efficiency compared to existing multi-view classification models.

A semi-supervised learning method using predefined class centroids for image classification.

problem Reducing the need for labeled data in deep learning.
method Use a small number of labeled samples and data augmentation on unlabeled samples. Constrain all samples to predefined evenly-distributed class centroids (PEDCC) using loss functions.
result Achieves state-of-the-art results with minimal labeled data.

In this work we propose a method for reducing the dimensionality of tensor objects in a binary classification framework. The proposed Common Mode Patterns method takes into consideration the labels' information, and ensures that tensor objects that belong to different classes do not share common features after the redu…

2019-02-06abs ↗pdf ↗

DeepFRC learns both alignment and classification of functional data in one model.

problem Phase variability in functional data obscures underlying patterns and degrades model performance.
method End-to-end deep learning framework that combines diffeomorphic warping functions and a classifier.
result DeepFRC outperforms state-of-the-art methods in both alignment quality and classification accuracy.

Cross-entropy loss together with softmax is arguably one of the most common used supervision components in convolutional neural networks (CNNs). Despite its simplicity, popularity and excellent performance, the component does not explicitly encourage discriminative learning of features. In this paper, we propose a gene…

2016-12-07abs ↗pdf ↗

Unified method for disentangling classes and content improves AI representation learning.

problem Current methods struggle with disentangling class and content variations.
method LORD: Latent Optimization for Representation Disentanglement with asymmetric noise regularization.
result LORD achieves superior disentanglement performance compared to existing methods.

Boosts neural network performance by improving weight separability.

problem Improving the separability of weight vectors in neural networks.
method Proposes a new evaluation metric and feed-backward reconstruction loss to encourage weight separability.
result Improves visual recognition performance across various tasks.

Despite the wide use of machine learning in adversarial settings including computer security, recent studies have demonstrated vulnerabilities to evasion attacks---carefully crafted adversarial samples that closely resemble legitimate instances, but cause misclassification. In this paper, we examine the adequacy of the…

2017-04-06abs ↗pdf ↗

Improved CNN for HCCR with new loss function and ranking method.

problem Loss of inter-class information in traditional CNN models for HCCR.
method Combining cross entropy with a new similarity ranking function (Average variance similarity) as loss function.
result New loss function (SoftMax cross entropy with Average variance similarity) achieves highest accuracy in HCCR.

Graph data augmentation improves GNN performance in node classification.

problem Improving generalizability of graph neural networks (GNNs) in semi-supervised node classification.
method Introduces GAug framework for graph data augmentation using neural edge predictors.
result GAug framework improves GNN-based node classification performance across various architectures and datasets.

Subspace models play an important role in a wide range of signal processing tasks, and this paper explores how the pairwise geometry of subspaces influences the probability of misclassification. When the mismatch between the signal and the model is vanishingly small, the probability of misclassification is determined b…

2015-07-15abs ↗pdf ↗

With the remarkable success achieved by the Convolutional Neural Networks (CNNs) in object recognition recently, deep learning is being widely used in the computer vision community. Deep Metric Learning (DML), integrating deep learning with conventional metric learning, has set new records in many fields, especially in…

2018-03-07abs ↗pdf ↗

Graph convolution improves linear separability and generalizes to out-of-distribution data.

problem Improving linear separability in semi-supervised classification.
method Applying graph convolution to mixtures of Gaussians in a stochastic block model.
result Graph convolution extends the linear separability regime by a factor of 1/D1/\sqrt{D}.

A new method quantifies deep neural network uncertainty by mixing OVA and AVA classifiers.

problem Uncertainty quantification in deep neural networks, especially for out-of-distribution data.
method Mixing predictions from OVA and AVA classifiers to improve uncertainty quantification.
result Achieves state-of-the-art performance in quantifying out-of-distribution data.

HGKT transfers knowledge from seen to unseen classes in GZSL without prior unseen class info.

problem Learning to classify unseen classes in GZSL.
method Structured heterogeneous graph with graph neural network for knowledge transfer.
result Achieves state-of-the-art results on public benchmark datasets.

CoSCA improves unsupervised domain adaptation by better aligning ambiguous target samples.

problem Missing alignment of ambiguous target samples in unsupervised domain adaptation.
method CoSCA explicitly incorporates intra- and inter-class domain discrepancy, estimating label hypotheses and optimizing a contrastive loss with MMD for better global alignment.
result CoSCA outperforms state-of-the-art approaches in producing more discriminative features.