SearcharxivSearch

arXiv subjects

Simone Milanesi

Publications and source records attributed to Simone Milanesi.

3 recordsLinked to original sources

An Interval-Score ROC Curve for Assessment, Calibration and Ensembling of Probabilistic Forecasts

Probabilistic forecast evaluation is inherently multi-objective, yet existing proper scoring rules reduce predictive performance to a single scalar value, potentially obscuring the trade-off between forecast concentration and predictive accuracy. We introduce the Interval-Score Receiver Operating Characteristic (IS-ROC) Curve, a graphical framework that represents the complete family of interval forecasts generated by varying prediction tightness. We show that the IS-ROC Curve induced by the data generating process is Pareto optimal and convex, providing a geometric characterization of the optimal forecasting frontier. Building on these properties, we propose a geometry-based calibration procedure based on tangent optimization and convexification, together with an ensemble strategy that combines competing forecasters through convex hull construction. Finally, we provide a practical workflow and numerical examples illustrating forecast comparison, calibration, and ensemble construction within the proposed framework.

stat.ME

Correction of Italian under-reporting in the first COVID-19 wave via age-specific deconvolution of hospital admissions

When the COVID-19 pandemic first emerged in early 2020, healthcare and bureaucratic systems worldwide were caught off guard and largely unprepared to deal with the scale and severity of the outbreak. In Italy, this led to a severe underreporting of infections during the first wave of the spread. The lack of accurate data is critical as it hampers the retrospective assessment of nonpharmacological interventions, the comparison with the following waves, and the estimation and validation of epidemiological models. In particular, during the first wave, reported cases of new infections were strikingly low if compared with their effects in terms of deaths, hospitalizations and intensive care admissions. In this paper, we observe that the hospital admissions during the second wave were very well explained by the convolution of the reported daily infections with an exponential kernel. By formulating the estimation of the actual infections during the first wave as an inverse problem, its solution by a regularization approach is proposed and validated. In this way, it was possible to computed corrected time series of daily infections for each age class. The new estimates are consistent with the serological survey published in June 2020 by the National Institute of Statistics (ISTAT) and can be used to speculate on the total number of infections occurring in Italy during 2020, which appears to be about double the number officially recorded.

stat.AP

Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks

Training neural networks (NNs) using combinatorial optimization solvers has gained attention in recent years. In low-data settings, state-of-the-art mixed integer linear programming solvers can train exactly a NN, avoiding intensive GPU-based training and hyper-parameter tuning and simultaneously training and sparsifying the network. We study the case of few-bit discrete-valued neural networks, both Binarized Neural Networks (BNNs), whose values are restricted to +-1, and Integer Neural Networks (INNs), whose values lie in a range {-P, ..., P}. Few-bit NNs receive increasing recognition due to their lightweight architecture and ability to run on low-power devices. This paper proposes new methods to improve the training of BNNs and INNs. Our contribution is a multi-objective ensemble approach based on training a single NN for each possible pair of classes and applying a majority voting scheme to predict the final output. Our approach results in training robust sparsified networks whose output is not affected by small perturbations on the input and whose number of active weights is as small as possible. We compare this BeMi approach to the current state-of-the-art in solver-based NN training and gradient-based training, focusing on BNN learning in few-shot contexts. We compare the benefits and drawbacks of INNs versus BNNs, bringing new light to the distribution of weights over the {-P, ..., P} interval. Finally, we compare multi-objective versus single-objective training of INNs, showing that robustness and network simplicity can be acquired simultaneously, thus obtaining better test performances. While the previous state-of-the-art approaches achieve an average accuracy of 51.1% on the MNIST dataset, the BeMi ensemble approach achieves an average accuracy of 68.4% when trained with 10 images per class and 81.8% when trained with 40 images per class, having up to 75.3% NN links removed.

math.OC