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.

169,051 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.7% · Feb 202119922001200920172026
48 results for Weakly-supervised

Paper tackles ride-sharing user experience enhancement with weakly supervised learning.

problem Compound weakly supervised learning problem in ride-sharing comment data.
method CWSL method with instance reweighting, robust criteria, and alternating optimization.
result Effectiveness validated on Didi ride-sharing comment data.

The scarcity of data annotated at the desired level of granularity is a recurring issue in many applications. Significant amounts of effort have been devoted to developing weakly supervised methods tailored to each individual setting, which are often carefully designed to take advantage of the particular properties of …

2015-09-22abs ↗pdf ↗

As machine learning algorithms become increasingly sophisticated to exploit subtle features of the data, they often become more dependent on simulations. This paper presents a new approach called weakly supervised classification in which class proportions are the only input into the machine learning algorithm. Using on…

2017-02-01abs ↗pdf ↗

Study shows reverberant phase is not essential for weakly-supervised dereverberation.

problem Evaluating the role of reverberant phase in weakly-supervised dereverberation.
method Statistical Wave Field Theory and recent weak supervision framework.
result Wet phase carries limited useful information and is not essential for weakly supervised dereverberation.

ParsNet tackles weakly supervised data streams with a self-evolving deep neural network.

problem Weakly supervised data streams hinder existing data stream algorithms.
method ParsNet uses a self-labelling strategy with hedge (SLASH) and a closed-loop configuration of generative and discriminative training processes.
result ParsNet outperforms other methods in high-dimensional data streams and infinite delay simulations.

Paper tackles weakly supervised learning from similarity-confidence data.

problem Learning binary classifier from unlabeled data pairs with confidence of similarity.
method Proposes an unbiased estimator of classification risk from Sconf data and risk correction scheme.
result Demonstrates effectiveness of proposed methods through experiments.

Paper proposes a method to generate instance labels from weakly supervised data.

problem Weakly supervised instance labeling in medical image analysis.
method Uses multiple instance learning (MIL) and knowledge distillation to generate instance-level predictions.
result Significantly outperforms state-of-the-art MIL methods in instance-level prediction.

Solves weakly supervised regression using low-rank approximations and manifold regularization.

problem Weakly supervised regression with known, unknown, and uncertain labels.
method Combines manifold regularization and low-rank matrix decomposition for optimization.
result Improves solution quality and stability for large datasets.

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.

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.

TrustNet robustly learns noise patterns from trusted data to improve weakly-supervised classification.

problem Robustness to label noise in weakly-supervised learning.
method TrustNet learns noise patterns from trusted data, then trains a robust classifier using these patterns.
result TrustNet outperforms state-of-the-art methods in robustness to various noise patterns.

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.

Novel ramp loss method improves weakly supervised machine translation and parsing.

problem Training neural models without gold labels in weak supervision scenarios.
method Adapted ramp loss objectives to promote positive outputs and discourage negative ones.
result Bipolar ramp loss objectives outperform other methods on weakly supervised tasks.

The paper explores how supervision level affects both statistical accuracy and computational efficiency in weakly supervised binary classification.

problem The impact of label flip probability on statistical and computational efficiency in weakly supervised binary classification.
method Information-theoretic and computational boundaries were established to characterize the relationship between supervision level and performance.
result The gap between statistical and computational boundaries narrows as the supervision level increases, indicating improved computational efficiency with more supervision.

New method reduces false positives in weakly supervised pixel-level localization.

problem Reduces false positives in weakly supervised pixel-level localization.
method Proposes a deep learning method using conditional entropy to constrain the localizer.
result Significant improvements in image-level classification and pixel-level localization.

Neural network models that are not conditioned on class identities were shown to facilitate knowledge transfer between classes and to be well-suited for one-shot learning tasks. Following this motivation, we further explore and establish such models and present a novel neural network architecture for the task of weakly…

2018-01-10abs ↗pdf ↗

Efficiently predicts paths in hierarchical text classification using unlabeled data.

