SearcharxivSearch

arXiv subjects

Emma Perracchione

Publications and source records attributed to Emma Perracchione.

At least 19 recordsLinked to original sources

Kriging via variably scaled kernels

Classical Gaussian processes and Kriging models are commonly based on stationary kernels, whereby correlations between observations depend exclusively on the relative distance between scattered data. While this assumption ensures analytical tractability, it limits the ability of Gaussian processes to represent heterogeneous correlation structures. In this work, we investigate variably scaled kernels as an effective tool for constructing non-stationary Gaussian processes by explicitly modifying the correlation structure of the data. Through a scaling function, variably scaled kernels alter the correlations between data and enable the modeling of targets exhibiting abrupt changes or discontinuities. We analyse the resulting predictive uncertainty via the variably scaled kernel power function and clarify the relationship between variably scaled kernels-based constructions and classical non-stationary kernels. Numerical experiments demonstrate that variably scaled kernels-based Gaussian processes yield improved reconstruction accuracy and provide uncertainty estimates that reflect the underlying structure of the data

stat.ML

Feature Understanding and Sparsity Enhancement via 2-Layered kernel machines (2L-FUSE)

We propose a novel sparsity enhancement strategy for regression tasks, based on learning a data-adaptive kernel metric, i.e., a shape matrix, through 2-Layered kernel machines. The resulting shape matrix, which defines a Mahalanobis-type deformation of the input space, is then factorized via an eigen-decomposition, allowing us to identify the most informative directions in the space of features. This data-driven approach provides a flexible, interpretable and accurate feature reduction scheme. Numerical experiments on synthetic and applications to real datasets of geomagnetic storms demonstrate that our approach achieves minimal yet highly informative feature sets without losing predictive performance.

math.NA

Variably Scaled Kernels for the regularized solution of the parametric Fourier imaging problem

We address the problem of approximating parametric Fourier imaging problems via interpolation/ extrapolation algorithms that impose smoothing constraints across contiguous values of the parameter. Previous works already proved that interpolating via Variably Scaled Kernels (VSKs) the scattered observations in the Fourier domain and then defining the sought approximation via the projected Landweber iterative scheme, turns out to be effective. This study provides new theoretical insights, including error bounds in the image space and properties of the projected Landweber iterative scheme, both influenced by the choice of the scaling function, which characterizes the VSK basis. Such bounds then suggest a smarter solution for the definition of the scaling functions. Indeed, by means of VSKs, the information coded in an image reconstructed for a given parameter is transferred during the reconstruction process to a contiguous parameter value. Benchmark test cases in the field of astronomical imaging, numerically show that the proposed scheme is able to regularize along the parameter direction, thus proving reliable and interpretable results.

math.NA

A Recipe for Learning Variably Scaled Kernels via Discontinuous Neural Networks

The efficacy of interpolating via Variably Scaled Kernels (VSKs) is known to be dependent on the definition of a proper scaling function, but no numerical recipes to construct it are available. Previous works suggest that such a function should mimic the target one, but no theoretical evidence is provided. This paper fills both the gaps: it proves that a scaling function reflecting the target one may lead to enhanced approximation accuracy, and it provides a user-independent tool for learning the scaling function by means of Discontinuous Neural Networks ($δ$NN), i.e., NNs able to deal with possible discontinuities. Numerical evidence supports our claims, as it shows that the key features of the target function can be clearly recovered in the learned scaling function.

math.NA

RIS: Regularized Imaging Spectroscopy for STIX on-board Solar Orbiter

Imaging spectroscopy, i.e., the generation of spatially resolved count spectra and of cubes of count maps at different energies, is one of the main goals of solar hard X-ray missions based on Fourier imaging. For these telescopes, so far imaging spectroscopy has been realized via the generation of either count maps independently reconstructed at the different energy channels, or electron flux maps reconstructed via deconvolution of the bremsstrahlung cross-section. Our aim is to introduce the Regularized Imaging Spectroscopy method (RIS), in which regularization implemented in the count space imposes a smoothing constraint across contiguous energy channels, without the need to deconvolve the bremsstrahlung effect. STIX records imaging data computing visibilities in the spatial frequency domain. Our RIS is a sequential scheme in which part of the information coded in the image reconstructed at a specific energy channel is transferred to the reconstruction process at a contiguous channel via visibility interpolation based on Variably Scaled Kernels. In the case of STIX visibilities recorded during the November 11, 2022 flaring event, we show that RIS is able to generate hard X-ray maps whose morphology smoothly evolves from one energy channel to the contiguous one, and that from these maps it is possible to infer spatially-resolved count spectra characterized by notable numerical stability. We also show that the performances of this approach are robust with respect to both the image reconstruction method and the count energy channel utilized to trigger the sequential process. RIS is appropriate to construct image cubes from STIX visibilities that are characterized by a smooth behavior across count energies, thus allowing the generation of numerically stable (and, thus, physically reliable) local count spectra.

