Pietro Coretto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pietro Coretto has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Christian Hennig
Università di Bologna
5 shared publications Francesco Giordano
University of Salerno
2 shared publications- Giuseppe Storti
Department of Economics and Statistics University of Salerno
2 shared publications - Luca Coraggio
University of Naples Federico II
2 shared publications - Michele La Rocca
University of Salerno
2 shared publications - Alfonso Peluso
University of Salerno
1 shared publication
Latest Publications
- Open Access
- 19 June 2026
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 20 (3) , 1-7
Discussion of “Independent component analysis by robust distance correlation”: a note on the geometry of the bowl transform and on the reach of the consistency for robust ICA
This is a discussion of PICARD, the robust independent component analysis (ICA) estimator built on a transformed distance correlation and on the bowl transform. I develop two threads. The first reads the bowl transform as a multivariate redescending $$\psi$$ -function, makes its exponential decay explicit, and describes how the transformed norm concentrates as the dimension grows. The second examines the reach of the strong-consistency result, relating its population target to classical ICA identifiability and to the behavior of robust whitening under non-elliptical sources.- 19 June 2026
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 20 (3) , 1-7
Open AccessDiscussion of “Independent component analysis by robust distance correlation”: a note on the geometry of the bowl transform and on the reach of the consistency for robust ICA
This is a discussion of PICARD, the robust independent component analysis (ICA) estimator built on a transformed distance correlation and on the bowl transform. I develop two threads. The first reads the bowl transform as a multivariate redescending $$\psi$$ -function, makes its exponential decay explicit, and describes how the transformed norm concentrates as the dimension grows. The second examines the reach of the strong-consistency result, relating its population target to classical ICA identifiability and to the behavior of robust whitening under non-elliptical sources. - Open Access
- 25 November 2025
- Published by Alma Mater Studiorum Università di Bologna in Statistica
- Vol. 84 (2) , 105-106
Discussion of the Paper "Connecting Model-Based and Model-Free Approaches to Linear Least Squares Regression" by Lutz Dümbgen and Laurie Davies (2024)
- 25 November 2025
- Published by Alma Mater Studiorum Università di Bologna in Statistica
- Vol. 84 (2) , 105-106
Open AccessDiscussion of the Paper "Connecting Model-Based and Model-Free Approaches to Linear Least Squares Regression" by Lutz Dümbgen and Laurie Davies (2024)
- 17 June 2025
- Published by Springer Nature
- p. 182-188
OPeDi-Carriere: A New App to Monitor Students’ Performance
- 17 June 2025
- Published by Springer Nature
- p. 182-188
OPeDi-Carriere: A New App to Monitor Students’ Performance
- 6 December 2024
- Published by The R Foundation
qcluster: Clustering via Quadratic Scoring
- Open Access
- 31 October 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (21) , 3417
Asymptotic Results for the Estimation of the Quadratic Score of a Clustering
In cluster analysis one often finds several partitions of a data set using different clustering methods and algorithms set with a variety of hyperparameters and tunings. The number of clusters K is one of the most relevant of such hyperparameters. Cluster selection is the task of choosing the desired partitions. The Bootstrap Quadratic Scoring is a recently introduced method where the cluster selection is performed by optimizing a score attached to a partition that is based on the quadratic discriminant function. Previously, we proposed the estimation of this cluster score via bootstrap resampling and investigated the proposed estimator based on numerical experiments and real data applications. However, that earlier work did not provide theoretical guarantees. In this paper, we fill that gap. We study the asymptotic behavior of the scoring method and show that the proposed estimator converges to well-defined population counterparts.
- 31 October 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (21) , 3417
Open AccessAsymptotic Results for the Estimation of the Quadratic Score of a Clustering
In cluster analysis one often finds several partitions of a data set using different clustering methods and algorithms set with a variety of hyperparameters and tunings. The number of clusters K is one of the most relevant of such hyperparameters. Cluster selection is the task of choosing the desired partitions. The Bootstrap Quadratic Scoring is a recently introduced method where the cluster selection is performed by optimizing a score attached to a partition that is based on the quadratic discriminant function. Previously, we proposed the estimation of this cluster score via bootstrap resampling and investigated the proposed estimator based on numerical experiments and real data applications. However, that earlier work did not provide theoretical guarantees. In this paper, we fill that gap. We study the asymptotic behavior of the scoring method and show that the proposed estimator converges to well-defined population counterparts.
- 14 December 2021
- Published by Springer Nature
- p. 169-174
A GARCH-Type Model with Cross-Sectional Volatility Clusters
- 14 December 2021
- Published by Springer Nature
- p. 169-174
A GARCH-Type Model with Cross-Sectional Volatility Clusters
- Open Access
- 3 September 2021
- Published by Wiley in Australian & New Zealand Journal of Statistics
- Vol. 64 (2) , 230-254
An adequacy approach for deciding the number of clusters for OTRIMLE robust Gaussian mixture‐based clustering
Summary: We introduce a new approach to deciding the number of clusters. The approach is applied to Optimally Tuned Robust Improper Maximum Likelihood Estimation (OTRIMLE; Coretto & Hennig, Journal of the American Statistical Association 111, 1648–1659) of a Gaussian mixture model allowing for observations to be classified as ‘noise’, but it can be applied to other clustering methods as well. The quality of a clustering is assessed by a statistic Q that measures how close the within‐cluster distributions are to elliptical unimodal distributions that have the only mode in the mean. This non‐parametric measure allows for non‐Gaussian clusters as long as they have a good quality according to Q. The simplicity of a model is assessed by a measure S that prefers a smaller number of clusters unless additional clusters can reduce the estimated noise proportion substantially. The simplest model is then chosen that is adequate for the data in the sense that its observed value of Q is not significantly larger than what is expected for data truly generated from the fitted model, as can be assessed by parametric bootstrap. The approach is compared with model‐based clustering using the Bayesian information criterion (BIC) and the integrated complete likelihood (ICL) in a simulation study and on two real data sets.
- 3 September 2021
- Published by Wiley in Australian & New Zealand Journal of Statistics
- Vol. 64 (2) , 230-254
Open AccessAn adequacy approach for deciding the number of clusters for OTRIMLE robust Gaussian mixture‐based clustering
Summary: We introduce a new approach to deciding the number of clusters. The approach is applied to Optimally Tuned Robust Improper Maximum Likelihood Estimation (OTRIMLE; Coretto & Hennig, Journal of the American Statistical Association 111, 1648–1659) of a Gaussian mixture model allowing for observations to be classified as ‘noise’, but it can be applied to other clustering methods as well. The quality of a clustering is assessed by a statistic Q that measures how close the within‐cluster distributions are to elliptical unimodal distributions that have the only mode in the mean. This non‐parametric measure allows for non‐Gaussian clusters as long as they have a good quality according to Q. The simplicity of a model is assessed by a measure S that prefers a smaller number of clusters unless additional clusters can reduce the estimated noise proportion substantially. The simplest model is then chosen that is adequate for the data in the sense that its observed value of Q is not significantly larger than what is expected for data truly generated from the fitted model, as can be assessed by parametric bootstrap. The approach is compared with model‐based clustering using the Bayesian information criterion (BIC) and the integrated complete likelihood (ICL) in a simulation study and on two real data sets.
- Open Access
- 25 July 2021
- Published by Springer Nature in Statistical Methods & Applications
- Vol. 31 (2) , 427-458
Estimation and computations for Gaussian mixtures with uniform noise under separation constraints
In this paper we study a finite Gaussian mixture model with an additional uniform component that has the role to catch points in the tails of the data distribution. An adaptive constraint enforces a certain level of separation between the Gaussian mixture components and the uniform component representing noise and outliers in the tail of the distribution. The latter makes the proposed tool particularly useful for robust estimation and outlier identification. A constrained ML estimator is introduced for which existence and consistency is shown. One of the attractive features of the methodology is that the noise level is estimated from data. We also develop an EM-type algorithm with proven convergence. Based on numerical evidence we show how the methods developed in this paper are useful for several fundamental data analysis tasks: outlier identification, robust location-scale estimation, clustering, and density estimation.
- 25 July 2021
- Published by Springer Nature in Statistical Methods & Applications
- Vol. 31 (2) , 427-458
Open AccessEstimation and computations for Gaussian mixtures with uniform noise under separation constraints
In this paper we study a finite Gaussian mixture model with an additional uniform component that has the role to catch points in the tails of the data distribution. An adaptive constraint enforces a certain level of separation between the Gaussian mixture components and the uniform component representing noise and outliers in the tail of the distribution. The latter makes the proposed tool particularly useful for robust estimation and outlier identification. A constrained ML estimator is introduced for which existence and consistency is shown. One of the attractive features of the methodology is that the noise level is estimated from data. We also develop an EM-type algorithm with proven convergence. Based on numerical evidence we show how the methods developed in this paper are useful for several fundamental data analysis tasks: outlier identification, robust location-scale estimation, clustering, and density estimation.
- Open Access
- 29 March 2020
- Published by MDPI AG in Journal of Risk and Financial Management
- Vol. 13 (4) , 64
Improving Many Volatility Forecasts Using Cross-Sectional Volatility Clusters
The inhomogeneity of the cross-sectional distribution of realized assets’ volatility is explored and used to build a novel class of GARCH (Generalized Autoregressive Conditional Heteroskedasticity) models. The inhomogeneity of the cross-sectional distribution of realized volatility is captured by a finite Gaussian mixture model plus a uniform component that represents abnormal variations in volatility. Based on the cross-sectional mixture model, at each time point, memberships of assets to risk groups are retrieved via maximum likelihood estimation, as well as the probability that an asset belongs to a specific risk group. The latter is profitably used for specifying a state-dependent model for volatility forecasting. We propose novel GARCH-type specifications the parameters of which act “clusterwise” conditional on past information on the volatility clusters. The empirical performance of the proposed models is assessed by means of an application to a panel of U.S. stocks traded on the NYSE. An extensive forecasting experiment shows that, when the main goal is to improve overall many univariate volatility forecasts, the method proposed in this paper has some advantages over the state-of-the-arts methods.
- 29 March 2020
- Published by MDPI AG in Journal of Risk and Financial Management
- Vol. 13 (4) , 64
Open AccessImproving Many Volatility Forecasts Using Cross-Sectional Volatility Clusters
The inhomogeneity of the cross-sectional distribution of realized assets’ volatility is explored and used to build a novel class of GARCH (Generalized Autoregressive Conditional Heteroskedasticity) models. The inhomogeneity of the cross-sectional distribution of realized volatility is captured by a finite Gaussian mixture model plus a uniform component that represents abnormal variations in volatility. Based on the cross-sectional mixture model, at each time point, memberships of assets to risk groups are retrieved via maximum likelihood estimation, as well as the probability that an asset belongs to a specific risk group. The latter is profitably used for specifying a state-dependent model for volatility forecasting. We propose novel GARCH-type specifications the parameters of which act “clusterwise” conditional on past information on the volatility clusters. The empirical performance of the proposed models is assessed by means of an application to a panel of U.S. stocks traded on the NYSE. An extensive forecasting experiment shows that, when the main goal is to improve overall many univariate volatility forecasts, the method proposed in this paper has some advantages over the state-of-the-arts methods.