Marco Leonardi

Dr. Marco Leonardi

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 April 2026 in AI
Verified
Journal Article
Open access
PDF file
LCLorenzo Ciampiconi
Lorenzo Ciampiconi
AEAdam Christopher Elwood
Adam Christopher Elwood
MLMarco Leonardi
Marco Leonardi
AMAshraf Mohamed
Ashraf Mohamed
Alessandro RozzaAlessandro Rozza
Alessandro Rozza
Most state-of-the-art machine learning techniques revolve around the optimization of loss functions, making the choice of an objective critical to model performance and reliability. Although recent reviews discuss loss functions in specific domains or in deep learning settings, there is still no single reference that presents widely used losses across major task families within a unified formal setting and with consistent optimization-relevant property annotations. In this survey, we compile and systematize the most widely adopted loss functions for regression, classification, generative modeling, ranking, energy-based modeling, and relational learning. Our selection procedure combines seeding from foundational textbooks and prior surveys with cross-checking of highly cited literature and common implementations in mainstream machine learning frameworks. We introduce 52 loss functions and organize them into an intuitive taxonomy, summarizing their theoretical motivation, key mathematical properties, and typical application contexts, with compact appendix tables for quick lookup. This survey is intended as a resource for undergraduate, graduate, and Ph.D. students, as well as researchers seeking a structured reference for selecting and comparing loss functions.

2 February 2021 in Sensors
Verified
Journal Article
Open access
PDF file
MLMarco Leonardi
Marco Leonardi
Paolo NapoletanoPaolo Napoletano
Paolo Napoletano
Raimondo SchettiniRaimondo Schettini
Raimondo Schettini
Alessandro RozzaAlessandro Rozza
Alessandro Rozza
We propose an anomaly detection based image quality assessment method which exploits the correlations between feature maps from a pre-trained Convolutional Neural Network (CNN). The proposed method encodes the intra-layer correlation through the Gram matrix and then estimates the quality score combining the average of the correlation and the output from an anomaly detection method. The latter evaluates the degree of abnormality of an image by computing a correlation similarity with respect to a dictionary of pristine images. The effectiveness of the method is tested on different benchmarking datasets (LIVE-itW, KONIQ, and SPAQ).

18 January 2023 in Entropy
Verified
Journal Article
Open access
PDF file
AEAdam Christopher Elwood
Adam Christopher Elwood
MLMarco Leonardi
Marco Leonardi
AMAshraf Mohamed
Ashraf Mohamed
Alessandro RozzaAlessandro Rozza
Alessandro Rozza
Contextual bandits can solve a huge range of real-world problems. However, current popular algorithms to solve them either rely on linear models or unreliable uncertainty estimation in non-linear models, which are required to deal with the exploration–exploitation trade-off. Inspired by theories of human cognition, we introduce novel techniques that use maximum entropy exploration, relying on neural networks to find optimal policies in settings with both continuous and discrete action spaces. We present two classes of models, one with neural networks as reward estimators, and the other with energy based models, which model the probability of obtaining an optimal reward given an action. We evaluate the performance of these models in static and dynamic contextual bandit simulation environments. We show that both techniques outperform standard baseline algorithms, such as NN HMC, NN Discrete, Upper Confidence Bound, and Thompson Sampling, where energy based models have the best overall performance. This provides practitioners with new techniques that perform well in static and dynamic settings, and are particularly well suited to non-linear scenarios with continuous action spaces.

24 January 2024
Verified
Book Chapter
Closed access
PDF file
MLMarco Leonardi
Marco Leonardi
Paolo NapoletanoPaolo Napoletano
Paolo Napoletano
Alessandro RozzaAlessandro Rozza
Alessandro Rozza
Raimondo SchettiniRaimondo Schettini
Raimondo Schettini

8 July 2024 in arXiv
Verified
Preprint
Open access
PDF file
FSFrancesco Emanuele Stradi
Francesco Emanuele Stradi
FCFilippo Cipriani
Filippo Cipriani
LCLorenzo Ciampiconi
Lorenzo Ciampiconi
MLMarco Leonardi
Marco Leonardi
Alessandro RozzaAlessandro Rozza
Alessandro Rozza
NGNicola Gatti
Nicola Gatti
We address the challenging problem of dynamically pricing complementary items that are sequentially displayed to customers. An illustrative example is the online sale of flight tickets, where customers navigate through multiple web pages. Initially, they view the ticket cost, followed by ancillary expenses such as insurance and additional luggage fees. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. Our scenario also involves a sales constraint, which specifies a minimum number of items to sell, and uncertainty regarding customer demand curves. To tackle this problem, we originally formulate it as a Markov Decision Process with constraints. Leveraging online learning tools, we design a primal-dual online optimization algorithm. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, covering various configurations from stationary to non-stationary, and compare its performance in terms of constraints violation and regret against well-known baselines optimizing each state singularly.