arXiv subjects

Federico Benvenuto

Publications and source records attributed to Federico Benvenuto.

At least 19 recordsLinked to original sources

arXiv2025

Weak convergence rates for spectral regularization via sampling inequalities

Convergence rates in spectral regularization methods quantify the approximation error in inverse problems as a function of the noise level or the number of sampling points. Classical strong convergence rate results typically rely on source conditions, which are essential for estimating the truncation error. However, in the framework of kernel approximation, the truncation error in the case of Tikhonov regularization can be characterized entirely through sampling inequalities, without invoking source conditions. In this paper, we first generalize sampling inequalities to spectral regularization, and then, by exploiting the connection between inverse problems and kernel approximation, we derive weak convergence rate bounds for inverse problems, independently of source conditions. These weak convergence rates are established and analyzed when the forward operator is compact and uniformly bounded, or the kernel operator is of trace class.

math.NA↗

arXiv2025

PRESOL: a web-based computational setting for feature-based flare forecasting

Solar flares are the most explosive phenomena in the solar system and the main trigger of the events' chain that starts from Coronal Mass Ejections and leads to geomagnetic storms with possible impacts on the infrastructures at Earth. Data-driven solar flare forecasting relies on either deep learning approaches, which are operationally promising but with a low explainability degree, or machine learning algorithms, which can provide information on the physical descriptors that mostly impact the prediction. This paper describes a web-based technological platform for the execution of a computational pipeline of feature-based machine learning methods that provide predictions of the flare occurrence, feature ranking information, and assessment of the prediction performances.

astro-ph.SR↗

arXiv2025

When algebra twinks system biology: a conjecture on the structure of Gröbner bases in complex chemical reaction networks

We address the challenge of identifying all real positive steady states in chemical reaction networks (CRNs) governed by mass-action kinetics. Traditional numerical methods often require specific initial guesses and may fail to find all the solutions in systems exhibiting multistability. Gröbner bases offer an algebraic framework that systematically transforms polynomial equations into simpler forms, facilitating comprehensive solution enumeration. In this work, we propose a conjecture that CRNs with at most pairwise interactions yield Gröbner bases possessing a near-"triangular" structure, under appropriate assumptions. We illustrate this phenomenon using examples from a gene regulatory network and the Wnt signaling pathway, where the Gröbner basis approach reliably captures all real positive solutions. Our computational experiments reveal the potential of Gröbner bases to overcome limitations of local numerical methods for finding the steady states of complex biological systems, making them a powerful tool for understanding dynamical processes across diverse biochemical models.

q-bio.MN↗

arXiv2025

tiDAS: a time invariant approximation of the Delay and Sum algorithm for biomedical ultrasound PSF reconstructions

Ultrasound imaging is a real-time diagnostic modality that reconstructs acoustic signals into visual representations of internal body structures. A key component in this process is beamforming, with the Delay and Sum (DAS) algorithm being a standard due to its balance between simplicity and effectiveness. However, the computational cost of DAS can be a limiting factor, especially in real-time scenarios where fast frame reconstruction is essential. In this work, we introduce a time-invariant approximation of the DAS algorithm (tiDAS), designed to accelerate the reconstruction process without compromising image quality. By adopting a one-dimensional, row-wise convolutional formulation, tiDAS significantly reduces computational complexity while preserving the core properties of the original model. This approach not only enables faster image reconstruction but also provides a structured foundation for the application of deconvolution methods aimed at enhancing resolution. Synthetic experiments demonstrate that tiDAS achieves a favorable trade-off between speed and accuracy, making it a promising tool for improving the efficiency of real-time ultrasound imaging.

math.NA↗

arXiv2025

AI-based modular warning machine for risk identification in proximity healthcare

"DHEAL-COM - Digital Health Solutions in Community Medicine" is a research and technology project funded by the Italian Department of Health for the development of digital solutions of interest in proximity healthcare. The activity within the DHEAL-COM framework allows scientists to gather a notable amount of multi-modal data whose interpretation can be performed by means of machine learning algorithms. The present study illustrates a general automated pipeline made of numerous unsupervised and supervised methods that can ingest such data, provide predictive results, and facilitate model interpretations via feature identification.

cs.LG↗

arXiv2025

Solving Implicit Inverse Problems with Homotopy-Based Regularization Path

