ProtoPNet uses deep learning to classify images by identifying prototypical parts.
problem Challenging image classification tasks where understanding reasoning is important.
method ProtoPNet architecture that reasons by finding prototypical parts and combining evidence.
result ProtoPNet achieves comparable accuracy to non-interpretable models and provides interpretability.
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…
Prototype-based methods improve neural networks' robustness and interpretability.
problem Neural networks lack robustness and interpretability.
method Prototype-based vector quantization methods are integrated into neural networks.
result Established a strong theoretical framework for prototype-based neural network layers.
Deep neural networks are widely used for classification. These deep models often suffer from a lack of interpretability -- they are particularly difficult to understand because of their non-linear nature. As a result, neural networks are often treated as "black box" models, and in the past, have been trained purely to …
Study examines ridesourcing patterns in Chicago using K-prototypes segmentation.
problem Limited data on ridesourcing trips hinders research on urban mobility.
method Utilized K-prototypes algorithm for mixed data types segmentation.
result Six ridesourcing user segments identified based on various factors.
A new method explains Siamese neural networks using feature comparison and autoencoder.
problem Explaining the decision-making process of Siamese neural networks.
method Feature comparison at embedding level and autoencoder reconstruction.
result The method effectively explains Siamese neural networks using MNIST dataset.
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.
Prototype networks on hyperspheres improve classification and regression.
problem Improving classification and regression performance.
method Using hyperspherical prototypes for classification and regression, optimizing prototypes through data-independent margin separation.
result Hyperspherical prototype networks outperform other methods in classification, regression, and their combination.
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…
Infinite mixture prototypes adapt to complex data for few-shot learning.
problem Few-shot learning with complex data distributions.
method Adaptive representation of classes by clusters, inferring cluster number.
result 25% absolute accuracy improvement on alphabets, state-of-the-art semi-supervised clustering.
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.
Paper develops brain-inspired unsupervised learning for scalable object detection.
problem Machine vision systems struggle with object discovery and detection, especially under nonideal conditions.
method Leverages large-scale perceptual data to develop brain-inspired flexible, scale, and shift invariant object prototypes.
result Efficient unsupervised learning framework constructs accurate part-aware object models and robust detection algorithms.
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.
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.
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.
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…
The paper uses learned prototypes to explain deep learning models for time-series data.
problem Lack of explainable AI in deep learning models for high-risk decisions.
method Learned prototypes in latent space of deep learning models.
result Prototypes improve classification decisions and provide explainable insights.
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.
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.
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…
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.
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.
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.
A model finds interpretable prototypes for MIL datasets.
problem Finding interpretable prototypes for multiple instance learning.
method Permutation invariant maximally predictive prototype generator.
result The model outperforms existing approaches in accuracy and efficiency.
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. …
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.
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.
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. 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.
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…
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. A fast method finds interpretable counterfactual explanations using class prototypes.
problem Finding understandable counterfactual explanations for classifier predictions.
method Using class prototypes, the method speeds up and improves interpretability of counterfactual instances.
result The method significantly speeds up and improves the interpretability of counterfactual explanations.
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.
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.
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.
A probabilistic method for deep embedding that improves classification accuracy and interpretability.
problem Improving classification accuracy and interpretability in deep learning.
method A probabilistic approach that treats embeddings as random variables, using a product distribution over labeled instances and marginalizing prototype proximity.
result Superior large- and open-set classification accuracy compared to state-of-the-art methods.
One of the fundamental tasks in understanding genomics is the problem of predicting Transcription Factor Binding Sites (TFBSs). With more than hundreds of Transcription Factors (TFs) as labels, genomic-sequence based TFBS prediction is a challenging multi-label classification task. There are two major biological mechan…
Improved few-shot learning with unlabeled data using random walks.
problem Few-shot learning with limited labeled data.
method Prototypical Random Walk Networks (PRWN) with semi-supervised loss.
result Significant performance improvements in most benchmarks.
Prototype selection improves DS techniques' accuracy and reduces computational cost.
problem Improving the performance of dynamic selection techniques.
method Prototype selection techniques that edit validation data to remove noise and redundant instances.
result Improves DS techniques' classification accuracy and reduces computational cost.
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 …
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.
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.
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.
We propose a new generative model of sentences that first samples a prototype sentence from the training corpus and then edits it into a new sentence. Compared to traditional models that generate from scratch either left-to-right or by first sampling a latent sentence vector, our prototype-then-edit model improves perp…
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.
New method trains prototypical few-shot models on single class.
problem Train few-shot models on single class with limited examples.
method Introduce 'null class' and use batch normalization; propose Gaussian layer for distance calculation.
result Achieved high accuracy on test sets (Omniglot: 98%, MiniImageNet: 80%).
Proposes D2D-LSTM for predicting mobile social network content diffusion paths.
problem Lack of accurate content popularity prediction considering time and location in mobile social networks.
method D2D-LSTM, a deep neural network combining user social features and files features.
result Significantly improved prediction accuracy (up to 85.858%) and faster convergence (less than 100 steps).