A Unified Framework for Reservoir Computing and Extreme Learning Machines based on a Single Time-delayed Neuron.
Ontology highlight
ABSTRACT:
SUBMITTER: Ortin S
PROVIDER: S-EPMC4597340 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Reservoir computing (RC) is a recently introduced bio-inspired computational framework capable of excellent performances in the temporal data processing, owing to its derivation from the recurrent neural network (RNN). It is well-known for the fast and effective training scheme, as well as the ease of the hardware implementation, but also the problematic sensitivity of its performance to the optimizable architecture parameters. In this article, a particular time-delayed RC with a single clamped-clamped silicon beam resonator that exhibits a classical Duffing nonlinearity is presented and its optimization problem is studied. Specifically, we numerically analyze the nonlinear response of the resonator and find a quasi-linear bifurcation point shift of the driving voltage with the driving frequency sweeping, which is called Bifurcation Point Frequency Modulation (BPFM). Furthermore, we first proposed that this method can be used to find the optimal driving frequency of RC with a Duffing mechanical resonator for a given task, and then put forward a comprehensive optimization process. The high performance of RC presented on four typical tasks proves the feasibility of this optimization method. Finally, we envision the potential application of the method based on the BPFM in our future work to implement the RC with other mechanical oscillators.
| S-EPMC7806606 | biostudies-literature
Project description:Photonic reservoir computing is an emergent technology toward beyond-Neumann computing. Although photonic reservoir computing provides superior performance in environments whose characteristics are coincident with the training datasets for the reservoir, the performance is significantly degraded if these characteristics deviate from the original knowledge used in the training phase. Here, we propose a scheme of adaptive model selection in photonic reservoir computing using reinforcement learning. In this scheme, a temporal waveform is generated by different dynamic source models that change over time. The system autonomously identifies the best source model for the task of time series prediction using photonic reservoir computing and reinforcement learning. We prepare two types of output weights for the source models, and the system adaptively selected the correct model using reinforcement learning, where the prediction errors are associated with rewards. We succeed in adaptive model selection when the source signal is temporally mixed, having originally been generated by two different dynamic system models, as well as when the signal is a mixture from the same model but with different parameter values. This study paves the way for autonomous behavior in photonic artificial intelligence and could lead to new applications in load forecasting and multi-objective control, where frequent environment changes are expected.
| S-EPMC7308406 | biostudies-literature
Project description:Reservoir computing is a recently introduced, highly efficient bio-inspired approach for processing time dependent data. The basic scheme of reservoir computing consists of a non linear recurrent dynamical system coupled to a single input layer and a single output layer. Within these constraints many implementations are possible. Here we report an optoelectronic implementation of reservoir computing based on a recently proposed architecture consisting of a single non linear node and a delay line. Our implementation is sufficiently fast for real time information processing. We illustrate its performance on tasks of practical importance such as nonlinear channel equalization and speech recognition, and obtain results comparable to state of the art digital implementations.
| S-EPMC3286854 | biostudies-other
Project description:This paper presents a novel color face recognition algorithm by means of fusing color and local information. The proposed algorithm fuses the multiple features derived from different color spaces. Multiorientation and multiscale information relating to the color face features are extracted by applying Steerable Pyramid Transform (SPT) to the local face regions. In this paper, the new three hybrid color spaces, YSCr, ZnSCr, and BnSCr, are firstly constructed using the Cb and Cr component images of the YCbCr color space, the S color component of the HSV color spaces, and the Zn and Bn color components of the normalized XYZ color space. Secondly, the color component face images are partitioned into the local patches. Thirdly, SPT is applied to local face regions and some statistical features are extracted. Fourthly, all features are fused according to decision fusion frame and the combinations of Extreme Learning Machines classifiers are applied to achieve color face recognition with fast and high correctness. The experiments show that the proposed Local Color Steerable Pyramid Transform (LCSPT) face recognition algorithm improves seriously face recognition performance by using the new color spaces compared to the conventional and some hybrid ones. Furthermore, it achieves faster recognition compared with state-of-the-art studies.
| S-EPMC3914600 | biostudies-literature
Project description:Reservoir computing is a best-in-class machine learning algorithm for processing information generated by dynamical systems using observed time-series data. Importantly, it requires very small training data sets, uses linear optimization, and thus requires minimal computing resources. However, the algorithm uses randomly sampled matrices to define the underlying recurrent neural network and has a multitude of metaparameters that must be optimized. Recent results demonstrate the equivalence of reservoir computing to nonlinear vector autoregression, which requires no random matrices, fewer metaparameters, and provides interpretable results. Here, we demonstrate that nonlinear vector autoregression excels at reservoir computing benchmark tasks and requires even shorter training data sets and training time, heralding the next generation of reservoir computing.
| S-EPMC8455577 | biostudies-literature
Project description:It is becoming increasingly clear that major malignancies such as breast, colorectal and gastric cancers are not single disease entities, but comprising multiple cancer subtypes of distinct molecular properties. Molecular subtyping has been widely used to dissect inter-tumor biological heterogeneity, in relation to clinical outcomes. A key step of this methodology is to perform unsupervised classification of gene expression profiles, which, however, often suffers challenges of high-dimensionality, feature redundancy as well as noise and irrelevant information. To overcome these limitations, we propose ELM-CC, which employs hidden observation features obtained from extreme learning machines (ELMs) for cancer classification. To demonstrate the effectiveness and usefulness, we applied ELM-CC for gastric and ovarian cancer subtyping. Comparing with the widely-used consensus clustering method, our approach demonstrated much better clustering performance and identified molecular subtypes that are much more clinically relevant.
| S-EPMC6138406 | biostudies-literature
Project description:The reformations of the electrical power sector have resulted in very dynamic and competitive market that has changed many elements of the power industry. Excessive demand of energy, depleting the fossil fuel reserves of planet and releasing the toxic air pollutant, has been causing harm to earth habitats. In this new situation, insufficiency of energy supplies, rising power generating costs, high capital cost of renewable energy equipment, environmental concerns of wind power turbines, and ever-increasing demand for electrical energy need efficient economic dispatch. The objective function in practical economic dispatch (ED) problem is nonlinear and non-convex, with restricted equality and inequality constraints, and traditional optimization methods are incapable of resolving such non-convex problems. Over the recent decade, meta-heuristic optimization approaches have acquired enormous reputation for obtaining a solution strategy for such types of ED issues. In this paper, a novel soft computing optimization technique is proposed for solving the dynamic economic dispatch problem (DEDP) of complex non-convex machines with several constraints. Our premeditated framework employs the genetic algorithm (GA) as an initial optimizer and sequential quadratic programming (SQP) for the fine tuning of the pre-optimized run of GA. The simulation analysis of GA-SQP performs well by acquiring less computational cost and finite time of execution, while providing optimal generation of powers according to the targeted power demand and load, whereas subject to valve point loading effect (VPLE) and multiple fueling option (MFO) constraints. The adequacy of the presented strategy concerning accuracy, convergence as well as reliability is verified by employing it on ten benchmark case studies, including non-convex IEEE bus system at the same time also considering VPLE of thermal power plants. The potency of designed optimization seems more robust with fast convergence rate while evaluating the hard bounded DEDP. Our suggested hybrid method GA-SQP converges to achieve the best optimal solution in a confined environment in a limited number of simulations. The simulation results demonstrate applicability and adequacy of the given hybrid schemes over conventional methods.
| S-EPMC8791528 | biostudies-literature
Project description:High-dimensional omics data contain intrinsic biomedical information that is crucial for personalised medicine. Nevertheless, it is challenging to capture them from the genome-wide data, due to the large number of molecular features and small number of available samples, which is also called "the curse of dimensionality" in machine learning. To tackle this problem and pave the way for machine learning-aided precision medicine, we proposed a unified multi-task deep learning framework named OmiEmbed to capture biomedical information from high-dimensional omics data with the deep embedding and downstream task modules. The deep embedding module learnt an omics embedding that mapped multiple omics data types into a latent space with lower dimensionality. Based on the new representation of multi-omics data, different downstream task modules were trained simultaneously and efficiently with the multi-task strategy to predict the comprehensive phenotype profile of each sample. OmiEmbed supports multiple tasks for omics data including dimensionality reduction, tumour type classification, multi-omics integration, demographic and clinical feature reconstruction, and survival prediction. The framework outperformed other methods on all three types of downstream tasks and achieved better performance with the multi-task strategy compared to training them individually. OmiEmbed is a powerful and unified framework that can be widely adapted to various applications of high-dimensional omics data and has great potential to facilitate more accurate and personalised clinical decision making.
| S-EPMC8235477 | biostudies-literature
Project description:Photonic implementations of reservoir computing (RC) promise to reach ultra-high bandwidth of operation with moderate training efforts. Several optoelectronic demonstrations reported state of the art performances for hard tasks as speech recognition, object classification and time series prediction. Scaling these systems in space and time faces challenges in control complexity, size and power demand, which can be relieved by integrated optical solutions. Silicon photonics can be the disruptive technology to achieve this goal. However, the experimental demonstrations have been so far focused on spatially distributed reservoirs, where the massive use of splitters/combiners and the interconnection loss limits the number of nodes. Here, we propose and validate an all optical RC scheme based on a silicon microring (MR) and time multiplexing. The input layer is encoded in the intensity of a pump beam, which is nonlinearly transferred to the free carrier concentration in the MR and imprinted on a secondary probe. We harness the free carrier dynamics to create a chain-like reservoir topology with 50 virtual nodes. We give proof of concept demonstrations of RC by solving two nontrivial tasks: the delayed XOR and the classification of Iris flowers. This forms the basic building block from which larger hybrid spatio-temporal reservoirs with thousands of nodes can be realized with a limited set of resources.
| S-EPMC8329232 | biostudies-literature
Project description:The electrical signals triggering the heart's contraction are governed by non-linear processes that can produce complex irregular activity, especially during or preceding the onset of cardiac arrhythmias. Forecasts of cardiac voltage time series in such conditions could allow new opportunities for intervention and control but would require efficient computation of highly accurate predictions. Although machine-learning (ML) approaches hold promise for delivering such results, non-linear time-series forecasting poses significant challenges. In this manuscript, we study the performance of two recurrent neural network (RNN) approaches along with echo state networks (ESNs) from the reservoir computing (RC) paradigm in predicting cardiac voltage data in terms of accuracy, efficiency, and robustness. We show that these ML time-series prediction methods can forecast synthetic and experimental cardiac action potentials for at least 15-20 beats with a high degree of accuracy, with ESNs typically two orders of magnitude faster than RNN approaches for the same network size.
| S-EPMC8502981 | biostudies-literature