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

Trend · papers per month

79158236315 · Jun 202019922001200920172026
48 results for true labels

Paper proposes a method to adapt classifiers using complementary labels instead of true labels.

problem Training classifiers with true labels from the source domain is costly and sometimes impossible.
method Proposes a novel setting with complementary labels and a complementary label adversarial network (CLARINET).
result CLARINET significantly outperforms baselines on handwritten digits and object recognition tasks.

In this paper, we consider a novel machine learning problem, that is, learning a classifier from noisy label distributions. In this problem, each instance with a feature vector belongs to at least one group. Then, instead of the true label of each instance, we observe the label distribution of the instances associated …

2017-08-11abs ↗pdf ↗

BCCP uses bandit feedback to provide reliable predictions with limited labeled data.

problem Limited labeled data and bandit feedback challenge online set-valued classification.
method BCCP uses stochastic gradient descent to train model and make set-valued inferences with unbiased estimation of true label.
result BCCP offers coverage guarantees on a class-specific granularity.

In this paper, we study the classification problem in which we have access to easily obtainable surrogate for true labels, namely complementary labels, which specify classes that observations do \textbf{not} belong to. Let YY and Yˉ\bar{Y} be the true and complementary labels, respectively. We first model the annotati…

2017-11-27abs ↗pdf ↗

New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.

problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.

Clarinet uses complementary labels to train classifiers with less source data.

problem Training classifiers with true-label data from source domain is costly.
method Proposes CLARINET to train classifiers with complementary-label source data and unlabeled target data.
result CLARINET significantly outperforms baselines in unsupervised domain adaptation.

Weakly-supervised learning is a paradigm for alleviating the scarcity of labeled data by leveraging lower-quality but larger-scale supervision signals. While existing work mainly focuses on utilizing a certain type of weak supervision, we present a probabilistic framework, learning from indirect observations, for learn…

2019-10-10abs ↗pdf ↗

Paper proposes a new PLL framework with a progressive identification algorithm.

problem Weakly supervised learning with partial labels.
method Flexible model and optimization algorithm for PLL, progressive identification algorithm.
result Established an estimation error bound and set new state of the art.

Paper tackles online adaptation to changing label distributions.

problem Adapting machine learning models to changing label distributions in real-world settings.
method Leverages novel analysis to show estimation of expected test loss is possible without true labels. Proposes adaptation algorithms inspired by classical online learning techniques.
result Empirically verified that OGD is particularly effective and robust to various label shift scenarios.

Deep neural networks (DNNs) can easily fit a random labeling of the training data with zero training error. What is the difference between DNNs trained with random labels and the ones trained with true labels? Our paper answers this question with two contributions. First, we study the memorization properties of DNNs. O…

2019-11-21abs ↗pdf ↗

Efficiently learns from partial labels using variational inference.

problem Learning from noisy and ambiguous partial labels in crowdsourcing.
method Amortized variational inference for probabilistic posterior approximation.
result Achieves state-of-the-art performance in accuracy and efficiency.

We consider an active learning setting where the algorithm has access to a large pool of unlabeled data and a small pool of labeled data. In each iteration, the algorithm chooses few unlabeled data points and obtains their labels from an oracle. In this paper, we consider a probabilistic querying procedure to choose th…

2019-10-10abs ↗pdf ↗

The unprecedented demand for large amount of data has catalyzed the trend of combining human insights with machine learning techniques, which facilitate the use of crowdsourcing to enlist label information both effectively and efficiently. The classic work on crowdsourcing mainly focuses on the label inference problem …

2018-06-23abs ↗pdf ↗

The performance of a machine learning system is usually evaluated by using i.i.d.\ observations with true labels. However, acquiring ground truth labels is expensive, while obtaining unlabeled samples may be cheaper. Stratified sampling can be beneficial in such settings and can reduce the number of true labels require…

2019-06-26abs ↗pdf ↗

Noisy labeled data is more a norm than a rarity for crowd sourced contents. It is effective to distill noise and infer correct labels through aggregation results from crowd workers. To ensure the time relevance and overcome slow responses of workers, online label aggregation is increasingly requested, calling for solut…

2018-07-19abs ↗pdf ↗

In many applications of classifier learning, training data suffers from label noise. Deep networks are learned using huge training data where the problem of noisy labels is particularly relevant. The current techniques proposed for learning deep networks under label noise focus on modifying the network architecture and…

2017-12-27abs ↗pdf ↗

The paper studies how to use AI-generated labels in econometrics to avoid bias.

problem Small misclassification errors in AI-generated labels can lead to large biases in econometric estimators.
method The paper proposes a coupled-label bootstrap method to correct bias and deliver valid inference.
result The coupled-label bootstrap method is valid without the strong independence condition between true and imputed labels.

In most classification tasks there are observations that are ambiguous and therefore difficult to correctly label. Set-valued classifiers output sets of plausible labels rather than a single label, thereby giving a more appropriate and informative treatment to the labeling of ambiguous instances. We introduce a framewo…

2016-09-02abs ↗pdf ↗

New methods protect privacy while providing accurate prediction sets.

