Search

A variant of membrane computing models called Spiking Neural P systems (SNP systems) closely mimics the structure and behavior of biological neurons. As third-generation neural networks, SNP systems have flexible architectures allowing the design of bio-inspired machine learning algorithms. This paper proposes Modular Spiking Neural P (MSNP) systems to solve image classification problems, a novel SNP system to be applied in scenarios where hundreds or even thousands of different classes are considered. A main issue to face in such situations is related to the structural complexity of the network. MSNP systems devised in this work allow to approach the general classification problem by dividing it in smaller parts, that are then faced by single entities of the network. As a benchmark dataset, the Oxford Flowers 102 dataset is considered, consisting of more than 8000 pictures of flowers belonging to the 102 species commonly found in the UK. These classes sometimes present large variations within them, may be also very similar to one another, and different images of the same subject may differ a lot. The work describes the architecture of the MSNP system, based on modules focusing on a specific class, their training phase, and the evaluation of the model both concerning result accuracy as well as energy consumption. Experimental results on image classification problems show that the model achieves good results, but is strongly connected to image quality, mainly depending on the frequency of images, remarkable changes of pose, images not centered, and subject mostly not shown. [ABSTRACT FROM AUTHOR]

Large deep learning models are impressive, but they struggle when real-time data is not available. Few-shot class-incremental learning (FSCIL) poses a significant challenge for deep neural networks to learn new tasks from just a few labeled samples without forgetting the previously learned ones. This setup can easily leads to catastrophic forgetting and overfitting problems, severely affecting model performance. Studying FSCIL helps overcome deep learning model limitations on data volume and acquisition time, while improving practicality and adaptability of machine learning models. This paper provides a comprehensive survey on FSCIL. Unlike previous surveys, we aim to synthesize few-shot learning and incremental learning, focusing on introducing FSCIL from two perspectives, while reviewing over 30 theoretical research studies and more than 20 applied research studies. From the theoretical perspective, we provide a novel categorization approach that divides the field into five subcategories, including traditional machine learning methods, meta learning-based methods, feature and feature space-based methods, replay-based methods, and dynamic network structure-based methods. We also evaluate the performance of recent theoretical research on benchmark datasets of FSCIL. From the application perspective, FSCIL has achieved impressive achievements in various fields of computer vision such as image classification, object detection, and image segmentation, as well as in natural language processing and graph. We summarize the important applications. Finally, we point out potential future research directions, including applications, problem setups, and theory development. Overall, this paper offers a comprehensive analysis of the latest advances in FSCIL from a methodological, performance, and application perspective. • In-depth survey on FSCIL methods, applications, performance. • Categorizing FSCIL into five subcategories for clear analysis. • Evaluating FSCIL research on benchmarks for strengths, weaknesses. • FSCIL applications in computer vision, NLP, and graph. [ABSTRACT FROM AUTHOR]

Variable selection is one of the most important contents of machine learning research and a large number of variable selection methods have been proposed at present. From deep learning perspective, we propose a new variable selection method based on multi-layer artificial neural networks in this paper. The method propagates errors gained form a trained network model through the network from output layer to input layer and the values gained by input layer give information about the relative contribution. The variables with big contribution value are selected, which we call neural inverse propagation (NIP). Specifically, after training a neural network, the gained errors between the actual network outputs and the desired outputs go through the network from top to down and arrive at the input layer. The absolute values gained by input units provide information about the relative importance (contribution) of input units, which is that the larger the value is, the more important the corresponding input variable is. We remove k variables corresponding to the first k minimum absolute value gained by input units to the predictive variables, to perform variable selection. The efficiency of the proposed method is illustrated through its application to classification and regression tasks on a number of synthetic datasets and a real-world image classification dataset. [ABSTRACT FROM AUTHOR]

Active learning alleviates labeling costs by selecting and labeling the most informative examples from an unlabeled pool. However, most existing active learning approaches estimate informativeness with uncalibrated confidence, resulting in unreliable informativeness estimation. These approaches generally ignored two significant issues caused by uncalibrated confidence methods. Firstly, the average uncalibrated confidence generated by modern neural networks is usually higher than the accuracy. Secondly, examples located near the decision boundaries are unstable during prediction when the target model updates parameters in the last several epochs, even throughout the training process. This phenomenon, caused by the forgetting characteristic of neural networks, has a significant impact on some specific models that estimate the informativeness by predicted probability vectors or pseudo labels. To address these issues, in this paper, we propose a novel active learning approach to reliably estimate informativeness with calibrated confidence. Specifically, we integrate the intermediate predictions for each unlabeled example, generated by the target model during the training process, to generate calibrated confidence. The calibrated confidence can capture a tendentious label from an indecisive subset of the class space. We show that the calibrated confidence with tendentiousness can maintain the ability of correct predictions. The empirical results demonstrate that our approach outperforms the state-of-the-art active learning methods on image classification tasks. • The active learning algorithm selects unstable examples by calibrated confidence.. • The confidence calibration method only requires training a single model. • Extensive experiments show the competitive performance of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper discusses how automatic speech recognition systems are and could be designed, in order to best exploit the discriminative information encoded in human speech. This contrasts with many recent machine learning approaches that apply general recognition architectures to signals to identify, with little concern for the nature of the input. The implicit assumption has often been that training can automatically discover the useful properties that exist in signals, with minimal manual intervention. These approaches may be suitable for some tasks such as image recognition, where the diversity of visual input is vast; e.g., an image may be any (natural or synthetic) scene that a camera views. We first examine what makes speech special, i.e., a natural signal from a complex tube, driven by a source that is quasi-periodic and/or noisy, aiming to communicate a wide variety of information, using the different vocal systems of human speakers. Then, we view how pertinent features are extracted from speech via efficient means, related to the objectives of communication. We see how to reliably and efficiently identify the different units of oral language. We learn from the history of attempts to do ASR, e.g., why they succeeded and how improved methods exploited the increasing availability of data and computer power (in particular, deep neural networks). Finally, we suggest ways to render ASR both more accurate and efficient. This work is aimed at both newcomers to ASR and experts, in terms of presenting issues broadly, but without mathematical or algorithmic details, which are readily found in the references. [ABSTRACT FROM AUTHOR]