Alessandro Pierro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alessandro Pierro has a total of 111 co-authors. Here are the top co-authors by number of shared publications:
- Jason Yik
Harvard University, Cambridge, Massachusetts, USA
2 shared publications - Jonathan Timcheck
Intel Labs Intel Corporation 95054 Santa Clara CA USA
2 shared publications - Marius Lindauer
Leibniz University Hannover
2 shared publications - Aditya Gilra
Centrum Wiskunde & Informatica
1 shared publication - Alpha Renner
Forschungszentrum Jülich, Jülich, Germany
1 shared publication - Amirreza Yousefzadeh
University of Twente
1 shared publication
Latest Publications
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 329-337
Evolutionary Mapping of Neural Networks to Spatial Accelerators
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 329-337
Open AccessEvolutionary Mapping of Neural Networks to Spatial Accelerators
- Open Access
Evolutionary Mapping of Neural Networks to Spatial Accelerators
Spatial accelerators, composed of arrays of compute-memory integrated units, offer an attractive platform for deploying inference workloads with low latency and low energy consumption. However, fully exploiting their architectural advantages typically requires careful, expert-driven mapping of computational graphs to distributed processing elements. In this work, we automate this process by framing the mapping challenge as a black-box optimization problem. We introduce the first evolutionary, hardware-in-the-loop mapping framework for neuromorphic accelerators, enabling users without deep hardware knowledge to deploy workloads more efficiently. We evaluate our approach on Intel Loihi 2, a representative spatial accelerator featuring 152 cores per chip in a 2D mesh. Our method achieves up to 35% reduction in total latency compared to default heuristics on two sparse multi-layer perceptron networks. Furthermore, we demonstrate the scalability of our approach to multi-chip systems and observe an up to 40% improvement in energy efficiency, without explicitly optimizing for it.
Open AccessEvolutionary Mapping of Neural Networks to Spatial Accelerators
Spatial accelerators, composed of arrays of compute-memory integrated units, offer an attractive platform for deploying inference workloads with low latency and low energy consumption. However, fully exploiting their architectural advantages typically requires careful, expert-driven mapping of computational graphs to distributed processing elements. In this work, we automate this process by framing the mapping challenge as a black-box optimization problem. We introduce the first evolutionary, hardware-in-the-loop mapping framework for neuromorphic accelerators, enabling users without deep hardware knowledge to deploy workloads more efficiently. We evaluate our approach on Intel Loihi 2, a representative spatial accelerator featuring 152 cores per chip in a 2D mesh. Our method achieves up to 35% reduction in total latency compared to default heuristics on two sparse multi-layer perceptron networks. Furthermore, we demonstrate the scalability of our approach to multi-chip systems and observe an up to 40% improvement in energy efficiency, without explicitly optimizing for it.
- Top Cited PapersOpen Access
- 11 February 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-24
The neurobench framework for benchmarking neuromorphic computing algorithms and systems
Neuromorphic computing shows promise for advancing computing efficiency and capabilities of AI applications using brain-inspired principles. However, the neuromorphic research field currently lacks standardized benchmarks, making it difficult to accurately measure technological advancements, compare performance with conventional methods, and identify promising future research directions. This article presents NeuroBench, a benchmark framework for neuromorphic algorithms and systems, which is collaboratively designed from an open community of researchers across industry and academia. NeuroBench introduces a common set of tools and systematic methodology for inclusive benchmark measurement, delivering an objective reference framework for quantifying neuromorphic approaches in both hardware-independent and hardware-dependent settings. For latest project updates, visit the project website (neurobench.ai).
- 11 February 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-24
Top Cited PapersOpen AccessThe neurobench framework for benchmarking neuromorphic computing algorithms and systems
Neuromorphic computing shows promise for advancing computing efficiency and capabilities of AI applications using brain-inspired principles. However, the neuromorphic research field currently lacks standardized benchmarks, making it difficult to accurately measure technological advancements, compare performance with conventional methods, and identify promising future research directions. This article presents NeuroBench, a benchmark framework for neuromorphic algorithms and systems, which is collaboratively designed from an open community of researchers across industry and academia. NeuroBench introduces a common set of tools and systematic methodology for inclusive benchmark measurement, delivering an objective reference framework for quantifying neuromorphic approaches in both hardware-independent and hardware-dependent settings. For latest project updates, visit the project website (neurobench.ai).
- Open Access
- 12 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 202-210
Optimization of a Hydrodynamic Computational Reservoir through Evolution
As demand for computational resources reaches unprecedented levels, research is expanding into the use of complex material substrates for computing. In this study, we interface with a model of a hydrodynamic system, under development by a startup, as a computational reservoir and optimize its properties using an evolution in materio approach. Input data are encoded as waves applied to our shallow water reservoir, and the readout wave height is obtained at a fixed detection point. We optimized the readout times and how inputs are mapped to the wave amplitude or frequency using an evolutionary search algorithm, with the objective of maximizing the system's ability to linearly separate observations in the training data by maximizing the readout matrix determinant. Applying evolutionary methods to this reservoir system substantially improved separability on an XNOR task, in comparison to implementations with hand-selected parameters. We also applied our approach to a regression task and show that our approach improves out-of-sample accuracy. Results from this study will inform how we interface with the physical reservoir in future work, and we will use these methods to continue to optimize other aspects of the physical implementation of this system as a computational reservoir.1
- 12 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 202-210
Open AccessOptimization of a Hydrodynamic Computational Reservoir through Evolution
As demand for computational resources reaches unprecedented levels, research is expanding into the use of complex material substrates for computing. In this study, we interface with a model of a hydrodynamic system, under development by a startup, as a computational reservoir and optimize its properties using an evolution in materio approach. Input data are encoded as waves applied to our shallow water reservoir, and the readout wave height is obtained at a fixed detection point. We optimized the readout times and how inputs are mapped to the wave amplitude or frequency using an evolutionary search algorithm, with the objective of maximizing the system's ability to linearly separate observations in the training data by maximizing the readout matrix determinant. Applying evolutionary methods to this reservoir system substantially improved separability on an XNOR task, in comparison to implementations with hand-selected parameters. We also applied our approach to a regression task and show that our approach improves out-of-sample accuracy. Results from this study will inform how we interface with the physical reservoir in future work, and we will use these methods to continue to optimize other aspects of the physical implementation of this system as a computational reservoir.1
- 1 January 1994
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 50 (1-2) , 35-44
Accelerating iterative algorithms for symmetric linear complementarity problems
We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.
- 1 January 1994
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 50 (1-2) , 35-44
Accelerating iterative algorithms for symmetric linear complementarity problems
We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.