Andrea Pisani

Mr. Andrea Pisani

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
22 August 2023 in IEEE Sensors Letters
Verified
Journal Article
Closed access
DPDanilo Pietro Pau
Danilo Pietro Pau
APAndrea Pisani
Andrea Pisani
FAFabrizio Maria Aymone
Fabrizio Maria Aymone
Gianluigi FerrariGianluigi Ferrari
Gianluigi Ferrari
The challenge of deploying neural network learning workloads on ultra-low power tiny devices has recently attracted several machine learning researchers of the TinyML community. A typical on-device learning session processes real-time streams of data acquired by heterogeneous sensors. In such a context, this paper proposes TinyRCE, a forward-only learning approach based on a hyperspherical classifier, which can be deployed on microcontrollers and potentially integrated into the sensor package. TinyRCE is fed with compact features extracted by a convolutional neural network, which can be trained with BP or it can be an extreme learning machine with randomly initialized weights. A forget mechanism has been introduced to discard useless neurons from the hidden layer, since they can become redundant over the time. TinyRCE has been evaluated with a new interleaved learning and testing data protocol to mimic a typical forward on-tiny-device workload. It has been tested with the standard MLCommons Tiny datasets used for KeyWord Spotting and Image Classification, and against the respective neural benchmarks. 95.25% average accuracy was achieved over the former classes (vs. 91.49%) and 87.17% over the latter classes (vs. 100%, caused by overfitting). In terms of complexity, TinyRCE requires 22× less MACC than SoftMax (with 36 epochs) on the former, while it requires 5× more MACC than SoftMax (with 500 epochs) for the latter. Classifier complexity and memory footprint are marginal w.r.t. the Feature Extractor, for training and inference workloads.

5 January 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
DPDanilo Pietro Pau
Danilo Pietro Pau
APAndrea Pisani
Andrea Pisani
ACAntonio Candelieri
Antonio Candelieri
In the context of TinyML, many research efforts have been devoted to designing forward topologies to support On-Device Learning. Reaching this target would bring numerous advantages, including reductions in latency and computational complexity, stronger privacy, data safety and robustness to adversarial attacks, higher resilience against concept drift, etc. However, On-Device Learning on resource constrained devices poses severe limitations to computational power and memory. Therefore, deploying Neural Networks on tiny devices appears to be prohibitive, since their backpropagation-based training is too memory demanding for their embedded assets. Using Extreme Learning Machines based on Convolutional Neural Networks might be feasible and very convenient, especially for Feature Extraction tasks. However, it requires searching for a randomly initialized topology that achieves results as good as those achieved by the backpropagated model. This work proposes a novel approach for automatically composing an Extreme Convolutional Feature Extractor, based on Neural Architecture Search and Bayesian Optimization. It was applied to the CIFAR-10 and MNIST datasets for evaluation. Two search spaces have been defined, as well as a search strategy that has been tested with two surrogate models, Gaussian Process and Random Forest. A performance estimation strategy was defined, keeping the feature set computed by the MLCommons-Tiny benchmark ResNet as a reference model. In as few as 1200 search iterations, the proposed strategy was able to achieve a topology whose extracted features scored a mean square error equal to 0.64 compared to the reference set. Further improvements are required, with a target of at least one order of magnitude decrease in mean square error for improved classification accuracy. The code is made available via GitHub to allow for the reproducibility of the results reported in this paper.


14 October 2024
Verified
Conference Paper
Open access
AAAndrea Alari
Andrea Alari
LCLorenzo Campana
Lorenzo Campana
FCFederico Giuseppe Ciliberto
Federico Giuseppe Ciliberto
SMSaverio Maggese
Saverio Maggese
CSCarlo Sgaravatti
Carlo Sgaravatti
MDMaurizio Ferrari Dacrema
Maurizio Ferrari Dacrema
We provide an overview of the approach used as team FeatureSalad for the ACM RecSys Challenge 2024, organized by Ekstra Bladet. The competition addressed the problem of News Recommendation, where the goal is to predict which article a user will click on given the list of articles that are shown to them. Our solution is based on a stacking ensemble of consolidated algorithms, such as gradient boosting for decision trees and neural networks. It relies on numerous features, which model the interest of a user and the lifecycle of an article. The proposed solution allowed our team to rank first among the academic teams, and sixth overall.

21 September 2025
Verified
Conference Paper
Open access
SCSimone Colecchia
Simone Colecchia
MDMauro Orazio Drago
Mauro Orazio Drago
JFJihad Founoun
Jihad Founoun
PGPaolo Gennaro
Paolo Gennaro
ENErnesto Natuzzi
Ernesto Natuzzi
MDMaurizio Ferrari Dacrema
Maurizio Ferrari Dacrema

2 October 2026
Verified
Conference Paper
Open access
AAAbdallah Alkhetiar
Abdallah Alkhetiar
LILuigi Inguaggiato
Luigi Inguaggiato
NLNicolò Locatelli
Nicolò Locatelli
RMRoberto Manea
Roberto Manea
APAlessio Pizzini
Alessio Pizzini
MDMaurizio Ferrari Dacrema
Maurizio Ferrari Dacrema