Simone Spolaor

Dr. Simone Spolaor

Eindhoven University of Technology, Eindhoven, Noord-Brabant, The Netherlands
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 October 2023 in Advanced Functional Materials
Verified
Journal Article
Open access
IKImke Krauhausen
Imke Krauhausen
CCCharles‐Théophile Coen
Charles‐Théophile Coen
SSSimone Spolaor
Simone Spolaor
PGPaschalis Gkoupidenis
Paschalis Gkoupidenis
YBYoeri van de Burgt
Yoeri van de Burgt
Neuromorphic computing offers the opportunity to curtail the huge energy demands of modern artificial intelligence (AI) applications by implementing computations into new, brain‐inspired computing architectures. However, the lack of fabrication processes able to integrate several computing units into monolithic systems and the need for new, hardware‐tailored training algorithms still limit the scope of application and performance of neuromorphic hardware. Recent advancements in the field of organic transistors present new opportunities for neuromorphic systems and smart sensing applications, thanks to their unique properties such as neuromorphic behavior, low‐voltage operation, and mixed ionic‐electronic conductivity. Organic neuromorphic transistors push the boundaries of energy efficient brain‐inspired hardware AI, facilitating decentralized on‐chip learning and serving as a foundation for the advancement of closed‐loop intelligent systems in the next generation. The biocompatibility and dual ionic‐electronic conductivity of organic materials introduce new prospects for biointegration and bioelectronics. Their ability to sense and regulate biosystems, as well as their neuro‐inspired functions can be combined with neuromorphic computing to create the next‐generation of bioelectronics. These systems will be able to seamlessly interact with biological systems and locally compute biosignals in a relevant matter.

1 January 2020 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
SSSimone Spolaor
Simone Spolaor
CFCaro Fuchs
Caro Fuchs
PCPaolo Cazzaniga
Paolo Cazzaniga
UKUzay Kaymak
Uzay Kaymak
DBDaniela Besozzi
Daniela Besozzi
Marco S. NobileMarco S. Nobile
Marco S. Nobile
Many researchers have used fuzzy set theory and fuzzy logic in a variety of applications related to computer science and engineering, given the capability of fuzzy inference systems to deal with uncertainty, represent vague concepts, and connect human language to numerical data. In this work we propose Simpful, a general-purpose and user-friendly Python library designed to facilitate the definition, analysis, and interpretation of fuzzy inference systems. Simpful provides a lightweight Application Programming Interface that allows to intuitively define fuzzy sets and fuzzy rules, and to perform fuzzy inference. Worthy of note, in Simpful the fuzzy rules are specified by means of strings of text written in natural language. We provide here some practical examples to show that Simpful represents a valuable addition to the open-source software that supports fuzzy reasoning.

1 August 2019 in Applied Soft Computing
Verified
Journal Article
Closed access
Andrea TangherloniAndrea Tangherloni
Andrea Tangherloni
SSSimone Spolaor
Simone Spolaor
PCPaolo Cazzaniga
Paolo Cazzaniga
DBDaniela Besozzi
Daniela Besozzi
Leonardo RundoLeonardo Rundo
Leonardo Rundo
Marco S. NobileMarco S. Nobile
Marco S. Nobile

12 July 2024 in Science Advances
Verified
Journal Article
Open access
EDEveline R. W. van Doremaele
Eveline R. W. van Doremaele
TSTim Stevens
Tim Stevens
SRStijn Ringeling
Stijn Ringeling
SSSimone Spolaor
Simone Spolaor
MFMarco Fattori
Marco Fattori
YBYoeri van de Burgt
Yoeri van de Burgt
Neural network training can be slow and energy-expensive due to the frequent transfer of weight data between digital memory and processing units. Neuromorphic systems can accelerate neural networks by performing multiply-accumulate operations in parallel using nonvolatile analog memory. However, executing the widely used backpropagation training algorithm in multilayer neural networks requires information—and therefore storage—of the partial derivatives of the weight values preventing suitable and scalable implementation in hardware. Here, we propose a hardware implementation of the backpropagation algorithm that progressively updates each layer using in situ stochastic gradient descent, avoiding this storage requirement. We experimentally demonstrate the in situ error calculation and the proposed progressive backpropagation method in a multilayer hardware-implemented neural network. We confirm identical learning characteristics and classification performance compared to conventional backpropagation in software. We show that our approach can be scaled to large and deep neural networks, enabling highly efficient training of advanced artificial intelligence computing systems.

