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

121242362483 · Jun 202019922001200920172026
48 results for multiple labels

Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.

problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.

AM-PPI uses multiple predictors to reduce label cost in healthcare AI.

problem Reduces label cost in post-deployment monitoring of healthcare AI.
method Combines model predictions with a small labeled sample, routing each instance to a cost-appropriate subset of predictors.
result Produces narrower confidence intervals than single-predictor methods.

We tackle the problem of inferring node labels in a partially labeled graph where each node in the graph has multiple label types and each label type has a large number of possible labels. Our primary example, and the focus of this paper, is the joint inference of label types such as hometown, current city, and employe…

2014-01-30abs ↗pdf ↗

Paper proposes a new method to aggregate multiple sources with different label distributions.

problem Aggregating from multiple target-shifted sources with different label distributions.
method Unified framework to select relevant sources for domain adaptation with limited label, unsupervised, and label partial unsupervised scenarios.
result Empirical results significantly outperform baselines.

Despite the advancement of supervised image recognition algorithms, their dependence on the availability of labeled data and the rapid expansion of image categories raise the significant challenge of zero-shot learning. Zero-shot learning (ZSL) aims to transfer knowledge from labeled classes into unlabeled classes to r…

2018-05-18abs ↗pdf ↗

Proposes a new model for noisy labels considering multiple labelers and adversarial attacks.

problem Real-world noisy label models with multiple labelers and adversarial attacks.
method Labeler-dependent noise model with adversarial attack vectors.
result State-of-the-art approaches for learning from noisy labels are defeated by adversarial label attacks.

EnMDAP aligns conditional distributions for multi-source domain adaptation using pseudolabels.

problem Training a target model with no labeled data in the absence of target data labels.
method EnMDAP uses label-wise moment matching and ensemble learning with multiple feature extractors.
result EnMDAP achieves state-of-the-art performance in multi-source domain adaptation tasks.

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.

New framework for learning with class-conditional multi-label noise.

problem Class labels corrupted with conditional probabilities for multiple labels.
method Formalized as CCMN framework, established unbiased estimators, proved consistency with multi-label loss functions, implemented partial multi-label learning method.
result Effectiveness validated on multiple datasets and metrics.

Bayesian methods improve tracking multiple objects through dynamic dependencies.

problem Tracking multiple objects with time-varying cardinality and unordered measurements.
method Employing Bayesian nonparametric models, specifically dependent Dirichlet and Pitman-Yor processes, for state estimation and Monte Carlo sampling for trajectory learning.
result The proposed methods outperform existing algorithms in estimating the time-varying number of objects and identifying object associations.

\textit{Multiple Instance Learning} (MIL) is concerned with learning from bags of instances, where only bag labels are given and instance labels are unknown. Existent approaches in this field were mainly designed for the bag-level label prediction (predict labels for bags) but not the instance-level (predict labels for…

2019-05-29abs ↗pdf ↗

Paper introduces methods for more reliable probabilistic predictions with confidence intervals.

problem Inaccurate labeling of datasets due to unreliable probabilistic predictions from weak labeling functions.
method Proposes a methodology to provide confidence intervals for label probabilities using uncertainty sets of distributions.
result Improves reliability of probabilistic predictions and provides confidence intervals for label probabilities.

Proposes a data augmentation method to improve multi-label learning performance.

problem Improving multi-label learning by exploiting label correlations and data augmentation.
method Proposes a novel data augmentation approach that performs clustering on real examples and treats cluster centers as virtual examples, promoting local smoothness through a regularization term.
result Extensive experiments show that the proposed method outperforms state-of-the-art multi-label learning approaches.

Multiple conventions have been adopted for denoting Interval Exchange Transformations (IETs). The "non-labeled" convention was the original, while the "labeled" convention has proven convenient when investigating Flat Surfaces as described by IETs. We establish the relationship between Extended Rauzy Classes, an equiva…

2014-08-03abs ↗pdf ↗

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.

Proposes a method to evaluate classifiers with missing labels using multiple imputation.

problem Missing labels during model evaluation can introduce bias, especially in Missing Not At Random (MNAR) data.
method Develops a multiple imputation technique to estimate and provide predictive distributions for metrics like precision, recall, and ROC-AUC.
result The predictive distribution's location and shape are generally correct, even in the MNAR regime.

This paper improves multi-label classification by leveraging high-order label correlations.

problem Improving accuracy in multi-label classification tasks using label correlations.
method Exploiting high-order label correlations through a supervised learning classifier system (UCS) and label powerset (LP) strategy.
result The proposed method outperforms other LP-based methods on multiple benchmark datasets.

This paper identifies and estimates the label noise transition matrix without ground truth labels.

problem Learning with noisy labels and identifying the noise transition matrix.
method Building on Kruskal's identifiability results, the paper characterizes the identifiability of the label noise transition matrix for the generic case at the instance level.
result The necessity of multiple noisy labels in identifying the noise transition matrix for the generic case at the instance level.

Multiple instance learning (MIL) is a variation of supervised learning where a single class label is assigned to a bag of instances. In this paper, we state the MIL problem as learning the Bernoulli distribution of the bag label where the bag label probability is fully parameterized by neural networks. Furthermore, we …

2018-02-13abs ↗pdf ↗

New active learning method for kernel selection improves efficiency and accuracy.

problem Real-world applications where acquiring true labels is costly or time-consuming.
method Active Multiple Kernel Learning (AMKL) with adaptive kernel selection (AMKL-AKS).
result AMKL-AKS achieves optimal sublinear regret and better performance with fewer labeled data.

Matching the performance of conditional Generative Adversarial Networks with little supervision is an important task, especially in venturing into new domains. We design a new training algorithm, which is robust to missing or ambiguous labels. The main idea is to intentionally corrupt the labels of generated examples t…

2019-06-09abs ↗pdf ↗

Multi-label learning studies the problem where an instance is associated with a set of labels. By treating single-label learning problem as one task, the multi-label learning problem can be casted as solving multiple related tasks simultaneously. In this paper, we propose a novel Multi-task Gradient Descent (MGD) algor…

2019-11-18abs ↗pdf ↗

The paper introduces new measures to quantify variability in decision tree models due to observational multiplicity.

problem The variability in decision tree models due to observational multiplicity.
method Introduces leaf regret and structural regret to decompose observational multiplicity.
result Structural regret is the primary driver of observational multiplicity, accounting for over 15 times the variability of leaf regret in some datasets.

New method improves weakly-supervised action localization.

problem Locating action segments in videos with limited labels.
method Explicitly models key instance assignment as hidden variable using EM framework.
result Achieves state-of-the-art performance on THUMOS14 and ActivityNet1.2 benchmarks.

The usage of machine learning models has grown substantially and is spreading into several application domains. A common need in using machine learning models is collecting the data required to train these models. In some cases, labeling a massive dataset can be a crippling bottleneck, so there is need to develop model…

2019-06-03abs ↗pdf ↗

We consider higher-order linear-chain conditional random fields (HO-LC-CRFs) for sequence modelling, and use sum-product networks (SPNs) for representing higher-order input- and output-dependent factors. SPNs are a recently introduced class of deep models for which exact and efficient inference can be performed. By com…

2018-07-06abs ↗pdf ↗

In the era of big data, a large amount of noisy and incomplete data can be collected from multiple sources for prediction tasks. Combining multiple models or data sources helps to counteract the effects of low data quality and the bias of any single model or data source, and thus can improve the robustness and the perf…

2013-10-16abs ↗pdf ↗