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

106213319425 · Jun 202019922001200920172026
48 results for Augmented Classes

This paper studies the problem of learning with augmented classes (LAC), where augmented classes unobserved in the training data might emerge in the testing phase. Previous studies generally attempt to discover augmented classes by exploiting geometric properties, achieving inspiring empirical performance yet lacking t…

2019-10-21abs ↗pdf ↗

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.

A new data augmentation method selects mixed classes based on class distances for better performance.

problem Improving recognition accuracy in object recognition using deep learning.
method Calculates class distances and selects mixed data from suitable classes dynamically.
result Improves recognition performance on general and long-tailed image recognition datasets.

This paper evaluates methods to improve classification on imbalanced datasets.

problem Class imbalance in classification problems.
method Combination of data augmentation and ensemble learning methods.
result Combinations of data augmentation methods with ensemble learning can significantly improve classification performance.

The study explores Legendrian fillings and augmentations, providing methods to compute induced augmentations.

problem Understanding and computing Legendrian isotopy invariants through augmentations and fillings.
method Developed methods to compute induced augmentations based on Morse complex families and Legendrian cobordisms.
result Established methods to compute Legendrian isotopy invariants using augmentations and fillings.

Synthetic data augmentation can improve imbalanced classification metrics.

problem Improving imbalanced classification metrics
method Developing a framework for analyzing the effects of synthetic data augmentation on score-based classification
result Augmentation can improve AUROC, AUPRC, balanced accuracy, and F1 score

New theory explains contrastive learning via overlapping augmented views.

problem Lack of theoretical understanding of contrastive learning.
method Augmentation overlap perspective to improve downstream performance.
result Asymptotically closed bounds for downstream performance under weaker assumptions.

Paper proposes an unbiased risk estimator for PLLAC, handling unseen classes.

problem Handling unseen classes in PLLAC where some classes are not present in the training set.
method Proposes an unbiased risk estimator that estimates the distribution of augmented classes by differentiating known classes from unlabeled data.
result The estimator provides theoretical guarantees and converges to true risk minimizer as data increases.

Effective training of neural networks requires much data. In the low-data regime, parameters are underdetermined, and learnt networks generalise poorly. Data Augmentation alleviates this by using existing data more effectively. However standard data augmentation produces only limited plausible alternative data. Given t…

2017-11-12abs ↗pdf ↗

We propose regularization strategies for learning discriminative models that are robust to in-class variations of the input data. We use the Wasserstein-2 geometry to capture semantically meaningful neighborhoods in the space of images, and define a corresponding input-dependent additive noise data augmentation model. …

2019-09-15abs ↗pdf ↗

Proposes a new framework for learning image augmentations to improve classification performance.

problem Improving classification performance with a given class of predictors.
method Transformed Risk Minimization (TRM) framework that optimizes both predictive models and data transformations.
result Performance of TRM with SCALE algorithm compares favorably to prior methods on CIFAR10/100.

In this paper, we propose a novel implicit semantic data augmentation (ISDA) approach to complement traditional augmentation techniques like flipping, translation or rotation. Our work is motivated by the intriguing property that deep networks are surprisingly good at linearizing features, such that certain directions …

2019-09-26abs ↗pdf ↗

We study the geometry of fully augmented link complements in S3S^3 by looking at their link diagrams. We extend the method introduced by Thistlethwaite and Tsvietkova to fully augmented links and define a system of algebraic equations in terms of parameters coming from edges and crossings of the link diagrams. Combinin…

2018-11-18abs ↗pdf ↗

Compute group cohomology for mapping class group with non-symplectic coefficients.

problem Compute group cohomology for mapping class group with non-symplectic coefficients.
method Compute the invariant subspace of the rational group ring of a surface, truncated by powers of the augmentation ideal, under the action of the mapping class group.
result First group cohomology computation for the mapping class group with non-symplectic coefficients.

Self-augmentation improves deep networks for few-shot learning with minimal training data.

problem Improving deep networks' generalization to unseen classes with limited training examples.
method Self-augmentation using self-mix and self-distillation techniques, combined with regional dropout and local representation learning.
result The method outperforms state-of-the-art few-shot learning methods on prevalent benchmarks.

We study the fibration of augmented link complements. Given the diagram of an augmented link we associate a spanning surface and a graph. We then show that this surface is a fiber for the link complement if and only if the associated graph is a tree. We further show that fibration is preserved under Dehn filling on cer…

2011-09-14abs ↗pdf ↗

This paper tackles few-shot classification by improving GAN-based data augmentation.

