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

Trend · papers per month

172344516688 · Jun 202019922001200920172026
48 results for class features

This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …

2018-12-20abs ↗pdf ↗

Contrastive learning struggles with class collapse and feature suppression, revealing bias towards simpler solutions.

problem Contrastive learning struggles with class collapse and feature suppression, especially in supervised and unsupervised settings.
method Unified theoretical framework to determine which features are learnt by CL, revealing bias towards simpler solutions.
result Bias towards simpler solutions is a key factor in class collapse and feature suppression.

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.

This paper introduces a new feature learning technique based on error representation.

problem Learning high-level features for classification from diverse and imbalanced data.
method Inverse feature learning using error representation approach.
result Significantly better performance compared to state-of-the-art techniques.

Paper tackles class-incremental time series classification with dual-stream feature extraction.

problem Class-incremental continual learning for multivariate time series data.
method Dual-stream feature extraction pipeline combining deep temporal embedding features and statistical features.
result Competitive average accuracy across multiple datasets with low forgetting rates.

This paper extends neural collapse to class-imbalanced datasets using an unconstrained ReLU feature model.

problem Understanding neural collapse in class-imbalanced datasets with cross-entropy loss.
method Generalized neural collapse to class-imbalanced settings using an unconstrained ReLU feature model.
result Class-means converge to orthogonal vectors with different lengths, and classifier weights align to these vectors.

Neural collapse occurs in normalized features over a Riemannian manifold.

problem Understanding neural collapse in normalized feature models.
method Simplified multi-class classification task to a nonconvex optimization problem over the Riemannian manifold, analyzing the landscape of critical points.
result The only global minimizers are neural collapse solutions, with all other critical points being strict saddles.

SQFA learns features maximizing Fisher-Rao distance for better classification.

problem Improving classification accuracy through feature learning.
method SQFA learns linear features maximizing Fisher-Rao distance between class-conditional distributions.
result SQFA-H features achieve the best classification accuracy.

Study reveals class-dependent effects in perturbation-based feature attribution metrics for time series classification.

problem Varying effectiveness of perturbation-based metrics across different classes in time series models.
method Systematic empirical analysis across multiple datasets, model architectures, and perturbation strategies.
result Perturbation-based metrics show varying effectiveness across classes, with some metrics performing better for certain classes.

The study sets lower bounds on MMSE for inferring sensitive features from noisy data.

problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.

Deep neural networks trained over large datasets learn features that are both generic to the whole dataset, and specific to individual classes in the dataset. Learned features tend towards generic in the lower layers and specific in the higher layers of a network. Methods like fine-tuning are made possible because of t…

2018-04-20abs ↗pdf ↗

Proposes a method for clearer counterfactual explanations of deep networks.

problem Unclear explanations from current counterfactual methods.
method Gradual construction of explanations through masking and composition steps.
result Produces human-friendly, interpretable explanations with fewer modifications.

The study reveals how adversarial perturbations can include class features for generalization.

problem Understanding why adversarial examples deceive neural networks and transfer between networks.
method A one-hidden-layer network trained on mutually orthogonal samples.
result Adversarial perturbations, even of a few pixels, contain sufficient class features for generalization.

Multiclass prediction is the problem of classifying an object into a relevant target class. We consider the problem of learning a multiclass predictor that uses only few features, and in particular, the number of used features should increase sub-linearly with the number of possible classes. This implies that features …

2011-09-05abs ↗pdf ↗

Improves few-shot learning for hierarchical data using hyperbolic space.

problem Few-shot class-incremental learning for hierarchical data.
method Contrastive learning in hyperbolic space, Poincaré ball model, hyperbolic contrastive loss, maximum entropy distribution.
result Effective improvement of coarse and fine class accuracies in few-shot conditions.

This paper proposes a zero-shot learning approach for audio classification based on the textual information about class labels without any audio samples from target classes. We propose an audio classification system built on the bilinear model, which takes audio feature embeddings and semantic class label embeddings as…

2019-05-06abs ↗pdf ↗

Random feature approximation speeds up spectral methods and improves learning rates.

problem Improving the efficiency and generalization of spectral methods in large-scale algorithms.
method Combining random feature approximation with spectral regularization methods.
result Optimal learning rates for estimators over various regularity classes, including those not in the RKHS.

Classical supervised classification tasks search for a nonlinear mapping that maps each encoded feature directly to a probability mass over the labels. Such a learning framework typically lacks the intuition that encoded features from the same class tend to be similar and thus has little interpretability for the learne…

2019-10-15abs ↗pdf ↗

The objective of the paper is to study accuracy of multi-class classification in high-dimensional setting, where the number of classes is also large ("large LL, large pp, small nn" model). While this problem arises in many practical applications and many techniques have been recently developed for its solution, to t…

2015-06-04abs ↗pdf ↗

We propose an optimal transport (OT) framework for generalized zero-shot learning (GZSL), seeking to distinguish samples for both seen and unseen classes, with the assist of auxiliary attributes. The discrepancy between features and attributes is minimized by solving an optimal transport problem. {Specifically, we buil…

2019-10-20abs ↗pdf ↗

We characterize the class of exchangeable feature allocations assigning probability Vn,kl=1kWmlUnmlV_{n,k}\prod_{l=1}^{k}W_{m_{l}}U_{n-m_{l}} to a feature allocation of nn individuals, displaying kk features with counts (m1,,mk)(m_{1},\ldots,m_{k}) for these features. Each element of this class is parametrized by a countable matrix VV

2016-07-07abs ↗pdf ↗

At present, object recognition studies are mostly conducted in a closed lab setting with classes in test phase typically in training phase. However, real-world problem is far more challenging because: i) new classes unseen in the training phase can appear when predicting; ii) discriminative features need to evolve when…

2019-08-26abs ↗pdf ↗

CFA improves model's ability to generalize across unseen domain-class combinations.

problem Challenges in real-world machine learning applications due to data distribution shifts and limited training data.
method Developed Compositional Feature Alignment (CFA) technique to improve CG ability of pretrained models.
result CFA outperforms common finetuning techniques in compositional generalization.

ICAM creates interpretable feature attribution maps for brain images.

problem Challenges in predicting class relevance from brain images due to heterogeneity and background variation.
method A VAE-GAN framework for disentangling class relevance from background features.
result FA maps generated by ICAM outperform baseline methods and support phenotype variation exploration.

Unsupervised clustering can reproduce categorization systems if features and metrics are correctly selected.

problem Reproducing expert-provided categorization systems using unsupervised clustering.
method Investigated using toy datasets and real-world fund categorization. Used appropriate feature selection and a supervised Random Forest-based distance metric.
result Unsupervised clustering can reproduce ground truth classes if features and metrics are correctly selected.

This study addresses an issue of co-adaptation between a feature extractor and a classifier in a neural network. A naive joint optimization of a feature extractor and a classifier often brings situations in which an excessively complex feature distribution adapted to a very specific classifier degrades the test perform…

2019-06-04abs ↗pdf ↗

This paper extends neural collapse to imbalanced data under cross-entropy loss.

problem Analyzing neural collapse in deep networks with imbalanced data.
method Using the unconstrained feature model and cross-entropy loss, the paper studies neural collapse in imbalanced datasets.
result Feature vectors within the same class collapse to a single mean vector, but angles between them depend on sample size.

In this paper, we focus on the separability of classes with the cross-entropy loss function for classification problems by theoretically analyzing the intra-class distance and inter-class distance (i.e. the distance between any two points belonging to the same class and different classes, respectively) in the feature s…

2019-09-16abs ↗pdf ↗