Learning with few samples is a major challenge for parameter-rich models like deep networks. In contrast, people learn complex new concepts even from very few examples, suggesting that the sample complexity of learning can often be reduced. Many approaches to few-shot learning build on transferring a representation fro…
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 sample learning”
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.
Improved few-shot learning with LSSVM and transductive modules.
problem Few-shot learning with limited data and samples.
method Introducing LSSVM as a base learner and transductive modules to enhance classification accuracy.
result FSLSTM achieves state-of-the-art performance on miniImageNet and CIFAR-FS benchmarks.
Method improves few-shot one-class classification.
problem Learning binary classifier with data from only one class.
method Modified MAML algorithm to learn initialization for few-shot OCC.
result Method leads to better results than classical approaches.
Few-Shot Diffusion Models generate new samples from small image sets.
problem Generating new samples from a few images.
method Conditional Denoising Diffusion Probabilistic Models (DDPM) with patch-based input set information.
result FSDM can generate samples from previously unseen classes conditioned on as few as 5 samples.
FROB model improves robustness and reliable confidence for few-shot OoD detection.
problem Challenges in few-shot classification and OoD detection due to limited samples and adversarial attacks.
method FROB model combines support boundary generation and few-shot Outlier Exposure (OE) for improved robustness and reliable confidence.
result FROB achieves generalization to unseen OoD and maintains robustness independent of few-shot number.
Interpretable neural model for few-shot time-series classification.
problem Few-shot time-series classification challenges.
method Dual Prototypical Shapelet Networks (DPSN) framework.
result DPSN framework outperforms state-of-the-art methods, especially with limited data.
Paper proposes adaptive margin loss to improve few-shot learning.
problem Few-shot learning's difficulty in generalizing from a few examples.
method Develops class-relevant and task-relevant additive margin losses.
result Boosts performance of metric-based meta-learning approaches.
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.
Learning new tasks with few samples using related task evaluations.
problem Learning a new task with limited data and related task evaluations.
method Modeling task relatedness through weak monotonicity and leveraging it in transfer learning and model selection aggregation.
result Pruning the model class based on monotonicity and hedging on the task frontier.
Survey on machine learning from very few samples.
problem Learning and generalizing from very few samples.
method Comprehensive review of 300+ FSL papers.
result Meta learning based FSL approaches are emphasized.
AdarGCN tackles noisy web images in few-shot learning.
problem Few-shot learning with limited training samples from both source and target classes.
method AdarGCN combines LDN for web image denoising and GCN for FSL, using adaptive aggregation.
result AdarGCN outperforms conventional methods in FSFSL and conventional FSL settings.
New research shows CI in few-shot learning is misleading due to sampling with replacement.
problem Misleading confidence intervals in few-shot learning due to sampling with replacement.
method Comparative analysis of CIs computed with and without replacement.
result Significant underestimation of CI by the predominant method.
Training deep neural networks is known to require a large number of training samples. However, in many applications only few training samples are available. In this work, we tackle the issue of training neural networks for classification task when few training samples are available. We attempt to solve this issue by pr…
Paper tackles few-shot class-incremental learning with a neural gas network.
problem Incrementally learn new classes from very few labelled samples without forgetting old classes.
method Proposes TOPIC framework using a neural gas network to preserve class topology and adapt to new samples.
result Significantly outperforms other methods on CIFAR100, miniImageNet, and CUB200 datasets.
A new method for few-shot learning using Laplacian regularization.
problem Few-shot learning with limited labeled data.
method Transductive Laplacian-regularized inference for feature embeddings.
result Our method outperforms state-of-the-art methods across various benchmarks.
A new method for few-sample FS using manifold learning.
problem Few-sample supervised feature selection in high-dimensional spaces.
method Learn feature associations on manifolds, compute composite kernel, and use spectral analysis for FS score.
result Our method outperforms competitors in feature selection and classification accuracy.
Beyond identifiability: Learning causal representations with few environments and finite samplesstat.ML
The paper shows how to learn causal representations with few environments and finite samples.
problem Learning causal representations from limited data and environments.
method Explicit, finite-sample guarantees with a logarithmic number of interventions.
result Consistent recovery of latent causal graph, mixing matrix, and unknown intervention targets.
LogAnMeta detects anomalies from log events using meta learning.
problem Poor performance of current log anomaly detection on new or unseen anomalies.
method Meta-learning-based hybrid few-shot classifier trained in an episodic manner.
result Demonstrates efficacy of LogAnMeta on detecting anomalies with few samples.
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.
Paper develops robust -NN algorithm for few samples.
problem Learning robust classifier from limited samples.
method Distributionally robust formulation of weighted -NN.
result Robust classifier improves generalization with smaller Lipschitz norm.
The paper proposes new strategies to exploit relationships between meta-tasks for better few-shot learning.
problem Few-shot learning struggles with domain gaps and poorly sampled data.
method Proposes exploiting relationships between meta-tasks to improve robustness and performance.
result Developed new learning objectives (MDA and MKD) to address domain gaps and improve robustness.
Few-shot visual reasoning model learns analogical relationships from small data.
problem Training deep models on few samples for visual reasoning tasks.
method Meta-analogical contrastive learning to enforce structural similarity between training and test samples.
result Method outperforms state-of-the-art on RAVEN dataset with scarce training data.
This paper explains how overparameterization aids in meta-learning with few samples.
problem Building a generalizable model with few samples in meta-learning.
method Analyzes the optimal linear representation and sample complexity for meta-learning tasks.
result Overparameterization naturally answers fundamental meta-learning questions, reducing sample complexity.
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.
Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guaranteesstat.ML
OPSRL algorithm reduces regret with few samples in reinforcement learning.
problem High regret in reinforcement learning with limited data.
method Optimistic Posterior Sampling (OPSRL) with logarithmic sample complexity.
result Guaranteed high-probability regret bound of .
In few-shot learning, typically, the loss function which is applied at test time is the one we are ultimately interested in minimising, such as the mean-squared-error loss for a regression problem. However, given that we have few samples at test time, we argue that the loss function that we are interested in minimising…
Meta-learned confidence improves few-shot learning accuracy.
problem Improving accuracy in few-shot learning with unreliable model confidence.
method Meta-learning confidence weights for query samples to improve transductive inference performance.
result Meta-learned confidence leads to new state-of-the-art results on benchmark datasets.
Paper introduces negative margin loss for better few-shot classification accuracy.
problem Improving few-shot classification accuracy with metric learning.
method Introduces negative margin loss and analyzes its impact on feature discriminability.
result Negative margin loss outperforms regular softmax loss on few-shot classification benchmarks.
Deep neural networks (DNNs) have achieved state-of-the-art results on time series classification (TSC) tasks. In this work, we focus on leveraging DNNs in the often-encountered practical scenario where access to labeled training data is difficult, and where DNNs would be prone to overfitting. We leverage recent advance…
Improves generalization with few samples using a new regularization method.
problem Training deep neural networks with limited data leads to overfitting.
method Sample-based regularization (SBR) to improve generalization without relying on source model knowledge.
result SBR outperformed existing methods in various configurations.
New method uses graph-based interpolation for few-shot classification.
problem Learning models with limited labeled examples.
method Graph-based feature vector interpolation for transductive learning.
result Significant gains in few-shot classification compared to other methods.
Novel GNN model tackles few-shot learning with improved performance.
problem Few-shot learning with GNN suffers from over-fitting and over-smoothing.
method Proposes Attentive GNN with triple-attention mechanism.
result Improves GNN performance for few-shot learning tasks.
ProtoTransfer learns from unlabeled data to classify unseen tasks.
problem Few-shot classification with limited labeled data.
method Self-supervised prototypical transfer learning.
result ProtoTransfer outperforms unsupervised meta-learning methods.
Meta-learning has been proposed as a framework to address the challenging few-shot learning setting. The key idea is to leverage a large number of similar few-shot tasks in order to learn how to adapt a base-learner to a new task for which only a few labeled samples are available. As deep neural networks (DNNs) tend to…
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.
The paper reduces sample complexity for estimating novel task parameters with few meta-learning tasks.
problem Meta-learning sparse linear regression with limited data.
method Accessing multiple similar tasks to recover common support and reduce novel task sample complexity.
result The sample complexity for estimating the parameter of a novel task is greatly reduced to O(1) with respect to the number of tasks.
New framework minimizes model complexity for improved few-shot learning.
problem Empirical benefits of pre-training scale with data size but lack theoretical explanation.
method Complexity Minimization framework for meta-representation learning.
result Theoretical analysis shows error rate improves with more meta-training data.
Paper improves few-shot classification accuracy using feature distribution preprocessing.
problem Challenges of few-shot classification due to limited labelled samples.
method Proposes a novel transfer-based method that preprocesses feature vectors to Gaussian-like distributions and uses optimal-transport inspired algorithms.
result Achieves state-of-the-art accuracy on standardized vision benchmarks.
Meta-learning has received a tremendous recent attention as a possible approach for mimicking human intelligence, i.e., acquiring new knowledge and skills with little or even no demonstration. Most of the existing meta-learning methods are proposed to tackle few-shot learning problems such as image and text, in rather …
This paper improves few-shot learning by reducing sample complexity using representation learning.
problem Reducing sample complexity for target tasks with limited data.
method Representation learning to pool all source task samples for target task learning.
result Representation learning can achieve substantial sample size reduction, bypassing the $Ω( rac{1}{T})$ barrier.
Paper proposes a new pipeline for few-shot classification using forget-update module and channel vector sequence.
problem Few-shot classification with limited support samples.
method Channel vector sequence construction module and forget-update module.
result Pipeline achieves state-of-the-art results on various datasets.
This paper proposes a multi-layer neural network structure for few-shot image recognition of novel categories. The proposed multi-layer neural network architecture encodes transferable knowledge extracted from a large annotated dataset of base categories. This architecture is then applied to novel categories containing…
Paper proposes DAPNA to improve few-shot learning with domain adaptation.
problem Improving recognition of unseen classes with limited samples.
method Domain adaptation prototypical network with attention (DAPNA).
result DAPNA outperforms state-of-the-art FSL alternatives in experiments.
Few-shot learning has become essential for producing models that generalize from few examples. In this work, we identify that metric scaling and metric task conditioning are important to improve the performance of few-shot algorithms. Our analysis reveals that simple metric scaling completely changes the nature of few-…
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…
We consider the task of few shot link prediction on graphs. The goal is to learn from a distribution over graphs so that a model is able to quickly infer missing edges in a new graph after a small amount of training. We show that current link prediction methods are generally ill-equipped to handle this task. They canno…
Develops a method to ensure accuracy of few-shot transfer learning models.
problem Lack of generalization guarantees for low-data transfer learning.
method Trains a distribution over PEFT parameters using upstream tasks and samples plausible PEFTs for downstream tasks.
result Demonstrates non-vacuous generalization guarantees compared to existing methods in the low-shot regime.