DeepBDC improves few-shot classification by measuring joint distributions of image features.
problem Few-shot classification with limited training data.
method DeepBDC method using deep learning and Brownian Distance Covariance.
result DeepBDC significantly outperforms existing methods on various benchmarks.
Shot-Noise processes constitute a useful tool in various areas, in particular in finance. They allow to model abrupt changes in a more flexible way than processes with jumps and hence are an ideal tool for modelling stock prices, credit portfolio risk, systemic risk, or electricity markets. Here we consider a general f…
SGLBO optimizes quantum circuits with fewer measurements, improving accuracy and noise resilience.
problem Efficiently optimizing parameterized quantum circuits with reduced measurement shots and noise.
method Developed SGLBO combining SGD and BO, with adaptive measurement-shot strategy and suffix averaging.
result Significantly reduces measurement-shot cost while improving accuracy and noise resilience.
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.
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.
Unified framework for learning quantum models from limited measurements.
problem Sample complexity and measurement shots in classical learning of quantum models.
method Unified learning framework considering probabilistic quantum measurements.
result Asymmetrical effects and interplay of sample size and measurement shots on learning performance.
A new optimizer saves significant shots in quantum machine learning.
problem Training variational QML algorithms is challenging due to large datasets and shot-count overhead.
method Proposed Refoqus optimizer that samples over both dataset and measurement operators.
result Refoqus can save several orders of magnitude in shot cost compared to existing methods.
Wearables like smartwatches which are embedded with sensors and powerful processors, provide a strong platform for development of analytics solutions in sports domain. To analyze players' games, while motion sensor based shot detection has been extensively studied in sports like Tennis, Golf, Baseball; Table Tennis and…
Paper tackles zero-shot activity recognition using video features and text embeddings.
problem Zero-shot activity recognition with videos.
method Auto-encoder model for multimodal joint embedding, 3D convolutional action recognition for visual features, GloVe word embeddings for textual features.
result Improved zero-shot recognition results with top-n accuracy and mean Nearest Neighbor Overlap.
Quantum-enhanced metrology aims to estimate an unknown parameter such that the precision scales better than the shot-noise bound. Single-shot adaptive quantum-enhanced metrology (AQEM) is a promising approach that uses feedback to tweak the quantum process according to previous measurement outcomes. Techniques and form…
Raven's Progressive Matrices are one of the widely used tests in evaluating the human test taker's fluid intelligence. Analogously, this paper introduces geometric generalization based zero-shot learning tests to measure the rapid learning ability and the internal consistency of deep generative models. Our empirical re…
Few quantum measurements limit learning entanglement.
problem Challenges in learning entanglement from limited data.
method Hybrid quantum-classical learning techniques.
result Generalization errors increase with few measurements.
Paper proposes a method to select base classes for few-shot learning.
problem How to select base classes for few-shot learning models.
method Formulated as a submodular optimization problem over Similarity Ratio.
result Our method effectively selects better base datasets for few-shot learning.
This paper investigates task-level evaluation in few-shot learning models.
problem The reliability of evaluating and tuning models trained for individual tasks in few-shot learning is not well addressed.
method The paper measures accuracy of performance estimators, considers model selection strategies, and examines the reasons for evaluator failure.
result Cross-validation with a low number of folds is best for estimating model performance, while large number of folds is better for model selection.
Zero-Shot learning has been shown to be an efficient strategy for domain adaptation. In this context, this paper builds on the recent work of Bucher et al. [1], which proposed an approach to solve Zero-Shot classification problems (ZSC) by introducing a novel metric learning based objective function. This objective fun…
Method adapts frozen models for few-shot tasks without training.
problem Deployment constraints limit model updates, necessitating new adaptation methods.
method Exponential tilting of latent distribution for inference.
result Method outperforms parameter-update methods across benchmarks.
Telescope detects LLM generated text by measuring token repetition probability.
problem Distinguishing LLM generated text from human writing.
method Telescope Perplexity, evaluating token repetition probability.
result Telescope Perplexity enables effective zero-shot LLM detection.
IZF uses flow-based models to overcome ZSL limitations.
problem Hardness of training ZSL models and limited generation quality.
method IZF incorporates flow-based models to learn factorized data embeddings and generates samples.
result IZF significantly outperforms existing methods on ZSL benchmarks.
OBSER framework infers sub-environments from objects, outperforming scene-based methods.
problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.
The paper addresses score-mismatched diffusion models and zero-shot conditional samplers.
problem Theoretical guarantees for score-mismatched diffusion models in zero-shot conditional sampling.
method Theoretical analysis of score-mismatched diffusion models and zero-shot conditional samplers.
result Theoretical performance guarantees with explicit dimensional dependencies for score-mismatched diffusion samplers.
A fast single-shot MC dropout method for neural networks.
problem Inability of DNNs to provide uncertainty measures for new situations.
method Analytically approximates MC dropout for fully connected networks.
result Approach preserves BDNN advantages while being faster.
New metric improves latent dynamics inference from neural data.
problem Limitations of co-smoothing in predicting latent dynamics.
method Few-shot co-smoothing to assess latent dynamics.
result High co-smoothing models often have extraneous dynamics, which few-shot co-smoothing detects.
Few-shot learning is a technique to learn a model with a very small amount of labeled training data by transferring knowledge from relevant tasks. In this paper, we propose a few-shot learning method for wearable sensor based human activity recognition, a technique that seeks high-level human activity knowledge from lo…
Automates VI divergence selection for efficient few-shot learning.
problem Efficiently selecting divergence measures for VI to improve performance.
method Meta-learning algorithm to learn optimal divergence metric and variational parameter initialization.
result Meta-learning approach outperforms standard VI methods across various tasks.
Proposes a method to evaluate meta-learning performance based on task similarity.
problem Meta-learning performance evaluation ignores task similarity, leading to biased results.
method Generative approach using Latent Dirichlet Allocation to analyze task similarity.
result The proposed method provides an insightful evaluation of meta-learning algorithms, matching common intuition.
This paper proposes a zero-shot learning approach for audio classification based on the textual information about class labels without any audio samples from target classes. We propose an audio classification system built on the bilinear model, which takes audio feature embeddings and semantic class label embeddings as…
Meta-learning strategy improves few-shot classification performance.
problem Few-shot classification with deep neural networks struggles when labeled samples are limited.
method Proposes an easy-to-hard expert meta-training strategy to arrange training tasks based on task hardness.
result Meta-learners achieve better results with the proposed expert training strategy.
A fast method for neural networks that provides uncertainty measures.
problem Inability of neural networks to provide reliable uncertainty measures for new situations.
method Moment propagation (MP) for analytically approximating MC dropout.
result Single-shot MC dropout approximation as fast as NNs with similar uncertainty measures.
In this paper we consider a version of the zero-shot learning problem where seen class source and target domain data are provided. The goal during test-time is to accurately predict the class label of an unseen target domain instance based on revealed source domain side information (\eg attributes) for unseen classes. …
Few-shot classification is the task of predicting the category of an example from a set of few labeled examples. The number of labeled examples per category is called the number of shots (or shot number). Recent works tackle this task through meta-learning, where a meta-learner extracts information from observed tasks …
LLMs struggle with zero-shot annotation tasks due to model-internalized priors.
problem Impact of model-internalized priors on LLM performance in zero-shot annotation tasks.
method Investigated three dimensions: familiarity, decision stickiness, and susceptibility to misaligned task definitions.
result Nearly two-thirds of zero-shot errors are resistant to correction, with a rescue rate of 34.8%. Definition-Specific Familiarity (DSF) shows a positive association with model performance.
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.
Heterogeneous SVO leads to diverse policies in sequential social dilemmas.
problem Understanding how diverse social value orientations affect behavior in sequential social dilemmas.
method Extending prior reinforcement learning studies, we instantiated heterogeneous SVO in a sequential social dilemma setting and measured task-specific diversity metrics.
result Heterogeneous SVO leads to meaningfully diverse policies across various incentive structures.
In this report, we present a new reinforcement learning (RL) benchmark based on the Sonic the Hedgehog (TM) video game franchise. This benchmark is intended to measure the performance of transfer learning and few-shot learning algorithms in the RL domain. We also present and evaluate some baseline algorithms on the new…
Fine-tuning a deep network trained with the standard cross-entropy loss is a strong baseline for few-shot learning. When fine-tuned transductively, this outperforms the current state-of-the-art on standard datasets such as Mini-ImageNet, Tiered-ImageNet, CIFAR-FS and FC-100 with the same hyper-parameters. The simplicit…
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.
Zero-shot anomaly detection method using batch normalization.
problem Adapting anomaly detectors to new normal data distributions without training data.
method Adaptive Centered Representations (ACR) with batch normalization.
result First zero-shot AD results for tabular data and image data.
A concise review of recent few-shot meta-learning methods.
problem Mimicking human fast adaptation to new concepts based on prior knowledge.
method Categorized into four branches based on technical characteristics.
result Current challenges and future prospects identified.
In the few-shot scenario, a learner must effectively generalize to unseen classes given a small support set of labeled examples. While a relatively large amount of research has gone into few-shot learning for image classification, little work has been done on few-shot video classification. In this work, we address the …
CAOS aggregates multiple one-shot predictors for efficient uncertainty quantification.
problem Lack of principled uncertainty quantification in one-shot prediction.
method CAOS, a conformal framework that aggregates multiple one-shot predictors and uses a leave-one-out calibration scheme.
result CAOS produces smaller prediction sets with reliable coverage compared to split conformal baselines.
We propose a method for learning embeddings for few-shot learning that is suitable for use with any number of ways and any number of shots (shot-free). Rather than fixing the class prototypes to be the Euclidean average of sample embeddings, we allow them to live in a higher-dimensional space (embedded class models) an…
Bayesian method improves few-shot classification accuracy.
problem Few-shot classification with small labeled datasets.
method Gaussian process classifier with Pólya-Gamma augmentation and one-vs-each softmax.
result Improved accuracy and uncertainty quantification.
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.
Paper tackles 1-bit compressed sensing, presenting efficient algorithm for sparse signal estimation.
problem Estimating sparse signals from binary measurements.
method Non-convex sparsity-constrained program with one-shot hard thresholding.
result Simple algorithm produces accurate signal approximation with high probability.
Paper proposes redundancy-free features for zero-shot object recognition.
problem Redundant visual features degrade zero-shot object recognition.
method Project original features into a new, statistically independent space.
result RFF-GZSL achieves competitive results on benchmark datasets.
Study investigates one-shot semi-supervised learning for image classification.
problem Training deep networks requires many labeled samples, limiting adoption.
method Empirical investigation of FixMatch method for one-shot semi-supervised learning.
result Uneven class accuracy is a barrier to high performance in one-shot semi-supervised learning.
A new topology design improves zero-shot classification performance in contrastive learning.
problem Improving zero-shot classification performance in contrastive visual-textual alignment.
method Proposed an alternative topology design using multiple class tokens and an oblique manifold with negative inner product.
result Improves zero-shot classification performance by an average of 6.1%.
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…