1 July 2018
Verified
Conference Paper
Closed access
MNMarco S. Nobile
Marco S. Nobile
Andrea TangherloniAndrea Tangherloni
Andrea Tangherloni
Leonardo RundoLeonardo Rundo
Leonardo Rundo
SSSimone Spolaor
Simone Spolaor
DBDaniela Besozzi
Daniela Besozzi
PCPaolo Cazzaniga
Paolo Cazzaniga
In the field of Systems Biology, simulating the dynamics of biochemical models represents one of the most effective methodologies to understand the functioning of cellular processes in normal or altered conditions. However, the lack of kinetic rates, necessary to perform accurate simulations, strongly limits the scope of these analyses. Parameter Estimation (PE), which consists in identifying a proper model parameterization, is a non-linear, non-convex and multi-modal optimization problem, typically tackled by means of Computational Intelligence techniques, such as Evolutionary Computation and Swarm Intelligence. In this work, we perform a thorough investigation of the most widespread methods for PE-namely, Artificial Bee Colony (ABC), Covariance Matrix Adaptation Evolution Strategy (CMA-ES), Differential Evolution (DE), Estimation of Distribution Algorithm (EDA), Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), and Fuzzy Self-Tuning PSO (FST-PSO)-comparing their performances on a set of synthetic (yet realistic) biochemical models of increasing size and complexity. Our results show that a variant of the settings-free FST-PSO algorithm can consistently outperform all other methods; ABC and GAs represent the most performing alternatives, while methods based on multivariate normal distributions (e.g., CMA-ES, EDA) struggle to keep pace with the other approaches. Index Terms-Computational Intelligence, Systems Biology, Parameter Estimation, Evolutionary Computation, Swarm Intelligence.

18 April 2019 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
Andrea TangherloniAndrea Tangherloni
Andrea Tangherloni
SSSimone Spolaor
Simone Spolaor
Leonardo RundoLeonardo Rundo
Leonardo Rundo
Marco S. NobileMarco S. Nobile
Marco S. Nobile
PCPaolo Cazzaniga
Paolo Cazzaniga
DBDaniela Besozzi
Daniela Besozzi
In order to fully characterize the genome of an individual, the reconstruction of the two distinct copies of each chromosome, called haplotypes, is essential. The computational problem of inferring the full haplotype of a cell starting from read sequencing data is known as haplotype assembly, and consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. Indeed, the knowledge of complete haplotypes is generally more informative than analyzing single SNPs and plays a fundamental role in many medical applications. To reconstruct the two haplotypes, we addressed the weighted Minimum Error Correction (wMEC) problem, which is a successful approach for haplotype assembly. This NP-hard problem consists in computing the two haplotypes that partition the sequencing reads into two disjoint sub-sets, with the least number of corrections to the SNP values. To this aim, we propose here GenHap, a novel computational method for haplotype assembly based on Genetic Algorithms, yielding optimal solutions by means of a global search process. In order to evaluate the effectiveness of our approach, we run GenHap on two synthetic (yet realistic) datasets, based on the Roche/454 and PacBio RS II sequencing technologies. We compared the performance of GenHap against HapCol, an efficient state-of-the-art algorithm for haplotype phasing. Our results show that GenHap always obtains high accuracy solutions (in terms of haplotype error rate), and is up to 4× faster than HapCol in the case of Roche/454 instances and up to 20× faster when compared on the PacBio RS II dataset. Finally, we assessed the performance of GenHap on two different real datasets. Future-generation sequencing technologies, producing longer reads with higher coverage, can highly benefit from GenHap, thanks to its capability of efficiently solving large instances of the haplotype assembly problem. Moreover, the optimization approach proposed in GenHap can be extended to the study of allele-specific genomic features, such as expression, methylation and chromatin conformation, by exploiting multi-objective optimization techniques. The source code and the full documentation are available at the following GitHub repository: https://github.com/andrea-tango/GenHap .