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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for inter-class regularization

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.

Adversarial training is a useful approach to promote the learning of transferable representations across the source and target domains, which has been widely applied for domain adaptation (DA) tasks based on deep neural networks. Until very recently, existing adversarial domain adaptation (ADA) methods ignore the usefu…

2019-05-28abs ↗pdf ↗

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.

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.

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.

Learning to disentangle the hidden factors of variations within a set of observations is a key task for artificial intelligence. We present a unified formulation for class and content disentanglement and use it to illustrate the limitations of current methods. We therefore introduce LORD, a novel method based on Latent…

2019-06-27abs ↗pdf ↗

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.

Proposes RLAR for efficient labeled data classification with robust margin and manifold structure.

problem Clear margin representation and data manifold structure difficulty in linear discriminant methods.
method Introduces retargeted regression for adaptive margin learning and locality-aware strategy for compact data manifold.
result RLAR outperforms state-of-the-art approaches in UCI and benchmark data sets.

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.

New approach improves human activity recognition with wearables.

problem Improving human activity recognition with wearables.
method Exploiting latent relationships between multi-channel sensor modalities, data-agnostic augmentation, and a classification loss criterion.
result Achieves new state-of-the-art performance on four diverse activity recognition benchmarks.

A scalable method for deep metric learning using chance constraints.

problem Improving deep metric learning by addressing feasibility issues.
method Relating DML to chance constraints, reformulating as a feasibility problem, and iteratively training proxies.
result The method effectively improves deep metric learning performance across multiple benchmarks.

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.

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 ↗

CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.

problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.

Metric-based few-shot learning methods try to overcome the difficulty due to the lack of training examples by learning embedding to make comparison easy. We propose a novel algorithm to generate class representatives for few-shot classification tasks. As a probabilistic model for learned features of inputs, we consider…

2019-06-05abs ↗pdf ↗

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 ↗

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.

Unified framework improves cross-corpus EEG emotion recognition by aligning prototypes and refining decision boundaries.

problem Cross-corpus EEG emotion recognition suffers from performance degradation due to physiological variability and device inconsistencies.
method Prototype-driven Adversarial Alignment (PAA) framework with three configurations: local, contrastive, and boundary-aware.
result State-of-the-art performance improvements across four cross-corpus evaluation protocols.

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.

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.

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}.

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.

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.