Implicit inverse problems, in which noisy observations of a physical quantity are used to infer a nonlinear functional applied to an associated function, are inherently ill posed and often exhibit non uniqueness of solutions. Such problems arise in a range of domains, including the identification of systems governed by Ordinary and Partial Differential Equations (ODEs/PDEs), optimal control, and data assimilation. Their solution is complicated by the nonlinear nature of the underlying constraints and the instability introduced by noise. In this paper, we propose a homotopy based optimization method for solving such problems. Beginning with a regularized constrained formulation that includes a sparsity promoting regularization term, we employ a gradient based algorithm in which gradients with respect to the model parameters are efficiently computed using the adjoint state method. Nonlinear constraints are handled through a Newton Raphson procedure. By solving a sequence of problems with decreasing regularization, we trace a solution path that improves stability and enables the exploration of multiple candidate solutions. The method is applied to the latent dynamics discovery problem in simulation, highlighting performance as a function of ground truth sparsity and semi convergence behavior.

math.NA↗

arXiv2025

Convergence rates for Tikhonov regularization on compact sets: application to neural networks

In this work, we consider ill-posed inverse problems in which the forward operator is continuous and weakly closed, and the sought solution belongs to a weakly closed constraint set. We propose a regularization method based on minimizing the Tikhonov functional on a sequence of compact sets which is dense in the intersection between the domain of the forward operator and the constraint set. The index of the compact sets can be interpreted as an additional regularization parameter. We prove that the proposed method is a regularization, achieving the same convergence rates as classical Tikhonov regularization and attaining the optimal convergence rate when the forward operator is linear. Moreover, we show that our methodology applies to the case where the constrained solution space is parametrized by means of neural networks (NNs), and the constraint is obtained by composing the last layer of the NN with a suitable activation function. In this case the dense compact sets are defined by taking a family of bounded weight NNs with increasing weight bound. Finally, we present some numerical experiments in the case of Computerized Tomography to compare the theoretical behavior of the reconstruction error with that obtained in a finite dimensional and non-asymptotic setting. The numerical tests also show that our NN-based regularization method is able to provide piece-wise constant solutions and to preserve the sharpness of edges, thus achieving lower reconstruction errors compared to the classical Tikhonov approach for the same level of noise in the data.

math.NA↗

arXiv2025

Physics-informed features in supervised machine learning

Supervised machine learning involves approximating an unknown functional relationship from a limited dataset of features and corresponding labels. The classical approach to feature-based machine learning typically relies on applying linear regression to standardized features, without considering their physical meaning. This may limit model explainability, particularly in scientific applications. This study proposes a physics-informed approach to feature-based machine learning that constructs non-linear feature maps informed by physical laws and dimensional analysis. These maps enhance model interpretability and, when physical laws are unknown, allow for the identification of relevant mechanisms through feature ranking. The method aims to improve both predictive performance in regression tasks and classification skill scores by integrating domain knowledge into the learning process, while also enabling the potential discovery of new physical equations within the context of explainable machine learning.

stat.ML↗

arXiv2024

A stochastic approach to delays optimization for narrowband transmit beam pattern in medical ultrasound

Ultrasound imaging is extensively employed in clinical settings due to its non-ionizing nature and real-time capabilities. The beamformer represents a crucial component of an ultrasound machine, playing a significant role in shaping the ultimate quality of the reconstructed image. Therefore, Transmit Beam Pattern (TBP) optimization is an important task in medical ultrasound, but state-of-the-art TBP optimization has well-known drawbacks like non-uniform beam width over depth, presence of significant side lobes, and quick energy drop out after the focal depth. To overcome these limitations, we developed a novel optimization approach for TBP by focusing the analysis on its narrowband approximation, particularly suited for Acoustic Radiation Force Impulse (ARFI) elastography, and considering transmit delays as free variables instead of linked to a specific focal depth. We formulate the problem as a non linear Least Squares problem to minimize the difference between the TBP corresponding to a set of delays and the desired one, modeled as a 2D rectangular shape elongated in the direction of the beam axis. In order to quantitatively evaluate the results, we define three quality metrics based on main lobe width, side lobe level, and central line power. Results obtained by our synthetic software simulation show that the main lobe width is considerably more intense and uniform over the whole depth range with respect to classical focalized Beam Patterns, and our optimized delay profile results in a combination of standard delay profiles at different focal depths. The application of the proposed method to ARFI elastography shows improvements in the concentration of the ultrasound energy along a desired axis.

math.OC↗

arXiv2024

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↗

arXiv2023

CAESAR: Space Weather archive prototype for ASPIS

The project CAESAR (Comprehensive spAce wEather Studies for the ASPIS prototype Realization) is aimed to tackle all the relevant aspects of Space Weather (SWE) and realize the prototype of the scientific data centre for Space Weather of the Italian Space Agency (ASI) called ASPIS (ASI SPace Weather InfraStructure). This contribution is meant to bring attention upon the first steps in the development of the CAESAR prototype for ASPIS and will focus on the activities of the Node 2000 of CAESAR, the set of Work Packages dedicated to the technical design and implementation of the CAESAR ASPIS archive prototype. The product specifications of the intended resources that will form the archive, functional and system requirements gathered as first steps to seed the design of the prototype infrastructure, and evaluation of existing frameworks, tools and standards, will be presented as well as the status of the project in its initial stage.

