Method generates prototypes from small datasets for efficient learning.
problem Efficiently learning from small datasets with soft labels.
method Modular method for generating soft-label prototypical lines and Hierarchical Soft-Label Prototype k-Nearest Neighbor algorithm.
result High classification accuracy with significantly fewer prototypes than classes.
Optimal prototypes found for challenging pathological geometries.
problem Finding optimal prototypes for pathological geometries is challenging.
method Analytical and heuristic algorithms for finding nearly-optimal prototypes.
result Optimal prototypes can be found analytically for challenging geometries.
We propose infinite mixture prototypes to adaptively represent both simple and complex data distributions for few-shot learning. Our infinite mixture prototypes represent each class by a set of clusters, unlike existing prototypical methods that represent each class by a single cluster. By inferring the number of clust…
ProtoryNet interprets text sequences using prototype trajectories for better understanding.
problem Improving text classification interpretability and accuracy.
method ProtoryNet uses prototype trajectories to interpret text sequences, with prototype pruning for better interpretability.
result ProtoryNet outperforms baseline models and reduces performance gap compared to black-box models.
Ensembles of decision trees perform well on many problems, but are not interpretable. In contrast to existing approaches in interpretability that focus on explaining relationships between features and predictions, we propose an alternative approach to interpret tree ensemble classifiers by surfacing representative poin…
This paper introduces hyperspherical prototype networks, which unify classification and regression with prototypes on hyperspherical output spaces. For classification, a common approach is to define prototypes as the mean output vector over training examples per class. Here, we propose to use hyperspheres as output spa…
IMKPL learns interpretable prototypes for better classification.
problem Efficient trade-offs between interpretability and prediction accuracy in kernel-based data.
method Local discrimination in feature space, condensed class-homogeneous neighborhoods, combined embedding.
result IMKPL achieves better interpretability and discriminative representation.
Prototype selection improved using topological data analysis.
problem Improving prototype selection methods for data compression.
method Introducing two topological prototype selector variants: TPS and BoundaryTPS.
result BoundaryTPS achieves the lowest mean Friedman rank on H1 persistence-diagram preservation. Paper optimizes hyperspherical prototypes for better class separation.
problem Previous HPL approaches either lack principled optimisation or are limited to one latent dimension.
method Develops a principled optimisation procedure and uses linear block codes to create well-separated prototypes in various dimensions.
result Optimal prototype placement is characterized with achievable and converse bounds, showing near-optimality.
A new neural network method improves interpretability and detection of outliers.
problem Improving interpretability and detection of outliers in neural networks.
method Prototype-based learning (PbL) using a winner-take-all (WTA) network with two prototypes: positive and negative.
result The negative prototype is similar to the positive one, aligning with the BCM theory.
Classification in the dissimilarity space has become a very active research area since it provides a possibility to learn from data given in the form of pairwise non-metric dissimilarities, which otherwise would be difficult to cope with. The selection of prototypes is a key step for the further creation of the space. …
PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.
problem Inaccurate and insufficient confusion matrices for annotators in multi-class classification tasks.
method PTBCC (ProtoType learning-driven Bayesian Classifier Combination) uses prototype confusion matrices to capture annotator expertise.
result PTBCC achieves up to 15% accuracy improvement and 3% higher average accuracy compared to existing methods.
Paper proposes integrating hierarchical class structure into prototypical network supervision.
problem Improving classification accuracy in tasks with hierarchical class structures.
method Integrates hierarchical class structure (metric) into prototypical network supervision.
result Consistent improvement of error rate weighted by the cost matrix compared to traditional methods.
TPM improves medical image segmentation by separating foreground and background.
problem Few-shot medical image segmentation challenges due to background variability.
method Tied Prototype Model (TPM) focusing on foreground, adapting thresholds, and using class priors.
result TPM leads to improved segmentation accuracy compared to ADNet.
CAD detects anomalies and selects prototypes using polyhedron curvature.
problem Anomaly detection and prototype selection in data.
method Curvature Anomaly Detection (CAD) and Kernel CAD approach using polyhedron curvature.
result The proposed methods are effective for anomaly detection and prototype selection.
DPTA improves CIL by adapting PTMs with dual prototypes.
problem Catastrophic forgetting in incremental learning with pre-trained models.
method Dual-Prototype Network with Task-wise Adaptation (DPTA).
result DPTA consistently outperforms recent methods by 1\%-5\% on multiple benchmarks.
Prototype extraction framework for domain adaptation.
problem Statistical distance minimization issues in unsupervised domain adaptation.
method Memory and computation-efficient probabilistic framework for class prototype extraction and feature alignment.
result Competitive performance with state-of-the-art methods, no additional model parameters required.
Prototypal analysis is introduced to overcome two shortcomings of archetypal analysis: its sensitivity to outliers and its non-locality, which reduces its applicability as a learning tool. Same as archetypal analysis, prototypal analysis finds prototypes through convex combination of the data points and approximates th…
Proposes a method to detect anomalies in multi-subgroup normal data.
problem Anomaly detection with limited labeled anomalies and multi-subgroup normal data.
method Learn multi-normal prototypes with deep embedding clustering and contrastive learning. Estimate the likelihood of unlabeled samples being normal during training.
result Superior performance compared to state-of-the-art methods on various datasets.
Supervised deep-embedding methods project inputs of a domain to a representational space in which same-class instances lie near one another and different-class instances lie far apart. We propose a probabilistic method that treats embeddings as random variables. Extending a state-of-the-art deterministic method, Protot…
In this paper we propose a simple yet powerful method for learning representations in supervised learning scenarios where each original input datapoint is described by a set of vectors and their associated outputs may be given by soft labels indicating, for example, class probabilities. We represent an input datapoint …
SPOT uses optimal transport to select important prototypes.
problem Summarizing datasets for better understanding and decision making.
method Modeling prototype selection as a submodular optimization problem and using a greedy algorithm.
result Our approach efficiently selects prototypes with optimal transport that best represent the target dataset.
A new method improves quantile regression for high-dimensional data.
problem Handling heteroscedastic, multimodal, or skewed data in quantile regression.
method Dynamic prototypes-based probability density estimation with conformalized high-density quantile regression.
result Enhanced prediction regions with valid coverage guarantees and scalability to higher dimensions.
ProtoBandit uses bandits to find prototypes efficiently.
problem Finding a compact set of prototypes from a large dataset.
method Stochastic greedy search and multi-armed bandits.
result ProtoBandit reduces similarity comparisons to O(k3∣S∣), independent of target set size. Prototype model improves model auditing and understanding.
problem Auditing and understanding modern language models is expensive and approximate.
method Introduced a sparse, non-negative mixture of learned prototypes trained with clustering objectives.
result Prototype models either surpass or remain within 2.5 percentage points of dense baselines on downstream tasks.
We propose a fast, model agnostic method for finding interpretable counterfactual explanations of classifier predictions by using class prototypes. We show that class prototypes, obtained using either an encoder or through class specific k-d trees, significantly speed up the the search for counterfactual instances and …
A new learning method using hyperbolic geometry for class labels.
problem Class label representation and learning in machine learning.
method Hyperbolic Prototype Learning with a new loss function based on hyperbolic geometry.
result Hyperbolic Prototype Learning is equivalent to logistic regression in the one-dimensional case.
Neural networks currently dominate the machine learning community and they do so for good reasons. Their accuracy on complex tasks such as image classification is unrivaled at the moment and with recent improvements they are reasonably easy to train. Nevertheless, neural networks are lacking robustness and interpretabi…
We present the Bayesian Case Model (BCM), a general framework for Bayesian case-based reasoning (CBR) and prototype classification and clustering. BCM brings the intuitive power of CBR to a Bayesian generative framework. The BCM learns prototypes, the "quintessential" observations that best represent clusters in a data…
A new method improves few-shot learning by combining ProtoNet with LFD.
problem Few-shot learning struggles with high variance support sets.
method Combines ProtoNet with Local Fisher Discriminant Analysis.
result Superior classification accuracy on miniImageNet and tieredImageNet.
Pantypes improve prototypical models by capturing diverse input distributions.
problem Prototypical models lack sufficient data representation in low density regions.
method Introducing pantypes, a sparse set of diverse objects to represent the full diversity of input distribution.
result Pantypes empower prototypical models to foster high diversity, interpretability, and fairness.
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.
New method adapts without backprop, faster and better.
problem Efficient domain adaptation without source data.
method Computing class prototypes from pre-trained model.
result Significant accuracy improvements over pre-trained model.
Sparse prototypes improve clustering of high-dimensional directional data.
problem Clustering high-dimensional directional data like texts.
method Estimate a von Mises mixture using l1 penalized likelihood and EM algorithm.
result Sparse prototypes enhance interpretability and clustering performance.
The emergence of deep learning networks raises a need for explainable AI so that users and domain experts can be confident applying them to high-risk decisions. In this paper, we leverage data from the latent space induced by deep learning models to learn stereotypical representations or "prototypes" during training to…
Meta-learning extracts common knowledge from learning different tasks and uses it for unseen tasks. It can significantly improve tasks that suffer from insufficient training data, e.g., few shot learning. In most meta-learning methods, tasks are implicitly related by sharing parameters or optimizer. In this paper, we s…
Prototype-based memory network learns visual categories from unlabeled data.
problem Learning from nonstationary, unlabeled data with sequential dependencies.
method Online prototype-based memory network with contrastive loss.
result Significantly better category recognition compared to state-of-the-art methods.
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple prototype (e.g., piecewise constant). The total number of segments in the prototypes, P, is chosen by the user and optimally distributed am…
Improved segmentation model adaptation for new domains.
problem Reduced performance of pre-trained models on new domains.
method Calculated soft-label prototypes and predicted closest to class probabilities.
result Significant performance improvements on synthetic-to-real segmentation.
We propose a novel architecture for k-shot classification on the Omniglot dataset. Building on prototypical networks, we extend their architecture to what we call Gaussian prototypical networks. Prototypical networks learn a map between images and embedding vectors, and use their clustering for classification. In our…
The condensed nearest neighbor (CNN) algorithm is a heuristic for reducing the number of prototypical points stored by a nearest neighbor classifier, while keeping the classification rule given by the reduced prototypical set consistent with the full set. I present an upper bound on the number of prototypical points ac…
New subspace prototype flag median improves clustering on noisy data.
problem Finding robust prototypes for datasets of images and videos.
method Proposes flag median and introduces FlagIRLS algorithm for its calculation.
result Flag median is robust to outliers and improves cluster purity.
We propose prototypical networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each new class. Prototypical networks learn a metric space in which classification can be performed by computing distances…
Meta learning improves with contextualizers that adapt to examples.
problem Few shot classification with limited labeled data.
method Implement contextualizers as generalizable prototypes for gradient-based meta learning.
result Contextualizers significantly boost performance on various few shot learning datasets.
Prototypical Networks improve multi-label classification accuracy.
problem Multi-label classification with nonlinear label dependencies.
method Formulate multi-label learning as class distribution in a non-linear embedding space. For each label, positive and negative embeddings are compactly distributed. Labels are inferred by measuring the distance to prototype positive or negative embeddings.
result Extensive experiments show improved accuracy compared to state-of-the-art algorithms.
Prototypical examples that best summarizes and compactly represents an underlying complex data distribution communicate meaningful insights to humans in domains where simple explanations are hard to extract. In this paper we present algorithms with strong theoretical guarantees to mine these data sets and select protot…
New method improves few-shot learning with randomized SPSA.
problem Training classifiers on limited examples of new classes.
method Randomized stochastic approximation and prototypical networks.
result The proposed method outperforms original prototypical networks.
learn2learn simplifies meta-learning research by providing a library and standardized interfaces.
problem Prototyping and reproducibility issues in meta-learning.
method Developed a library (learn2learn) with common routines and standardized interfaces.
result Fosters a community around standardized software for meta-learning research.