The field of few-shot learning has been laboriously explored in the supervised setting, where per-class labels are available. On the other hand, the unsupervised few-shot learning setting, where no labels of any kind are required, has seen little investigation. We propose a method, named Assume, Augment and Learn or AA…
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,742 papers · 148 categories
Trend · papers per month
48 results for “few labeled data”
Few-shot classification (FSC) is challenging due to the scarcity of labeled training data (e.g. only one labeled data point per class). Meta-learning has shown to achieve promising results by learning to initialize a classification model for FSC. In this paper we propose a novel semi-supervised meta-learning method cal…
A method to improve few-shot learning using continual local replacement and pseudo labeling.
problem Learning novel classes with limited data.
method Sophisticated network architecture for feature representation and continual local replacement strategy.
result Significantly improved generalization and better decision boundary for classification.
We consider the problem of semi-supervised few-shot classification where a classifier needs to adapt to new tasks using a few labeled examples and (potentially many) unlabeled examples. We propose a clustering approach to the problem. The features extracted with Prototypical Networks are clustered using -means with …
The successful application of deep learning to many visual recognition tasks relies heavily on the availability of a large amount of labeled data which is usually expensive to obtain. The few-shot learning problem has attracted increasing attention from researchers for building a robust model upon only a few labeled sa…
Adaptive-Step Graph Meta-Learner tackles few-shot graph classification with limited labeled data.
problem Few labeled graph data in bioinformatics and other applications.
method A novel framework combining a graph meta-learner and a step controller for robust and generalization.
result State-of-the-art results on several few-shot graph classification tasks.
Paper proposes Meta Label Learning to infer global labels for robust few-shot models.
problem Few-shot learning with limited training data.
method Meta Label Learning (MeLa) framework that infers global labels.
result MeLa framework is competitive with existing methods and robust for few-shot learning.
Graph neural networks (GNNs) are designed for semi-supervised node classification on graphs where only a subset of nodes have class labels. However, under extreme cases when very few labels are available (e.g., 1 labeled node per class), GNNs suffer from severe performance degradation. Specifically, we observe that exi…
Classifiers for the semi-supervised setting often combine strong supervised models with additional learning objectives to make use of unlabeled data. This results in powerful though very complex models that are hard to train and that demand additional labels for optimal parameter tuning, which are often not given when …
Regression for the Mean: Auto-Evaluation and Inference with Few Labels through Post-hoc Regressioncs.LG
New methods improve inference with scarce labels using regression.
problem Efficient inference with limited labeled data.
method Relates PPI++ to ordinary least squares regression and uses robust regressors.
result Improved variance in estimators for few-label scenarios.
Paper tackles cross-granularity few-shot learning with meta-embedder.
problem Few-shot learning with coarse labels and fine-grained testing.
method Meta-embedder that optimizes visual and semantic discrimination across coarse and fine classes.
result Meta-embedder achieves effective cross-granularity few-shot classification.
The paper proposes methods to predict classifier generalization with few labeled samples.
problem Measuring classifier generalization with limited labeled data.
method Analysis of generalization variability, transfer-based solutions in supervised, semi-supervised, and unsupervised settings.
result Simple measures correlate with classifier generalization and can predict it with confidence.
A variety of machine learning applications expect to achieve rapid learning from a limited number of labeled data. However, the success of most current models is the result of heavy training on big data. Meta-learning addresses this problem by extracting common knowledge across different tasks that can be quickly adapt…
Proposes a strategy to train models with minimal labeled data.
problem Scarce and expensive labeled data for medical tasks.
method Recursive training strategy to use image-level annotations for pixel-level segmentation.
result Improved segmentation of intracranial hemorrhage in CT scans.
Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embeddingcs.LG
MetaTNE tackles few-shot novel labels in graphs, improving node classification.
problem Node classification on graphs with novel labels and limited training data.
method MetaTNE framework with structural, meta-learning, and optimization modules.
result MetaTNE significantly improves node classification over state-of-the-art methods.
TAMA uses LMMs to detect and interpret anomalies in time series data with few labels.
problem Challenges in manual feature engineering and extensive labeled training data for TSAD.
method Leverages LMMs to convert time series into visual formats for few-shot in-context learning.
result Consistently outperforms state-of-the-art methods in TSAD tasks.
New method improves few-shot learning with noisy labels.
problem Robustness to label noise in few-shot learning.
method Feature aggregation and Transformer model for noisy samples.
result TraNFS outperforms other methods in noisy conditions.
Historical documents present many challenges for offline handwriting recognition systems, among them, the segmentation and labeling steps. Carefully annotated textlines are needed to train an HTR system. In some scenarios, transcripts are only available at the paragraph level with no text-line information. In this work…
Paper explains why small-loss criterion works for learning from noisy labels.
problem Learning from noisy labels in deep learning with limited labeled data.
method Theoretical analysis and reformulation of the small-loss criterion.
result Theoretical explanation and reformulation of the small-loss criterion.
A framework for using auxiliary data to improve few-shot learning.
problem Few-shot learning with scarce labeled examples and abundant auxiliary data.
method Automatic pseudo-shot selection and masking module to adjust auxiliary features.
result Masking module improves accuracy by 4.68 and 6.03 percentage points.
Study evaluates graph-based semi-supervised learning under noisy label conditions.
problem Evaluation of semi-supervised learning algorithms under noisy label conditions.
method Compared graph-based semi-supervised algorithms under varying labeled data and label noise conditions.
result Laplacian Eigenmaps performed better than label propagation under noisy conditions.
Orion-Bix combines biaxial attention and meta-learning for tabular few-shot learning.
problem Scaling and generalizing tabular models with mixed numeric and categorical fields, weak feature structure, and limited labeled data.
method Orion-Bix uses biaxial attention and meta-learned in-context reasoning to efficiently capture local and global dependencies.
result Orion-Bix outperforms gradient-boosting baselines and state-of-the-art tabular models on public benchmarks.
New method transfers causal mechanisms for few-shot domain adaptation.
problem Few labeled target domain data for regression problems.
method Mechanism transfer using structural equations in causal modeling.
result Method can adapt from apparently different distributions.
LLM embeddings improve adaptation to tabular -shifts with few labeled examples.
problem Improving robustness to -shifts in tabular data.
method Serializing tabular data to LLM embeddings and fine-tuning for adaptation.
result LLM embeddings can be adapted to target domains with minimal labeled data.
Task-adaptive clustering improves few-shot learning with unlabeled data.
problem Handling unseen tasks with limited labeled data.
method Task-conditioned clustering in a new projection space.
result State-of-the-art semi-supervised few-shot classification performance.
Less-than-one-shot learning tackles few-shot learning with minimal data.
problem Training models on very small datasets while maintaining accuracy.
method Soft-label k-Nearest Neighbors classifier and theoretical lower bounds analysis.
result Achieving learning of multiple classes with fewer than the required samples.
While semi-supervised learning (SSL) algorithms provide an efficient way to make use of both labelled and unlabelled data, they generally struggle when the number of annotated samples is very small. In this work, we consider the problem of SSL multi-class classification with very few labelled instances. We introduce tw…
The goal of few-shot learning is to learn a classifier that generalizes well even when trained with a limited number of training instances per class. The recently introduced meta-learning approaches tackle this problem by learning a generic classifier across a large number of multiclass classification tasks and general…
Biomedical text tagging systems are plagued by the dearth of labeled training data. There have been recent attempts at using pre-trained encoders to deal with this issue. Pre-trained encoder provides representation of the input text which is then fed to task-specific layers for classification. The entire network is fin…
Accurate image classification given small amounts of labelled data (few-shot classification) remains an open problem in computer vision. In this work we examine how the known texture bias of Convolutional Neural Networks (CNNs) affects few-shot classification performance. Although texture bias can help in standard imag…
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.
Recent progress has shown that few-shot learning can be improved with access to unlabelled data, known as semi-supervised few-shot learning(SS-FSL). We introduce an SS-FSL approach, dubbed as Prototypical Random Walk Networks(PRWN), built on top of Prototypical Networks (PN). We develop a random walk semi-supervised lo…
A novel semi-supervised outlier detection model detects anomalies with few labels.
problem Efficiently detecting group anomalies with limited labeled data.
method RCC-Dual-GAN model that combines RCC and M-GAN components for semi-supervised outlier detection.
result Significantly improved accuracy in outlier detection with few labeled anomalies.
Disease phenotyping algorithms process observational clinical data to identify patients with specific diseases. Supervised phenotyping methods require significant quantities of expert-labeled data, while unsupervised methods may learn non-disease phenotypes. To address these limitations, we propose the Semi-Supervised …
Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labelscs.LG
Graph Convolutional Networks(GCNs) play a crucial role in graph learning tasks, however, learning graph embedding with few supervised signals is still a difficult problem. In this paper, we propose a novel training algorithm for Graph Convolutional Network, called Multi-Stage Self-Supervised(M3S) Training Algorithm, co…
Unified model for sequence labeling and classification.
problem Efficiently perform multiple sequence labeling tasks.
method Generative framework with shared natural language output space.
result Significant improvements in few-shot and low-resource slot labeling.
Improved few-shot learning with lower-level neural network embeddings.
problem Limited data scenarios in few-shot learning.
method Graph-based meta-learning framework using hidden layer feature embeddings.
result Utilization of lower-level neural network embeddings improves classifier accuracy.
Few-shot graph classification on graphs with limited labeled examples.
problem Limited labeled data for graph classification.
method Graph spectral measures to cluster graphs into super-classes, then use GNNs.
result Improved classification performance on few-shot graph classification tasks.
Graph-based Bayesian SSL uses graph theory to propagate labels from a few to many unlabeled features.
problem Efficiently propagating labels from a small set of labeled data to a large set of unlabeled data.
method Probabilistic framework using graph theory and Bayesian statistics.
result Mathematical foundations for improving the accuracy and efficiency of label propagation.
Unified framework explains few-shot multimodal medical imaging performance.
problem Limited labeled data in rare diseases and low-resource settings.
method PAC learning, VC theory, PAC Bayesian analysis, information gain, Chain of Thought reasoning.
result Unified theoretical framework for few-shot multimodal medical imaging.
This paper proposes new methods for ALR that consider informativeness, representativeness, and diversity.
problem Efficiently label samples for regression models with limited labeled data.
method Integrates informativeness, representativeness, and diversity in pool-based sequential active learning.
result Demonstrates effectiveness of new ALR approaches on 12 datasets.
Meta-learning improves few-shot acoustic event detection.
problem Detecting new audio events with limited labeled data.
method Formulated few-shot AED problem; explored supervised and meta-learning approaches.
result Meta-learning achieves superior performance in few-shot AED.
New method reduces labeling costs in semi-supervised learning.
problem Efficiently label data with limited labeled samples.
method Formulates batch acquisition as bilevel optimization.
result Shows effectiveness in keyword detection tasks.
This paper tackles unsupervised AL for linear regression.
problem Optimally selecting samples to label from unlabeled data.
method Proposes a novel unsupervised pool-based AL approach considering informativeness, representativeness, and diversity.
result Demonstrated effectiveness on 14 datasets using three different linear regression models.
We propose a framework that learns a representation transferable across different domains and tasks in a label efficient manner. Our approach battles domain shift with a domain adversarial loss, and generalizes the embedding to novel task using a metric learning-based approach. Our model is simultaneously optimized on …
Novel bounds for deep MDA algorithms improve performance and efficiency.
problem Improving performance of MDA algorithms with few target labels and pseudo labels.
method Information-theoretic tools and novel deep MDA algorithm.
result Algorithm-dependent generalization bounds for MDA.
In many applications the process of generating label information is expensive and time consuming. We present a new method that combines active and semi-supervised deep learning to achieve high generalization performance from a deep convolutional neural network with as few known labels as possible. In a setting where a …
Meta-learning improves anomaly detection with few labeled instances.
problem High requirement of training data for neural network-based anomaly detection.
method Meta-learning framework with one-class classification and generalized eigenvalue problem.
result Meta-learning method achieves better performance than existing methods on various datasets.