problem Improving few-shot classification performance using GANs with limited data.
method Fine-tuning GANs for few-shot classification, addressing training and evaluation challenges.
result Semi-supervised fine-tuning is a more effective approach for few-shot classification with limited data.

This paper proposes an autoencoder (AE) that is used for improving the performance of once-class classifiers for the purpose of detecting anomalies. Traditional one-class classifiers (OCCs) perform poorly under certain conditions such as high-dimensionality and sparsity. Also, the size of the training set plays an impo…

2019-12-21abs ↗pdf ↗

Regularization and data augmentation can be class-dependent, leading to poor performance on some classes.

problem Class-dependent effects of regularization and data augmentation.
method Evaluation of regularization and data augmentation techniques on Imagenet and INaturalist datasets.
result Regularization and data augmentation can lead to significant performance drops on some classes.

To a Legendrian knot, one can associate an A\mathcal{A}_{\infty} category, the augmentation category. An exact Lagrangian cobordism between two Legendrian knots gives a functor of the augmentation categories of the two knots. We study the functor and establish a long exact sequence relating the corresponding cohomolog…

2016-06-19abs ↗pdf ↗

Model patching closes subgroup performance gaps in skin cancer classification.

problem Inconsistent model performance on specific subgroups of a class.
method Two-stage framework that models subgroup features and learns semantic transformations, followed by data augmentation.
result Reductions in robust error of up to 33% relative to best baseline on benchmark datasets.

Synthetic augmentation helps but not always in imbalanced learning.

problem Imbalanced learning causes poor performance on rare classes.
method Developed a statistical framework for synthetic augmentation in imbalanced learning.
result Synthetic augmentation is not always beneficial and depends on the imbalance regime.

Data augmentation, a technique in which a training set is expanded with class-preserving transformations, is ubiquitous in modern machine learning pipelines. In this paper, we seek to establish a theoretical framework for understanding data augmentation. We approach this from two directions: First, we provide a general…

2018-03-16abs ↗pdf ↗

Data augmentation (DA) is fundamental against overfitting in large convolutional neural networks, especially with a limited training dataset. In images, DA is usually based on heuristic transformations, like geometric or color transformations. Instead of using predefined transformations, our work learns data augmentati…

2019-09-21abs ↗pdf ↗

Herein, we present a system for hyperspectral image segmentation that utilizes multiple class--based denoising autoencoders which are efficiently trained. Moreover, we present a novel hyperspectral data augmentation method for labelled HSI data using linear mixtures of pixels from each class, which helps the system wit…

2018-07-11abs ↗pdf ↗

Study challenges the necessity of data augmentation for improving predictions on imbalanced text datasets.

problem Improving predictions on imbalanced text datasets.
method Comparing classifier cutoff adjustments to data augmentation techniques.
result Classifier cutoff adjustments can produce similar results to data augmentation without the need for additional data.

This paper uses GANs to generate synthetic Bitcoin address data.

problem Class imbalance in Bitcoin ground-truth datasets affects supervised machine learning results.
method Generative Adversarial Networks (GANs) for synthetic data generation.
result A 'good' GAN configuration can be found to generate synthetic Bitcoin address data with high similarity to real data.

i-Mix improves contrastive learning across domains without domain-specific augmentations.

problem Improving contrastive representation learning for unlabeled data across diverse domains.
method i-Mix treats contrastive learning as a non-parametric classifier problem, mixing data in input and virtual label spaces.
result i-Mix consistently improves representation quality across image, speech, and tabular data domains.

Proves accuracy guarantees for self-supervised learning with correlated positive pairs.

problem Lack of theoretical guarantees for self-supervised learning with correlated positive pairs.
method Novel augmentation graph concept and spectral decomposition loss.
result Provably accurate features under linear probe evaluation.

In this paper we construct an A\mathcal{A}_\infty-category associated to a Legendrian submanifold of jet spaces. Objects of the category are augmentations of the Chekanov algebra A(Λ)\mathcal{A}(Λ) and the homology of the morphism spaces forms a new set of invariants of Legendrian submanifolds called the bilinearised Le…

2012-10-27abs ↗pdf ↗

Deep learning has significant potential for medical imaging. However, since the incident rate of each disease varies widely, the frequency of classes in a medical image dataset is imbalanced, leading to poor accuracy for such infrequent classes. One possible solution is data augmentation of infrequent classes using syn…

2018-11-28abs ↗pdf ↗

YuruGAN generates yuru-chara images using GANs and clustering for small datasets.

problem Generating high-quality yuru-chara images with limited data.
method Class conditional GAN with clustering and data augmentation.
result Improved quality of generated yuru-chara images through clustering and data augmentation.