astro-ph.SR

Forecasting Geoffective Events from Solar Wind Data and Evaluating the Most Predictive Features through Machine Learning Approaches

This study addresses the prediction of geomagnetic disturbances by exploiting machine learning techniques. Specifically, the Long-Short Term Memory recurrent neural network, which is particularly suited for application over long time series, is employed in the analysis of in-situ measurements of solar wind plasma and magnetic field acquired over more than one solar cycle, from $2005$ to $2019$, at the Lagrangian point L$1$. The problem is approached as a binary classification aiming to predict one hour in advance a decrease in the SYM-H geomagnetic activity index below the threshold of $-50$ nT, which is generally regarded as indicative of magnetospheric perturbations. The strong class imbalance issue is tackled by using an appropriate loss function tailored to optimize appropriate skill scores in the training phase of the neural network. Beside classical skill scores, value-weighted skill scores are then employed to evaluate predictions, suitable in the study of problems, such as the one faced here, characterized by strong temporal variability. For the first time, the content of magnetic helicity and energy carried by solar transients, associated with their detection and likelihood of geo-effectiveness, were considered as input features of the network architecture. Their predictive capabilities are demonstrated through a correlation-driven feature selection method to rank the most relevant characteristics involved in the neural network prediction model. The optimal performance of the adopted neural network in properly forecasting the onset of geomagnetic storms, which is a crucial point for giving real warnings in an operational setting, is finally showed.

physics.space-ph

Greedy feature selection: Classifier-dependent feature selection via greedy methods

The purpose of this study is to introduce a new approach to feature ranking for classification tasks, called in what follows greedy feature selection. In statistical learning, feature selection is usually realized by means of methods that are independent of the classifier applied to perform the prediction using that reduced number of features. Instead, greedy feature selection identifies the most important feature at each step and according to the selected classifier. In the paper, the benefits of such scheme are investigated theoretically in terms of model capacity indicators, such as the Vapnik-Chervonenkis (VC) dimension or the kernel alignment, and tested numerically by considering its application to the problem of predicting geo-effective manifestations of the active Sun.

stat.ML

Identifying synergies between VLBI and STIX imaging

Reconstructing an image from sparsely sampled Fourier data is an ill-posed inverse problem that occurs in a variety of subjects within science, including the data analysis for Very Long Baseline Interferometry (VLBI) and the Spectrometer/Telescope for Imaging X-rays (STIX) for solar observations. Despite ongoing parallel developments of novel imaging algorithms, synergies remain unexplored. We study the synergies between the data analysis for the STIX instrument and VLBI, compare the methodologies and evaluate their potential. In this way, we identify key trends in the performance of several algorithmic ideas and draw recommendations for the future. To this end, we organized a semi-blind imaging challenge with data sets and source structures that are typical for sparse VLBI, specifically in the context of the Event Horizon Telescope (EHT), and for STIX observations. 17 different algorithms from both communities, from 6 different imaging frameworks, participated in the challenge, marking this work the largest scale code comparisons for STIX and VLBI to date. Strong synergies between the two communities have been identified, as can be proven by the success of the imaging methods proposed for STIX in imaging VLBI data sets and vice versa. Novel imaging methods outperform the standard CLEAN algorithm significantly in every test-case. Improvements over the performance of CLEAN make deeper updates to the inverse modeling pipeline necessary, or consequently replacing inverse modeling with forward modeling. Entropy-based and Bayesian methods perform best on STIX data. The more complex imaging algorithms utilizing multiple regularization terms (recently proposed for VLBI) add little to no additional improvements for STIX, but outperform the other methods on EHT data. This work demonstrates the great synergy between the STIX and VLBI imaging efforts and the great potential for common developments.

astro-ph.IM

AI-FLARES: Artificial Intelligence for the Analysis of Solar Flares Data

AI-FLARES (Artificial Intelligence for the Analysis of Solar Flares Data) is a research project funded by the Agenzia Spaziale Italiana and by the Istituto Nazionale di Astrofisica within the framework of the ``Attività di Studio per la Comunità Scientifica Nazionale Sole, Sistema Solare ed Esopianeti'' program. The topic addressed by this project was the development and use of computational methods for the analysis of remote sensing space data associated to solar flare emission. This paper overviews the main results obtained by the project, with specific focus on solar flare forecasting, reconstruction of morphologies of the flaring sources, and interpretation of acceleration mechanisms triggered by solar flares.

astro-ph.SR

Unbiased CLEAN for STIX in Solar Orbiter

