Weak labels can significantly speed up learning for strong tasks.
problem Learning with limited strong labels.
method Using weak labels to accelerate learning of strong tasks.
result Weak labels can accelerate learning to rate.
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.
169,341 papers · 148 categories
Trend · papers per month
48 results for “weak labeler”
Active learning with weak and strong labelers reduces label queries.
problem Learning from weak and strong labelers with low error.
method Active learning algorithm for weak and strong labelers, statistical consistency, label complexity analysis.
result Reduces label queries compared to using strong labelers alone.
Subset selection improves weak supervision performance.
problem Optimizing the use of weakly-labeled data.
method Combining pretrained data representations with the cut statistic for subset selection.
result Subset selection improves weak supervision performance by up to 19%.
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.
Active WeaSuL uses active learning to improve weak supervision for better model performance.
problem Limited labelled data in machine learning.
method Combines active learning with weak supervision to improve probabilistic labels.
result Active WeaSuL outperforms weak supervision and active learning with limited labelled data.
New research shows label refinement and weak training have limitations for aligning LLMs.
problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.
A new method for weakly supervised learning that improves model accuracy.
problem Training machine learning models with precise labels is expensive; weak supervision provides a low-cost alternative.
method Data consistent weak supervision algorithm that searches over classifiers to find plausible labelings, considering features of the training data and estimating labels for low/no coverage data.
result Empirically, the method significantly outperforms state-of-the-art weak supervision methods on text and image classification tasks.
Proposes a constrained labeling method for weakly supervised learning.
problem Combining weak supervision signals while navigating misleading correlations.
method Randomized constrained labeling within a defined space.
result Randomized constrained labeling converges after few iterations and outperforms other methods.
Boosting weak learners to strong ones from aggregate labels is possible for LLP but not for MIL.
problem Boosting weak learners to strong ones from aggregate labels in learning from label proportions (LLP).
method Using a weak learner on large enough bags to obtain a strong learner for small bags in polynomial time.
result Boosting is possible for LLP but not for MIL.
Expands weak supervision by allowing partial labels from multiple noisy sources.
problem Creating models without labeled data using heuristic labelers.
method Probabilistic generative model estimating partial label accuracies.
result Improved model accuracy on various tasks (8.6% on text, comparable to zero-shot methods on images).
Method trains classifiers without labels using adversarial constraints.
problem Training classifiers without labeled data.
method Adversarial label learning method that trains classifiers to perform well against an adversary choosing labels.
result Method outperforms other weakly supervised learning approaches on real datasets.
ASTRA uses unlabeled data and weak rules to train deep models effectively.
problem Learning with weak supervision rules is challenging due to their heuristic and noisy nature.
method ASTRA framework that considers contextualized representations and pseudo-labels for unlabeled data, and a rule attention network to aggregate labels.
result Significant improvements over state-of-the-art baselines on text classification benchmarks.
New method separates sounds with weak labels in noisy environments.
problem Training audio source separation systems with limited labeled data.
method Proposes objective functions and network architectures for weakly labeled training.
result Achieves significant SI-SDR improvement in noisy scenarios.
New framework for learning from various weak supervision types.
problem Scarcity of labeled data in real-world problems.
method Probabilistic framework based on maximum likelihood principle for deep neural networks.
result General method for learning from noisy labels, complementary labels, and coarse-grained labels.
Combines foundation models with weak supervision to improve NLP and video tasks.
problem Leveraging weak supervision with foundation models without labeled data.
method Liger, a combination of foundation model embeddings and weak supervision techniques.
result Liger outperforms existing weak supervision methods by 14.1 points on benchmark NLP and video tasks.
Generative models enhance weak supervision for better image classification.
problem Lack of labeled data in supervised learning.
method Fusion of generative adversarial networks and weak supervision.
result Model improves multiclass image classification performance.
Improves label propagation for weakly supervised learning.
problem Reducing the need for labeled data in machine learning.
method Label Propagation with Weak Supervision (LPA) analysis.
result Demonstrated improvements over existing methods on weakly supervised classification tasks.
Framework for training complex models using weak, noisy labels from multiple tasks.
problem Training complex models with limited labeled data.
method Multi-task weak supervision framework, solving matrix completion problem to recover task accuracies.
result Significant accuracy gains (20.2 points) over traditional supervised methods.
Aims to improve neural network training with weak labels by weighting updates based on a confidence network.
problem Training deep neural networks with limited labeled data.
method Proposes a two-network approach: a target network trained on weak labels and a confidence network trained on true labels to inform the target network about label quality.
result Improves model performance and speeds up learning from weak labels.
Dugong models multi-resolution weak supervision for sequential data.
problem Estimating unknown accuracies and correlations of weak supervision sources for sequential data.
method Dugong, a framework that models multi-resolution weak supervision sources with complex correlations, using parameter sharing to improve sample complexity.
result Dugong outperforms traditional supervision by 36.8 F1 points on clinician-validated labels for biomedical video repositories.
Unified approach for learning with weak labels across various tasks.
problem Learning with noisy or incomplete labels in diverse machine learning settings.
method Implicit posterior models for joint label inference.
result Unified training objective for various machine learning tasks.
New method estimates model performance bounds without ground truth labels.
problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.
PLRM synthesizes labels from mismatched sources for better training sets.
problem Creating labeled training sets is a major challenge in machine learning.
method PLRM uses probabilistic modeling to synthesize labels from indirect supervision sources with different output spaces.
result PLRM outperforms baselines by 2%-9% on various tasks.
Online boosting algorithms improve multi-label ranking accuracy.
problem Improving multi-label ranking accuracy through online boosting.
method Design and analysis of online boosting algorithms with provable loss bounds.
result Our adaptive algorithm achieves comparable performance to existing batch boosting methods without requiring knowledge of weak learner edges.
End-to-end approach for weak supervision improves downstream model performance.
problem Data-labeling bottleneck in machine learning applications.
method Directly learning the downstream model by maximizing its agreement with probabilistic labels generated from weak supervision sources.
result Improved performance over prior work in terms of downstream model performance and robustness.
Method trains neural networks with weak labels using a small set of true labels.
problem Training neural networks with limited true labels and noisy weak labels.
method Two neural networks: target and confidence. Meta-learner adjusts target network's updates.
result Avoids harm from noisy labels, improving target network's performance.
Paper analyzes weak-to-strong generalization in CNNs, identifying data-scarce and data-abundant regimes.
problem Weak-to-strong generalization in CNNs trained on weak models.
method Formal analysis of gradient descent dynamics in data-scarce and data-abundant regimes.
result Identifies two regimes and distinct mechanisms of generalization in each.
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 scores.
Paper develops proper, lower-bounded losses for weakly supervised classification.
problem Weakly supervised classification with corrupted labels.
method Representation theorem for proper losses, derived condition for lower-boundedness, generalized logit squeezing.
result Proper and lower-bounded losses for weak-label learning.
Unified approach for multicalibration in weakly supervised learning.
problem Existing multicalibration methods require clean input-label pairs, which are unavailable in weakly supervised learning.
method Developed estimators and post-hoc correction methods for multicalibration under weak supervision.
result Unified framework for estimating and correcting multicalibration under weak supervision with finite-sample guarantees.
Paper proposes a new model using consistency regularization for learning from label proportions.
problem Learning from label proportions with weak labels on bags of instances.
method Consistency regularization applied to semi-supervised learning.
result LLP with consistency regularization achieves superior performance.
Paper proposes an algorithm to recover full supervision from weakly labeled data.
problem Machine learning requires expensive data annotation, motivating the use of weak supervision.
method The paper introduces a disambiguation principle and an empirical disambiguation algorithm for partial labelling.
result The algorithm achieves exponential convergence rates under learnability assumptions.
New method learns dependencies for weak supervision models, improving accuracy.
problem Estimating dependencies among noisy labels for weak supervision models.
method Robust PCA-based algorithm for dependency structure learning.
result Improved theoretical recovery rates and outperforms existing methods.
Mitigates bias in weakly supervised datasets.
problem Bias in weakly supervised datasets.
method Proposes a counterfactual fairness-based technique to mitigate bias.
result Improves accuracy by up to 32% while reducing demographic parity gap by 82.5%.
WeLa-VAE learns interpretable disentangled representations with weak supervision.
problem Learning disentangled representations without strong supervision.
method Variational inference framework with shared latent variables and modified variational lower bound.
result WeLa-VAE learns alternative disentangled representations (polar) from weak labels (distance and angle) without refined supervision.
FABLE incorporates instance features into PWS label models for improved performance.
problem Lack of instance features in existing label models limits their performance.
method FABLE uses a mixture of Bayesian label models and a Gaussian Process classifier to incorporate instance features.
result FABLE achieves the highest averaged performance across nine baselines on benchmark datasets.
Inspector Gadget uses crowdsourcing and data programming to label industrial images efficiently.
problem Securing enough labeled data for machine learning in industrial settings.
method Combines crowdsourcing, data augmentation, and data programming.
result Obtains better performance than other weak-labeling techniques.
Interactive weak supervision learns useful heuristics from user feedback.
problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.
AutoWS-Bench-101 evaluates automated weak supervision methods for diverse domains.
problem Limited applicability of weak supervision due to difficulty in designing labeling functions.
method Automates labeling function design using a small set of ground truth labels.
result AutoWS methods often require foundation models to outperform simple few-shot baselines.
WRENCH benchmarks weak supervision datasets for machine learning.
problem Lack of standardized evaluation for weak supervision datasets.
method Developed a comprehensive benchmark platform WRENCH.
result Demonstrated the efficacy of WRENCH as a benchmark platform.
Stoch-GALL learns from noisy labels to improve model performance.
problem Training machine learning models with limited labeled data.
method Stochastic generalized adversarial label learning framework.
result Stoch-GALL outperforms weakly supervised learning methods in noisy label settings.
Paper tackles brain tumor segmentation using weak labels and hierarchical training.
problem High manual labeling effort for fully supervised brain tumor segmentation.
method Uses scribbles and global labels for weak supervision, trains two networks in phases.
result Achieves competitive results on brain tumor segmentation and substructure segmentation.
Improved multi-class AdaBoost algorithm with stronger weak learnability condition.
problem Multi-class classification problem with at least two labels.
method Recursive ensemble algorithm inspired by SAMME, strengthening weak learnability condition.
result Final hypothesis converges to correct label with probability 1 and generalization error bounds exponentially.
New method uses weak labels to create valid confidence sets for predictions.
problem Lack of labeled data in machine learning models.
method Developed a conformal prediction framework to provide valid predictive confidence sets using weakly labeled data.
result New coverage definition allows for tighter and more informative (but valid) confidence sets.
New methods lift weak supervision to structured prediction, providing robustness guarantees.
problem Applying weak supervision techniques to structured prediction problems.
method Introducing pseudo-Euclidean embeddings, tensor decompositions, and invariants for consistent noise rate estimation.
result Generalization guarantees nearly identical to those for models trained on clean data.
Random feature models can outperform a weak teacher with early stopping.
problem Generalization from a weak to a strong model in random feature networks.
method Random feature models, early stopping, proving weak-to-strong generalization.
result Random feature models can outperform a weak teacher with early stopping.
Improved machine learning models outperform their simpler counterparts by using imperfect labels.
problem Improving model performance using imperfect labels.
method Random feature ridge regression (RFRR) with a deterministic equivalent for excess test error.
result The student model can outperform the teacher model regardless of the teacher's scaling law, achieving the minimax optimal rate.
A Weak Supervision Approach to Detecting Visual Anomalies for Automated Testing of Graphics Unitscs.LG
Automated graphics testing detects novel corruptions without manual labeling.
problem Detecting novel visual corruptions in graphics unit testing without manual labeling.
method Reproduces driver bugs to generate corruptions and uses Multiple Instance Learning (MIL) methods.
result Significantly outperforms unsupervised methods and discovers novel corruptions.