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

1122 · Oct 201919922001200920172026
39 results for label-efficient

New algorithms reduce label collection for online prediction with expert advice.

problem Efficiently predicting binary sequences with expert advice using fewer labels.
method Adaptive selective sampling for exponentially weighted forecasters.
result Label complexity scales roughly as the square root of the number of rounds for a scenario with a strictly better expert.

We study how to adapt to smoothly-varying ('easy') environments in well-known online learning problems where acquiring information is expensive. For the problem of label efficient prediction, which is a budgeted version of prediction with expert advice, we present an online algorithm whose regret depends optimally on t…

2019-10-19abs ↗pdf ↗

This paper tackles label-efficient evaluation in extreme class imbalance.

problem Challenges in obtaining a sufficient sample for accurate evaluation in tasks with extreme class imbalance.
method Develops a framework for online evaluation based on adaptive importance sampling.
result Establishes strong consistency and a central limit theorem for performance estimates.

Graph-based methods have been demonstrated as one of the most effective approaches for semi-supervised learning, as they can exploit the connectivity patterns between labeled and unlabeled data samples to improve learning performance. However, existing graph-based methods either are limited in their ability to jointly …

2019-01-28abs ↗pdf ↗

WiGS improves active learning for regression by dynamically selecting informative samples.

problem Reducing labeling costs in regression tasks.
method Formulated as a reinforcement learning problem, WiGS adapts the exploration-investigation balance.
result WiGS outperforms static methods in accuracy and labeling efficiency, especially in irregular data density.

Active testing for large language models is made more efficient and accurate.

problem Efficient evaluation of large language models with limited labels.
method Cost-saving measures and in-context learning for constructing a surrogate model.
result Significantly more accurate evaluations of LLM performance compared to random data acquisition.

Recent advances in machine learning have led to increased deployment of black-box classifiers across a wide variety of applications. In many such situations there is a critical need to both reliably assess the performance of these pre-trained models and to perform this assessment in a label-efficient manner (given that…

2020-02-16abs ↗pdf ↗

RKD improves clustering in semi-supervised learning with limited labels.

problem Improving clustering accuracy in semi-supervised learning with few labeled examples.
method RKD as spectral clustering on a teacher model's graph, with clustering error quantification.
result RKD provably leads to low clustering error in semi-supervised classification problems.

In critical applications of anomaly detection including computer security and fraud prevention, the anomaly detector must be configurable by the analyst to minimize the effort on false positives. One important way to configure the anomaly detector is by providing true labels for a few instances. We study the problem of…

2018-09-17abs ↗pdf ↗

Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number MM out of NN experts. This setting is especially interesting when asking for advice of ever…

2013-04-12abs ↗pdf ↗

In this work, we propose a novel framework for the labeling of entity alignments in knowledge graph datasets. Different strategies to select informative instances for the human labeler build the core of our framework. We illustrate how the labeling of entity alignments is different from assigning class labels to single…

2020-01-24abs ↗pdf ↗

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 study active learning of homogeneous ss-sparse halfspaces in Rd\mathbb{R}^d under the setting where the unlabeled data distribution is isotropic log-concave and each label is flipped with probability at most ηη for a parameter η[0,12)η\in \big[0, \frac12\big), known as the bounded noise. Even in the presence of mild la…

2020-02-12abs ↗pdf ↗

We study how to effectively leverage expert feedback to learn sequential decision-making policies. We focus on problems with sparse rewards and long time horizons, which typically pose significant challenges in reinforcement learning. We propose an algorithmic framework, called hierarchical guidance, that leverages the…

2018-03-01abs ↗pdf ↗

Study efficient active learning for halfspaces with Tsybakov noise using non-convex optimization.

problem Efficiently learn halfspaces with Tsybakov noise under structured unlabeled data.
method Non-convex optimization approach to find approximate first-order stationary points.
result Designs an algorithm with improved label complexity compared to previous methods.

Counterfactual learning from observational data involves learning a classifier on an entire population based on data that is observed conditioned on a selection policy. This work considers this problem in an active setting, where the learner additionally has access to unlabeled examples and can choose to get a subset o…

2019-05-29abs ↗pdf ↗

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.

CBDA improves active learning for semantic segmentation, especially with imbalanced classes.

problem Class imbalance degrades performance in domain adaptive active learning.
method Class Balanced Dynamic Acquisition (CBDA) selects more balanced labels for active learning.
result CBDA increases minority class performance and outperforms baselines by 0.6-2.4 mIoU.

BioBO optimizes gene perturbation design using Bayesian optimization with biological priors.

problem Efficient design of genomic perturbation experiments in drug discovery.
method Integrates Bayesian optimization with multimodal gene embeddings and enrichment analysis.
result Improves labeling efficiency by 25-40% and identifies top-performing perturbations more effectively.

Active learning aims to develop label-efficient algorithms by sampling the most representative queries to be labeled by an oracle. We describe a pool-based semi-supervised active learning algorithm that implicitly learns this sampling mechanism in an adversarial manner. Unlike conventional active learning algorithms, o…

2019-03-31abs ↗pdf ↗

PULSE learns representations from physiological time series.

problem Lack of effective pretraining objectives for physiological time series.
method Proposes a pretraining framework exploiting dynamical systems generative model.
result PULSE learns representations that distinguish semantic classes and improve transfer learning.

The paper explains how data augmentation improves semi-supervised learning efficiency.

problem Improving accuracy from a small fraction of labeled data.
method Data augmentation induces a similarity graph, which is graph-Laplacian-regularized for downstream learning.
result A fast transductive rate of O(1/nL)O(1/n_L) is achieved, reducing the number of labels needed.

Unified query framework for active metric learning and classification.

problem Combining representation learning and task-specific goals in machine learning.
method Adaptive selection of nearest neighbor queries using information theoretic criterion.
result Actively selected nearest neighbor queries outperform recent methods in deep metric learning and classification.

Big models pretrain and fine-tune for semi-supervised learning on ImageNet.

problem Learning from few labeled examples with a large amount of unlabeled data.
method Unsupervised pretraining of a big ResNet model followed by supervised fine-tuning and distillation.
result 73.9% ImageNet top-1 accuracy with just 1% of labels (\le13 labeled images per class).

TRACE analyzes risk changes in models trained on shifted data.

problem Understanding performance changes when a model trained on shifted data is used.
method TRACE framework decomposes risk change into four factors: generalization gaps, model change penalty, and covariate shift penalty.
result TRACE provides a diagnostic tool to understand and quantify risk changes due to covariate shift.

Self-supervised learning improves ECG classification performance.

problem Label scarcity in clinical 12-lead ECG data.
method Adapted self-supervised methods to ECG domain, focusing on contrastive representations and latent forecasting.
result Contrastive predictive coding adaptation yields linear evaluation performance only 0.5% below supervised performance.

Study online learning with delays and capacity constraints, achieving optimal regret bounds.

problem Online learning with delays and capacity constraints.
method Novel scheduling and preemptive techniques, matching upper and lower bounds.
result Achieves optimal regret bounds across all capacity levels.