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

Trend · papers per month

102204305407 · Jun 202019922001200920172026
48 results for domain annotation noise

RAD improves robustness to domain annotation noise without explicit domain annotations.

problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.

Framework tackles class imbalance and noisy labels in active learning.

problem Class imbalance and noisy labels in real-world datasets.
method Uses foundation model priors to select informative samples for active learning.
result Substantial annotation savings (over 50%) with preserved performance and robustness.

Proposes a new method to improve target annotation in ATR.

problem Challenges in annotating automatic target recognition due to lack of labeled data.
method Hybrid contrastive learning and cycle-consistency-based transductive transfer learning (C3TTL) framework.
result Significantly lower Fréchet Inception Distance (FID) score and improved performance in annotating civilian and military vehicles, as well as ship targets.

Bayesian method improves deep learning for noisy EEG seizure detection.

problem Label noise in scalp EEG data hinders deep learning performance.
method Integrates domain knowledge into a Bayesian framework to inform deep learning models of label ambiguities.
result BUNDL enhances robustness of seizure detection systems under noisy label conditions.

Domain shift is unavoidable in real-world applications of object detection. For example, in self-driving cars, the target domain consists of unconstrained road environments which cannot all possibly be observed in training data. Similarly, in surveillance applications sufficiently representative training data may be la…

2019-04-04abs ↗pdf ↗

Study real-world noisy labels from human annotations for better understanding.

problem Understanding and modeling real-world label noise in machine learning.
method Developed two new benchmark datasets (CIFAR-10N, CIFAR-100N) with human-annotated real-world noisy labels.
result Real-world noisy labels exhibit instance-dependent patterns, not class-dependent as previously assumed.

New method pools labels from similar data items to improve learning from small samples.

problem Learning from small, human-annotated samples with potential disagreement among annotators.
method Proposes neighborhood-based pooling for sharing labels across similar data items.
result Improves learning from small, noisy samples by pooling labels from similar items.

CPATTA uses conformal prediction for efficient test-time adaptation.

problem Low data selection efficiency in existing ATTA methods.
method Conformal Prediction, online weight-update algorithm, domain-shift detector, staged update scheme.
result CPATTA consistently outperforms state-of-the-art methods by 5% in accuracy.

Paper presents a method to train NER models without labelled data using weak supervision.

problem Dealing with NER performance drop in new domains without labelled data.
method Weak supervision through automatic annotation and hidden Markov model integration.
result Improvement of about 7 percentage points in entity-level F1F_1 scores.

Majority Vote is optimal for reliable data labeling under certain conditions.

problem Reliable data labeling requires aggregating multiple annotators' labels, but the optimality of Majority Vote is not well understood.
method Characterized conditions under which Majority Vote achieves the optimal label estimation error.
result Majority Vote optimally recovers labels for a given class distribution under tolerable annotation noise limits.

Unsupervised learning classifies transient noise in gravitational wave detectors.

problem Transient noise interferes with gravitational wave signals, causing instability.
method Combines variational autoencoder and invariant information clustering.
result Consistent classification with Gravity Spy project labels.

Paper tackles instance-dependent label noise by approximating it with part-dependent noise.

problem Learning with instance-dependent label noise is challenging.
method Approximate instance-dependent label noise with part-dependent noise. Use transition matrices for parts to model noise.
result Method outperforms state-of-the-art approaches for instance-dependent label noise.

Integrates multiple datasets to solve open set crowdsourcing problems.

problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.

This work improves medical image segmentation with limited annotations using contrastive learning.

problem Lack of labeled data for medical image segmentation.
method Contrastive learning framework for semi-supervised segmentation with domain-specific and problem-specific cues.
result Significant improvements in segmentation performance compared to other methods.

Meta-learning method for accurate classifier from noisy annotators' data.

problem Accurate learning from noisy labels provided by multiple annotators.
method Meta-learning neural network to embed examples in latent space and estimate annotators' abilities, then adapt classifiers using EM algorithm.
result Meta-learning method improves classifier performance with minimal labeled data.

Dynamic residual adapters improve performance across multiple latent domains without domain labels.

problem Overfitting to large domains and ignoring smaller ones in multi-domain learning.
method Dynamic residual adapters and augmentation strategies inspired by style transfer.
result Dynamic residual adapters significantly outperform standard models on multiple latent domains.

Deep learning for supervised learning has achieved astonishing performance in various machine learning applications. However, annotated data is expensive and rare. In practice, only a small portion of data samples are annotated. Pseudo-ensembling-based approaches have achieved state-of-the-art results in computer visio…

2019-02-11abs ↗pdf ↗

Active learning improves inspection systems by using weakly labeled data.

problem Rapidly updating machine vision inspection systems in evolving manufacturing processes.
method Developed a methodology for active learning from weakly labeled data, addressing covariate shift with domain-adversarial training.
result Demonstrated that active learning can accelerate the annotation process and reduce false positives.

We propose a general-purpose approach to discovering active learning (AL) strategies from data. These strategies are transferable from one domain to another and can be used in conjunction with many machine learning models. To this end, we formalize the annotation process as a Markov decision process, design universal s…

2018-10-09abs ↗pdf ↗

Accurately annotating large scale dataset is notoriously expensive both in time and in money. Although acquiring low-quality-annotated dataset can be much cheaper, it often badly damages the performance of trained models when using such dataset without particular treatment. Various methods have been proposed for learni…

2019-09-08abs ↗pdf ↗

Discriminative active learning reduces data annotation costs for domain adaptation.

problem Conditional shift problem hinders domain adaptation between related but different domains.
method Three-stage active adversarial training: invariant feature space learning, uncertainty and diversity criteria, re-training with queried labels.
result Empirical comparisons show the proposed approach is more effective than existing methods.

This paper refines human labeling as a measurement process, revealing four sources of variation.

problem Systematic variation in human labeling obscures model learning.
method Introduces a statistical framework to decompose labeling outcomes.
result Empirical evidence for four components of labeling variation.

In the absence of sufficient data variation (e.g., scanner and protocol variability) in annotated data, deep neural networks (DNNs) tend to overfit during training. As a result, their performance is significantly lower on data from unseen sources compared to the performance on data from the same source as the training …

2019-08-16abs ↗pdf ↗

We propose a method for unsupervised domain adaptation that trains a shared embedding to align the joint distributions of inputs (domain) and outputs (classes), making any classifier agnostic to the domain. Joint alignment ensures that not only the marginal distributions of the domain are aligned, but the labels as wel…

2019-05-26abs ↗pdf ↗

Supervised Deep Learning has been highly successful in recent years, achieving state-of-the-art results in most tasks. However, with the ongoing uptake of such methods in industrial applications, the requirement for large amounts of annotated data is often a challenge. In most real world problems, manual annotation is …

2018-11-26abs ↗pdf ↗

When learning a hidden Markov model (HMM), sequen- tial observations can often be complemented by real-valued summary response variables generated from the path of hid- den states. Such settings arise in numerous domains, includ- ing many applications in biology, like motif discovery and genome annotation. In this pape…

2015-12-16abs ↗pdf ↗