astro-ph.IM↗

arXiv2023

A hybrid time-frequency parametric modelling of medical ultrasound signal transmission

Medical ultrasound imaging is the most widespread real-time non-invasive imaging system and its formulation comprises signal transmission, signal reception, and image formation. Ultrasound signal transmission modelling has been formalized over the years through different approaches by exploiting the physics of the associated wave problem. This work proposes a novel computational framework for modelling the ultrasound signal transmission step in the time-frequency domain for a linear-array probe. More specifically, from the impulse response theory defined in the time domain, we derived a parametric model in the corresponding frequency domain, with appropriate approximations for the narrowband case. To validate the model, we implemented a numerical simulator and tested it with synthetic data. Numerical experiments demonstrate that the proposed model is computationally feasible, efficient, and compatible with realistic measurements and existing state-of-the-art simulators. The formulated model can be employed for analyzing how the involved parameters affect the generated beam pattern, and ultimately for optimizing measurement settings in an automatic and systematic way.

math.NA↗

arXiv2023

A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics

In many contexts, customized and weighted classification scores are designed in order to evaluate the goodness of the predictions carried out by neural networks. However, there exists a discrepancy between the maximization of such scores and the minimization of the loss function in the training phase. In this paper, we provide a complete theoretical setting that formalizes weighted classification metrics and then allows the construction of losses that drive the model to optimize these metrics of interest. After a detailed theoretical analysis, we show that our framework includes as particular instances well-established approaches such as classical cost-sensitive learning, weighted cross entropy loss functions and value-weighted skill scores.

cs.LG↗

arXiv2023

Physics-driven machine learning for the prediction of coronal mass ejections' travel times

Coronal Mass Ejections (CMEs) correspond to dramatic expulsions of plasma and magnetic field from the solar corona into the heliosphere. CMEs are scientifically relevant because they are involved in the physical mechanisms characterizing the active Sun. However, more recently CMEs have attracted attention for their impact on space weather, as they are correlated to geomagnetic storms and may induce the generation of Solar Energetic Particles streams. In this space weather framework, the present paper introduces a physics-driven artificial intelligence (AI) approach to the prediction of CMEs travel time, in which the deterministic drag-based model is exploited to improve the training phase of a cascade of two neural networks fed with both remote sensing and in-situ data. This study shows that the use of physical information in the AI architecture significantly improves both the accuracy and the robustness of the travel time prediction.

astro-ph.SR↗

arXiv2023

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↗

arXiv2022

A fast and convergent combined Newton and gradient descent method for computing steady states of chemical reaction networks

In this work we present a fast, globally convergent, iterative algorithm for computing the asymptotically stable states of nonlinear large--scale systems of quadratic autonomous Ordinary Differential Equations (ODEs) modeling, e.g., the dynamic of complex chemical reaction networks. Towards this aim, we reformulate the problem as a box--constrained optimization problem where the roots of a set of nonlinear equations need to be determined. Then, we propose to use a projected Newton's approach combined with a gradient descent algorithm so that every limit point of the sequence generated by the overall algorithm is a stationary point. More importantly, we suggest replacing the standard orthogonal projector with a novel operator that ensures the final solution to satisfy the box constraints while lowering the probability that the intermediate points reached at each iteration belong to the boundary of the box where the Jacobian of the objective function may be singular. The effectiveness of the proposed approach is shown in a practical scenario concerning a chemical reaction network modeling the signaling network of colorectal cancer cells. Specifically, in this scenario the proposed algorithm is proven to be faster and more accurate than a classical dynamical approach where the asymptotically stable states are computed as the limit points of the flux of the Cauchy problem associated with the ODEs system.

math.NA↗

arXiv2022

Operational solar flare forecasting via video-based deep learning

Operational flare forecasting aims at providing predictions that can be used to make decisions, typically at a daily scale, about the space weather impacts of flare occurrence. This study shows that video-based deep learning can be used for operational purposes when the training and validation sets used for the network optimization are generated while accounting for the periodicity of the solar cycle. Specifically, the paper describes an algorithm that can be applied to build up sets of active regions that are balanced according to the flare class rates associated to a specific cycle phase. These sets are used to train and validate a Long-term Recurrent Convolutional Network made of a combination of a convolutional neural network and a Long-Short Memory network. The reliability of this approach is assessed in the case of two prediction windows containing the solar storm of March 2015 and September 2017, respectively.

astro-ph.SR↗

arXiv2022

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↗