Aims: To formulate, implement, and validate a user-independent release of CLEAN for Fourier-based image reconstruction of hard X-rays flaring sources. Methods: CLEAN is an iterative deconvolution method for radio and hard X-ray solar imaging. In a specific step of its pipeline, CLEAN requires the convolution between an idealized version of the instrumental Point Spread Function (PSF), and a map collecting point sources located at positions on the solar disk from where most of the flaring radiation is emitted. This convolution step has highly heuristic motivations and the shape of the idealized PSF, which depends on the user's choice, impacts the shape of the overall reconstruction. Here we propose the use of an interpolation/extrapolation process to avoid this user-dependent step, and to realize a completely unbiased version of CLEAN. Results: Applications to observations recorded by the Spectrometer/Telescope for Imaging X-rays (STIX) on-board Solar Orbiter show that this unbiased release of CLEAN outperforms the standard version of the algorithm in terms of both automation and reconstruction reliability, with reconstructions whose accuracy is in line with the one offered by other imaging methods developed in the STIX framework. Conclusions: This unbiased version of CLEAN proposes a feasible solution to a well-known open issue concerning CLEAN, i.e., its low degree of automation. Further, this study provided the first application of an interpolation/extrapolation approach to image reconstruction from STIX experimental visibilities.

astro-ph.IM

Mapped Variably Scaled Kernels: Applications to Solar Imaging

Variably scaled kernels and mapped bases constructed via the so-called fake nodes approach are two different strategies to provide adaptive bases for function interpolation. In this paper, we focus on kernel-based interpolation and we present what we call mapped variably scaled kernels, which take advantage of both strategies. We present some theoretical analysis and then we show their efficacy via numerical experiments. Moreover, we test such a new basis for image reconstruction tasks in the framework of hard X-ray astronomical imaging.

math.NA

STIX imaging I -- Concept

Aims. To provide a schematic mathematical description of the imaging concept of the Spectrometer/Telescope for Imaging X-rays (STIX) on board Solar Orbiter. The derived model is the fundamental starting point for both the interpretation of STIX data and the description of the data calibration process. Methods. We describe the STIX indirect imaging technique which is based on spatial modulation of the X-ray photon flux by means of tungsten grids. We show that each of 30 STIX imaging sub-collimators measures a complex Fourier component of the flaring X-ray source corresponding to a specific angular frequency. We also provide details about the count distribution model, which describes the relationship between the photon flux and the measured pixel counts. Results. We define the image reconstruction problem for STIX from both visibilities and photon counts. We provide an overview of the algorithms implemented for the solution of the imaging problem, and a comparison of the results obtained with these different methods in the case of the SOL2022-03-31T18 flaring event.

astro-ph.IM

Data-driven kernel designs for optimized greedy schemes: A machine learning perspective

Thanks to their easy implementation via Radial Basis Functions (RBFs), meshfree kernel methods have been proved to be an effective tool for e.g. scattered data interpolation, PDE collocation, classification and regression tasks. Their accuracy might depend on a length scale hyperparameter, which is often tuned via cross validation schemes. Here we leverage approaches and tools from the machine learning community to introduce two-layered kernel machines, which generalize the classical RBF approaches that rely on a single hyperparameter. Indeed, the proposed learning strategy returns a kernel that is optimized not only in the Euclidean directions, but that further incorporates kernel rotations. The kernel optimization is shown to be robust by using recently improved calculations of cross validation scores. Finally, the use of greedy approaches, and specifically of the Vectorial Kernel Orthogonal Greedy Algorithm (VKOGA), allows us to construct an optimized basis that adapts to the data. Beyond a rigorous analysis on the convergence of the so-constructed two-Layered (2L)-VKOGA, its benefits are highlighted on both synthesized and real benchmark data sets.

math.NA

Interpolation with the polynomial kernels

The polynomial kernels are widely used in machine learning and they are one of the default choices to develop kernel-based classification and regression models. However, they are rarely used and considered in numerical analysis due to their lack of strict positive definiteness. In particular they do not enjoy the usual property of unisolvency for arbitrary point sets, which is one of the key properties used to build kernel-based interpolation methods. This paper is devoted to establish some initial results for the study of these kernels, and their related interpolation algorithms, in the context of approximation theory. We will first prove necessary and sufficient conditions on point sets which guarantee the existence and uniqueness of an interpolant. We will then study the Reproducing Kernel Hilbert Spaces (or native spaces) of these kernels and their norms, and provide inclusion relations between spaces corresponding to different kernel parameters. With these spaces at hand, it will be further possible to derive generic error estimates which apply to sufficiently smooth functions, thus escaping the native space. Finally, we will show how to employ an efficient stable algorithm to these kernels to obtain accurate interpolants, and we will test them in some numerical experiment. After this analysis several computational and theoretical aspects remain open, and we will outline possible further research directions in a concluding section. This work builds some bridges between kernel and polynomial interpolation, two topics to which the authors, to different extents, have been introduced under the supervision or through the work of Stefano De Marchi. For this reason, they wish to dedicate this work to him in the occasion of his 60th birthday.