problem Costly labeling of documents in hierarchical text classification.
method Path cost-sensitive learning algorithm using generative model and path constraints.
result Significantly reduces computational cost and improves efficiency.

Enhances mobile context prediction using weakly supervised learning.

problem Power consumption and limited training data for always-on context prediction.
method Weakly supervised learning framework for multi-modal sensing.
result Personalized context prediction model with improved accuracy.

Proposes a differentiable hypergeometric distribution for learning group importance.

problem Learning the sizes of subsets in applications like clustering and weakly-supervised learning.
method Introduces a reparameterizable hypergeometric distribution to model group sizes and learn their relative importance.
result Outperforms previous methods in weakly-supervised learning and clustering.

New framework for weakly supervised learning from label proportions.

problem Lack of consistent learning procedure and theoretical training criterion for LLP.
method Pose LLP as mutual contamination models (MCMs) and establish unbiased losses and generalization error bounds.
result Established novel technical results for MCMs and proposed a new experimental setting.

We consider the task of training classifiers without labels. We propose a weakly supervised method---adversarial label learning---that trains classifiers to perform well against an adversary that chooses labels for training data. The weak supervision constrains what labels the adversary can choose. The method therefore…

2018-05-22abs ↗pdf ↗

Proposes a method for weakly-supervised object localization to improve few-shot learning.

problem Challenges of few-shot learning, especially with fine-grained categories.
method Introduces a Self-Attention Based Complementary Module (SAC Module) for weakly-supervised object localization.
result Significantly outperforms state-of-the-art methods on benchmark datasets, especially for fine-grained few-shot tasks.

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.

This paper introduces a general multi-class approach to weakly supervised classification. Inferring the labels and learning the parameters of the model is usually done jointly through a block-coordinate descent algorithm such as expectation-maximization (EM), which may lead to local minima. To avoid this problem, we pr…

2012-06-27abs ↗pdf ↗

Deep neural networks are gaining increasing popularity for the classic text classification task, due to their strong expressive power and less requirement for feature engineering. Despite such attractiveness, neural text classification models suffer from the lack of training data in many real-world applications. Althou…

2018-09-02abs ↗pdf ↗

Paper proposes unsupervised knowledge graph alignment with adversarial learning.

problem Aligning knowledge graphs from different sources or languages without large amounts of aligned triplets.
method Adversarial learning framework to align entity and relation embeddings, with mutual information regularization.
result Framework effectively aligns knowledge graphs in unsupervised and weakly-supervised settings.

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.

Proposes a method to improve weakly supervised image segmentation using deep geodesic priors.

problem Limited availability of high-quality annotations for image segmentation, especially in medical data.
method Integrates a deep geodesic prior extracted from an auto-encoder to reduce the adverse effects of weak labels in segmentation accuracy.
result The proposed method significantly improves segmentation accuracy, boosting performance by 4.4% in dice score for clean labels and up to 6.3% for noisy labels (L2).

Weak supervision enables learning causal representations from unstructured data.

problem Learning high-level causal representations from unstructured data like images.
method Weakly supervised setting with paired samples before and after interventions. Implicit latent causal models using variational autoencoders.
result Models can reliably identify causal structure and disentangle causal variables.

Paper tackles domain invariant sentiment classification using weak supervision.

problem Learning a sentiment classification model that adapts to any target domain.
method Two-stage training procedure with weakly supervised datasets.
result Transfer learning with weak supervision achieves performance close to supervised training.

Study characterizes and mitigates imbalances in neurosymbolic learning.

problem Characterizing and mitigating class-specific risks in neural classifiers.
method Theoretical analysis and practical techniques including estimating marginal gold labels and mitigating imbalances at training and testing time.
result Learning imbalances can be greatly impacted by the symbolic component σ, unlike in supervised and weakly supervised learning.

Unified framework for N-tuples learning improves weakly supervised tasks.

problem Reducing annotation burden in supervised learning.
method Empirical risk minimization framework integrating pointwise unlabeled data.
result Framework improves generalization across various N-tuples learning tasks.