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…
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,786 papers · 148 categories
Trend · papers per month
48 results for “prototype-based classification”
Prototype-based generative replay framework for online continual regression.
problem Addressing the challenge of non-stationary data streams in regression tasks.
method Adaptive output-space discretization model for prototype-based generative replay.
result Reduces forgetting and provides more stable performance.
ProtoX-AD: A self-explainable time series anomaly detection framework
problem Lack of explainability in self-supervised time series anomaly detection
method Learning transformation-aware latent representations and interpretable prototypes
result Achieves detection performance comparable to black-box methods while offering more consistent and semantically meaningful explanations
An appropriate choice of the activation function (like ReLU, sigmoid or swish) plays an important role in the performance of (deep) multilayer perceptrons (MLP) for classification and regression learning. Prototype-based classification learning methods like (generalized) learning vector quantization (GLVQ) are powerful…
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.
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.
V-HMN integrates memory mechanisms for improved image recognition.
problem Limited interpretability and high data requirements of existing vision backbones.
method Brain-inspired hierarchical memory modules with iterative refinement.
result V-HMN achieves strong performance on image classification benchmarks.
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.
We propose in this contribution a method for l one regularization in prototype based relevance learning vector quantization (LVQ) for sparse relevance profiles. Sparse relevance profiles in hyperspectral data analysis fade down those spectral bands which are not necessary for classification. In particular, we consider …
Meta-learning improves few-shot learning by propagating knowledge across related classes on a graph.
problem Few-shot learning suffers from insufficient training data.
method Developed a Gated Propagation Network (GPN) that learns to propagate messages between prototypes of different classes on a graph.
result GPN outperforms recent meta-learning methods on benchmark datasets.
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.
UniShape improves time series classification by selecting relevant subsequences.
problem Classifying time series data requires capturing interpretable shapelets.
method UniShape uses a shape-aware adapter to aggregate multiscale subsequences into class tokens.
result UniShape achieves state-of-the-art classification performance.
We present a modelling framework for the investigation of prototype-based classifiers in non-stationary environments. Specifically, we study Learning Vector Quantization (LVQ) systems trained from a stream of high-dimensional, clustered data.We consider standard winner-takes-all updates known as LVQ1. Statistical prope…
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 …
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.
Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approachcs.LG
Paper tackles graph class-incremental learning with task profiling and prompting.
problem Challenges in separating classes from different tasks in graph CIL.
method Laplacian smoothing-based task profiling and graph prompting approach.
result 100% task ID prediction accuracy and significant performance improvement.
Prototype-based interpretation of the functionality of neurons in winner-take-all neural networkscs.LG
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.
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.
In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullbac…
We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover catch digraph (CCCD), has been used to solve the class cover problem by using its…
The increasing use of machine learning in practice and legal regulations like EU's GDPR cause the necessity to be able to explain the prediction and behavior of machine learning models. A prominent example of particularly intuitive explanations of AI models in the context of decision making are counterfactual explanati…
In this paper, a similarity-driven cluster merging method is proposed for unsuper-vised fuzzy clustering. The cluster merging method is used to resolve the problem of cluster validation. Starting with an overspecified number of clusters in the data, pairs of similar clusters are merged based on the proposed similarity-…
Framework models supervised learning in non-stationary data.
problem Non-stationary data in supervised learning.
method Statistical physics methods applied to LVQ and neural networks.
result LVQ and ReLU have different sensitivity to concept drift.
New fair-by-design model reduces bias in recidivism prediction.
problem Discriminatory bias in recidivism prediction models.
method Prototype-based, locally learned, data distribution extraction.
result Reduces bias and provides interpretable rules.
Designing a new drug is a lengthy and expensive process. As the space of potential molecules is very large (10^23-10^60), a common technique during drug discovery is to start from a molecule which already has some of the desired properties. An interdisciplinary team of scientists generates hypothesis about the required…
The paper proposes a method to predict the performance of data-driven algorithms using surrogate models.
problem Improving the performance prediction of data-driven knowledge discovery algorithms.
method Surrogate-assisted performance prediction using evolutionary modeling of clinical pathways.
result The proposed approach provides interpretable prediction of algorithm performance and quality.
New algorithm detects and adapts to changes in real-time data streams.
problem Adapting to fast-changing data in real-time systems.
method Concept drift detection followed by prototype-based adaptation.
result Stable and quick adjustments during model adaptation.
Geometric framework links clustering accuracy to structural recovery.
problem Understanding the trade-off between robustness and sensitivity in clustering.
method Develops a clustering condition number to compare within-cluster scale to the minimum loss increase required to move a point across a cluster boundary.
result Sharp phase transitions for exact recovery under different objectives, providing geometric principle for interpreting low objective values.
CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.
problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.
The paper advocates for interpretable, accountable, reproducible machine learning in medicine.
problem Black box models in medicine lack transparency and regulatory approval.
method Intrinsically interpretable modeling approaches and collaborative learning paradigms.
result Interpretable machine learning models can support clinical decisions and gain regulatory approval.
ProtoNAM models tabular data with neural networks, making predictions transparent.
problem Tabular data analysis using neural networks lacks transparency and accuracy compared to tree-based methods.
method ProtoNAM introduces prototypes into neural networks to model tabular data while maintaining explainability.
result ProtoNAM outperforms existing NN-based GAMs and provides insights into learned feature patterns.
Parameter-free clustering method using cluster catch digraphs (CCDs).
problem Finding the correct number of clusters in data without specifying a parameter.
method Hybrid of density-based and graph-based clustering methods using Ripley's K function.
result Minimum dominating sets of RK-CCDs estimate and distinguish clusters from noise.
Complex embeddings handle non-metric proximity data better than traditional methods.
problem Proximities not always metric or inner product-based, causing convergence issues.
method Proposes complex-valued embeddings for non-vectorial data.
result Complex embeddings outperform traditional techniques on benchmarks.
Dual-stage sEMG classification improves gesture recognition accuracy.
problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.
A novel method for classification with rejection using ensemble of cost-sensitive classifiers.
problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.
Multi-borders classificationstat.ML
The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…
Sequence classification is an important data mining task in many real world applications. Over the past few decades, many sequence classification methods have been proposed from different aspects. In particular, the pattern-based method is one of the most important and widely studied sequence classification methods in …
Few-shot image classification is improved by correcting CNNs' texture bias.
problem Few-shot image classification performance is hindered by CNNs' texture bias.
method Corrected CNNs' texture bias using a simpler method than state-of-the-art approaches.
result State-of-the-art performance on miniImageNet task achieved.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Paper compares XGB and BPNN for music style classification.
problem Efficient music style classification using different methods.
method Feature extraction for timbral texture, rhythmic content, and pitch content; comparative evaluation of XGB and BPNN.
result XGB outperforms BPNN for small datasets in music classification.
Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.
problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.
C-HMCNN(h) improves HMC classification by leveraging class hierarchy.
problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.
Advances few-shot classification by treating it as supervised learning and proposing new training techniques.
problem Formulating the ability of humans to learn from limited data in machine learning.
method Formulated few-shot classification as a supervised learning problem and introduced multi-episode and cross-way training techniques.
result Proposed training strategies accelerate the training process without accuracy loss.
Improves NILM with multi-label SRC, outperforming state-of-the-art.
problem Non-intrusive load monitoring (NILM) for energy disaggregation.
method Modified multi-label sparse representation based classification (SRC).
result Significant improvement over state-of-the-art techniques with minimal training data.
New approach improves classification guarantees by focusing on direction rather than regression risk.
problem Improving classification guarantees in binary classification problems.
method Establishing a geometric distinction between classification and regression, leveraging scale invariance.
result Improved guarantees for classification risk compared to regression risk.
We study realizations of Lie algebras by vector fields. A correspondence between classification of transitive local realizations and classification of subalgebras is generalized to the case of regular local realizations. A reasonable classification problem for general realizations is rigorously formulated and an algori…
Study selective classification with halfspaces, achieving error bounds under Gaussian distributions.
problem Modeling relationships in subsets of data defined by selection rules.
method Sparse linear classifiers for subsets defined by halfspaces, focusing on Gaussian feature distributions.
result First PAC-learning algorithm for homogeneous halfspace selectors with error guarantee $\bigO*{\sqrt{\mathrm{opt}}}$.
A new network-based high-level data classification method using betweenness centrality.
problem Traditional data classification techniques focus on physical features, while high-level classification considers semantic meaning.
method Proposes a network-based high-level classification technique using betweenness centrality.
result Competent classification performance in nine real datasets compared to traditional models.