math.NA

Forward-fitting STIX visibilities

Aima. To determine to what extent the problem of forward fitting visibilities measured by the Spectrometer/Telescope Imaging X-rays (STIX) on-board Solar Orbiter is more challenging with respect to the same problem in the case of previous hard X-ray solar imaging missions; to identify an effective optimization scheme for parametric imaging for STIX. Methods. This paper introduces a Particle Swarm Optimization (PSO) algorithm for forward fitting STIX visibilities and compares its effectiveness with respect to the standard simplex-based optimization algorithm used so far for the analysis of visibilities measured by the Reuven Ramaty High Energy Solar Spectroscopic Imager (RHESSI). This comparison is made by considering experimental visibilities measured by both RHESSI and STIX, and synthetic visibilities generated by accounting for the STIX signal formation model. Results. We found out that the parametric imaging approach based on PSO is as reliable as the one based on the simplex method in the case of RHESSI visibilities. However, PSO is significantly more robust when applied to STIX simulated and experimental visibilities. Conclusions. Standard deterministic optimization is not effective enough for forward-fitting the few visibilities sampled by STIX in the angular frequency plane. Therefore a more sofisticated optimization scheme must be introduced for parametric imaging in the case of the Solar Orbiter X-ray telescope. The forward-fitting routine based on PSO we introduced in this paper proved to be significantly robust and reliable, and could be considered as an effective candidate tool for parametric imaging in the STIX context.

astro-ph.SR

First hard X-ray imaging results by Solar Orbiter STIX

Context. The Spectrometer/Telescope for Imaging X-rays (STIX) is one of 6 remote sensing instruments on-board Solar Orbiter. It provides hard X-ray imaging spectroscopy of solar flares by sampling the Fourier transform of the incoming flux. Aims. To show that the visibility amplitude and phase calibration of 24 out of 30 STIX sub-collimators is well advanced and that a set of imaging methods is able to provide the first hard X-ray images of the flaring Sun from Solar Orbiter. Methods. We applied four visibility-based image reconstruction methods and a count-based one to calibrated STIX observations. The resulting reconstructions are compared to those provided by an optimization algorithm used for fitting the amplitudes of STIX visibilities. Results. When applied to six flares with GOES class between C4 and M4 which occurred in May 2021, the five imaging methods produce results morphologically consistent with the ones provided by the Atmospheric Imaging Assembly on-board the Solar Dynamic Observatory (SDO/AIA) in UV wavelengths. The $χ^2$ values and the parameters of the reconstructed sources are comparable between methods, thus confirming their robustness. Conclusions. This paper shows that the current calibration of the main part of STIX sub-collimators has reached a satisfactory level for scientific data exploitation, and that the imaging algorithms already available in the STIX data analysis software provide reliable and robust reconstructions of the morphology of solar flares.

astro-ph.SR

Greedy algorithms for learning via exponential-polynomial splines

Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and consequent oscillations of the approximant. To partially overcome this issue, we introduce two algorithms which perform an adaptive selection of the spline interpolation points based on the minimization either of the sample residuals ($f$-greedy), or of an upper bound for the approximation error based on the spline Lebesgue function ($λ$-greedy). Both methods allow us to obtain an adaptive selection of the sampling points, i.e. the spline nodes. However, while the {$f$-greedy} selection is tailored to one specific target function, the $λ$-greedy algorithm is independent of the function values and enables us to define a priori optimal interpolation nodes.

math.NA

Imaging from STIX visibility amplitudes

Aims: To provide the first demonstration of STIX Fourier-transform X-ray imaging using semi-calibrated (amplitude-only) visibility data acquired during the Solar Orbiter's cruise phase. Methods: We use a parametric imaging approach by which STIX visibility amplitudes are fitted by means of two non-linear optimization methods: a fast meta-heuristic technique inspired by social behavior, and a Bayesian Monte Carlo sampling method, which, although slower, provides better quantification of uncertainties. Results: When applied to a set of solar flare visibility amplitudes recorded by STIX on November 18, 2020 the two parametric methods provide very coherent results. The analysis also demonstrates the ability of STIX to reconstruct high time resolution information and, from a spectral viewpoint, shows the reliability of a double-source scenario consistent with a thermal versus nonthermal interpretation. Conclusions: In this preliminary analysis of STIX imaging based only on visibility amplitudes, we formulate the imaging problem as a non-linear parametric issue we addressed by means of two high-performance optimization techniques that both showed the ability to sample the parametric space in an effective fashion, thus avoiding local minima.

astro-ph.SR