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

Trend · papers per month

65129194258 · Jun 202019922001200920172026
48 results for labeling pipeline

New taxonomy reveals different detection limits for various types of fraud.

problem Existing fraud detection treats all fraud as the same, ignoring its diverse forms.
method Introduced an observation-mechanism taxonomy with five fraud classes.
result Separate estimation by fraud class outperforms pooled estimation.

In this paper, we propose a capsule-based neural network model to solve the semantic segmentation problem. By taking advantage of the extractable part-whole dependencies available in capsule layers, we derive the probabilities of the class labels for individual capsules through a recursive, layer-by-layer procedure. We…

2019-01-09abs ↗pdf ↗

Generating labeled training datasets has become a major bottleneck in Machine Learning (ML) pipelines. Active ML aims to address this issue by designing learning algorithms that automatically and adaptively select the most informative examples for labeling so that human time is not wasted labeling irrelevant, redundant…

2019-05-29abs ↗pdf ↗

Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.

problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.

This paper evaluates conformal prediction for aerial image classification in challenging environments.

problem Challenging aerial image classification in data-scarce, unconstrained environments.
method Conformal prediction applied to pretrained models (MobileNet, DenseNet, ResNet) with limited labeled data.
result Conformal prediction can provide valuable uncertainty estimates even with small labeled samples.

CascadeXML improves multi-resolution learning for XMC with transformer features.

problem Learning subset labels from millions of choices with trade-offs between performance and computation.
method End-to-end multi-resolution learning pipeline using transformer multi-layer architecture.
result Significantly outperforms existing approaches on benchmark datasets.

CMRM improves robustness in noisy label settings without requiring privileged knowledge.

problem Learning with noisy labels without privileged knowledge.
method Conformal Margin Risk Minimization (CMRM) framework.
result CMRM consistently improves accuracy and reduces mislabeling under various noise conditions.

This work compares regularization and constrained inference for label constraints in machine learning.

problem Improving model performance with label constraints in machine learning.
method Comparison of regularization and constrained inference strategies.
result Constrained inference reduces population risk by correcting model violations, while regularization narrows the generalization gap but introduces bias.

Paper improves deep learning for instance-level classification from label proportions.

problem Dealing with noisy pseudo-labeling and high-entropy class distributions in LLP.
method Introducing a two-stage training approach with constrained optimization and mixup strategy.
result Significant performance improvement in instance-level classification.

Domain Adaptation in 6G wireless networks: When is it green?

problem Energy consumption of Domain Adaptation (UDA) compared to single-task training in 6G wireless networks.
method Investigate energy consumption and propose a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.
result Proposed a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.

OPAL optimizes labeling strategy for precise inference from uncertain models.

problem Inference from uncertain machine learning models is brittle.
method OPAL learns a smooth policy to adaptively label data points based on model uncertainty.
result OPAL yields estimators with the lowest variance and achieves nominal coverage in finite samples.

Labeling training datasets has become a key barrier to building medical machine learning models. One strategy is to generate training labels programmatically, for example by applying natural language processing pipelines to text reports associated with imaging studies. We propose cross-modal data programming, which gen…

2019-03-26abs ↗pdf ↗

Obtaining enough labeled data to robustly train complex discriminative models is a major bottleneck in the machine learning pipeline. A popular solution is combining multiple sources of weak supervision using generative models. The structure of these models affects training label quality, but is difficult to learn with…

2017-09-07abs ↗pdf ↗

Improves understanding of PWS by calculating influence of sources and data.

problem Understanding the influence of each component in PWS.
method Proposes source-aware Influence Function (IF) to decompose and calculate influence.
result Improves end model's generalization performance and identifies mislabeling.

AVATAR uses a surrogate model to quickly evaluate ML pipelines, saving time and resources.

problem Time-consuming evaluation of ML pipelines limits exploration of complex models.
method AVATAR employs a surrogate model to assess pipeline validity without execution.
result AVATAR accelerates ML pipeline evaluation, improving efficiency in complex scenarios.

Data augmentation is usually used by supervised learning approaches for offline writer identification, but such approaches require extra training data and potentially lead to overfitting errors. In this study, a semi-supervised feature learning pipeline was proposed to improve the performance of writer identification b…