problem Privacy-preserving conformal prediction for untrusted aggregators.
method Two LDP approaches: k-ary randomized response and binary search response.
result Finite-sample coverage guarantees and robust coverage under randomization.

Most classifiers operate by selecting the maximum of an estimate of the conditional distribution p(yx)p(y|x) where xx stands for the features of the instance to be classified and yy denotes its label. This often results in a {\em hubristic bias}: overconfidence in the assignment of a definite label. Usually, the observa…

2018-05-24abs ↗pdf ↗

Deep neural networks (DNNs) trained on large-scale datasets have exhibited significant performance in image classification. Many large-scale datasets are collected from websites, however they tend to contain inaccurate labels that are termed as noisy labels. Training on such noisy labeled datasets causes performance de…

2018-03-30abs ↗pdf ↗

Learning with Label Proportions (LLP) is the problem of recovering the underlying true labels given a dataset when the data is presented in the form of bags. This paradigm is particularly suitable in contexts where providing individual labels is expensive and label aggregates are more easily obtained. In the healthcare…

2018-10-24abs ↗pdf ↗

Study assesses weakly-supervised methods for rare outcomes in medical records.

problem Identifying patients with specific medical conditions using electronic health records.
method Compared three methods (PheNorm, MAP, and sureLDA) in simulations with varying outcomes and silver labels.
result No single method consistently outperformed others, but sureLDA often did well.

We consider the problem of improving fairness when one lacks access to a dataset labeled with protected groups, making it difficult to take advantage of strategies that can improve fairness but require protected group labels, either at training or runtime. To address this, we investigate improving fairness metrics for …

2018-06-28abs ↗pdf ↗

We consider the problem of community detection or clustering in the labeled Stochastic Block Model (LSBM) with a finite number KK of clusters of sizes linearly growing with the global population of items nn. Every pair of items is labeled independently at random, and label \ell appears with probability $p(i,j,\ell)…

2015-10-20abs ↗pdf ↗

Generative Augmented Inference improves AI-generated data for causal inference.

problem Challenges in using AI-generated annotations for reliable causal inference.
method Generative Augmented Inference (GAI) treats AI outputs as informative features for learning true labels, flexibly modeling the relationship using nonparametric methods.
result GAI significantly reduces estimation error and improves confidence interval quality compared to human-only and PPI-based methods.

UREs lead to overfitting in complex models, especially in complementary label learning.

problem Overfitting in weakly supervised learning with complementary labels.
method Proposed a surrogate complementary loss (SCL) framework to reduce gradient variance.
result SCL mitigates overfitting and improves URE-based methods.

Instance- and Label-dependent label Noise (ILN) widely exists in real-world datasets but has been rarely studied. In this paper, we focus on Bounded Instance- and Label-dependent label Noise (BILN), a particular case of ILN where the label noise rates -- the probabilities that the true labels of examples flip into the …

2017-09-12abs ↗pdf ↗

Partial label learning (PLL) aims to solve the problem where each training instance is associated with a set of candidate labels, one of which is the correct label. Most PLL algorithms try to disambiguate the candidate label set, by either simply treating each candidate label equally or iteratively identifying the true…

2018-04-20abs ↗pdf ↗

Paper bridges ordinary-label and complementary-label learning frameworks.

problem Combining complementary-label learning with ordinary-label learning.
method Integrates loss functions for one-versus-all and pairwise classification.
result Derives classification risk and error bound for additivity and duality loss functions.

Debiased contrastive learning improves representation learning by correcting for same-label sampling.

problem Sampling negative examples from truly different labels improves performance in self-supervised representation learning.
method Developed a debiased contrastive objective that corrects for the sampling of same-label datapoints without true labels.
result The proposed debiased contrastive objective consistently outperforms state-of-the-art methods across vision, language, and reinforcement learning benchmarks.

Paper proposes a cost-sensitive conformal training method with provably controllable learning bounds.

problem Uncertainty quantification and learning bounds in conformal prediction.
method Cost-sensitive conformal training algorithm that minimizes the expected size of prediction sets using rank weighting.
result Theoretical analysis shows tightness between weighted objective and expected size of conformal prediction sets.

A new method predicts true classes from positive and unlabeled data with additional labeled observations.

problem Predicting true classes from positive and unlabeled data with selection bias.
method Introduces augmented PU prediction, allowing feature-dependent labeling, and compares various empirical Bayes rules.
result The variational autoencoder-based method performs similarly or better than other methods and improves accuracy for unlabeled samples.

The ability of learning from noisy labels is very useful in many visual recognition tasks, as a vast amount of data with noisy labels are relatively easy to obtain. Traditionally, the label noises have been treated as statistical outliers, and approaches such as importance re-weighting and bootstrap have been proposed …

2017-03-07abs ↗pdf ↗

Develops methods to measure and reduce fairness in datasets with limited protected attribute labels.

problem Measuring and reducing fairness in datasets with limited protected attribute labels.
method Proposes methods to estimate fairness metrics and train models to limit fairness violations using probabilistic protected attribute labels.
result Our methods provide tighter bounds on true disparity and effectively reduce fairness violations with lesser fairness-accuracy trade-offs.