2018-07-15abs ↗pdf ↗

A key requirement for supervised machine learning is labeled training data, which is created by annotating unlabeled data with the appropriate class. Because this process can in many cases not be done by machines, labeling needs to be performed by human domain experts. This process tends to be expensive both in time an…

2019-12-11abs ↗pdf ↗

Hybrid approach combines topic and graph embeddings for legal document clustering.

problem Challenges in classifying legal texts due to domain-specific language and limited labeled data.
method Combines unsupervised topic and graph embeddings with a supervised model.
result Improves clustering quality over text-only or graph-only embeddings.

Hyperparameter tuning of multi-stage pipelines introduces a significant computational burden. Motivated by the observation that work can be reused across pipelines if the intermediate computations are the same, we propose a pipeline-aware approach to hyperparameter tuning. Our approach optimizes both the design and exe…

2019-03-12abs ↗pdf ↗

The paper introduces uncertainty quantification for NER models.

problem Current NER models lack uncertainty measures, leading to downstream errors.
method Full-Sequence and Subsequence Conformal Prediction framework.
result The method provides formal guarantees about the reliability of model predictions.

Labeling training data is a key bottleneck in the modern machine learning pipeline. Recent weak supervision approaches combine labels from multiple noisy sources by estimating their accuracies without access to ground truth labels; however, estimating the dependencies among these sources is a critical challenge. We foc…

2019-03-14abs ↗pdf ↗

CheXpert++ improves CheXpert's accuracy and usability for medical radiology reports.

problem Infeasibility of obtaining ground truth labels for medical data.
method BERT-based approximation of CheXpert, addressing speed, differentiability, and probabilistic output.
result Achieves 99.81% parity with CheXpert, significantly faster, differentiable, and probabilistic.

Study proposes a statistical testing framework for evaluating clustering pipelines.

problem Quantifying the statistical reliability of clustering results from data analysis pipelines.
method Selective inference-based statistical testing framework for clustering pipelines.
result The proposed test controls the type I error rate and is effective in validating clustering results.

Proposes a novel graph self-training method with EM regularization for semi-supervised node classification.

problem Handles noisy graph structures and feature spaces in semi-supervised node classification.
method Introduces an Expectation-Maximization (EM) regularization scheme for uncertainty-aware pseudo-label generation and model retraining.
result Significantly outperforms strong baselines by up to 2.5% in accuracy.

FavMac maximizes value while controlling cost in multi-label prediction.

problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.

The study examines when to trust confidence thresholding in pseudo-labelling regression.

problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance VV^{*}, motivating a structural separation between classifier features and downstream controls.

Investigates fairness in pipeline models where individuals may drop out.

problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.

Labeling training data is increasingly the largest bottleneck in deploying machine learning systems. We present Snorkel, a first-of-its-kind system that enables users to train state-of-the-art models without hand labeling any training data. Instead, users write labeling functions that express arbitrary heuristics, whic…

2017-11-28abs ↗pdf ↗

Efficiently poisons offline RLHF models by flipping preference labels.

problem Vulnerability of offline RLHF models to preference label flipping attacks.
method Developed two attack methods: BAL-A and BMP-A, solving a structured binary sparse approximation problem.
result Demonstrated that flipping one preference label induces a parameter-independent shift in the DPO gradient, enabling structured binary sparse approximation.

This paper improves anomaly detection in lane rendering images for safer navigation.

problem Anomalies in lane rendering images can mislead drivers, posing safety risks.
method Proposes a four-phase pipeline using Transformer models, self-supervised pre-training, and fine-tuning.
result The pipeline enhances detection accuracy and reduces training time.

Bayesian neural networks are vulnerable to adversarial attacks.

problem Adversarial robustness of Bayesian neural networks.
method Examination of adversarial robustness through three tasks: label prediction, adversarial example detection, and semantic shift detection.
result Bayesian neural networks are highly susceptible to adversarial attacks.

SLIC-UAV monitors forest recovery using UAVs and machine learning.

problem Challenges in monitoring forest recovery, especially in logged tropical forests.
method Novel pipeline for UAV imagery analysis, combining crown labelling, species classification, and superpixel segmentation.
result SLIC-UAV achieves high accuracy in species mapping, from 79.3% to 90.5%.