Francesco Della Santa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Francesco Della Santa has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Sandra Pieraccini
Dipartimento di Ingegneria Meccanica e Aerospaziale, Politecnico di Torino, Turin, Italy
5 shared publications - Francesco Vaccarino
Politecnico di Torino
4 shared publications - Antonio Mastropietro
University of Pisa
3 shared publications - Stefano Berrone
Dipartimento di Scienze Matematiche "G. L. Lagrange " Politecnico di Torino 10129 TO
3 shared publications - Andrea Piano
Energy Department, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy
2 shared publications Alessandro De Gregorio
1 shared publication
Latest Publications
- Open Access
- 3 February 2026
- Published by Elsevier in Neural Networks
- Vol. 199, 108681
Gradient-informed neural networks: Embedding prior beliefs for learning in low-data scenarios
- 3 February 2026
- Published by Elsevier in Neural Networks
- Vol. 199, 108681
Open AccessGradient-informed neural networks: Embedding prior beliefs for learning in low-data scenarios
- Open Access
- 10 January 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 519
Graph-instructed neural networks for sparse grid-based discontinuity detectors
- 10 January 2026
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 519
Open AccessGraph-instructed neural networks for sparse grid-based discontinuity detectors
- Open Access
- 30 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 482
A linear programming framework and an improved backtracking strategy for multiple-gradient descent
- 30 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 482
Open AccessA linear programming framework and an improved backtracking strategy for multiple-gradient descent
- Open Access
- 2 January 2025
- Published by Elsevier in Journal of Computational Science
- Vol. 85
Edge-Wise Graph-Instructed Neural Networks
- 2 January 2025
- Published by Elsevier in Journal of Computational Science
- Vol. 85
Open AccessEdge-Wise Graph-Instructed Neural Networks
- Open Access
GradINN: Gradient Informed Neural Network
We propose Gradient Informed Neural Networks (GradINNs), a methodology inspired by Physics Informed Neural Networks (PINNs) that can be used to efficiently approximate a wide range of physical systems for which the underlying governing equations are completely unknown or cannot be defined, a condition that is often met in complex engineering problems. GradINNs leverage prior beliefs about a system's gradient to constrain the predicted function's gradient across all input dimensions. This is achieved using two neural networks: one modeling the target function and an auxiliary network expressing prior beliefs, e.g., smoothness. A customized loss function enables training the first network while enforcing gradient constraints derived from the auxiliary network. We demonstrate the advantages of GradINNs, particularly in low-data regimes, on diverse problems spanning non time-dependent systems (Friedman function, Stokes Flow) and time-dependent systems (Lotka-Volterra, Burger's equation). Experimental results showcase strong performance compared to standard neural networks and PINN-like approaches across all tested scenarios.
Open AccessGradINN: Gradient Informed Neural Network
We propose Gradient Informed Neural Networks (GradINNs), a methodology inspired by Physics Informed Neural Networks (PINNs) that can be used to efficiently approximate a wide range of physical systems for which the underlying governing equations are completely unknown or cannot be defined, a condition that is often met in complex engineering problems. GradINNs leverage prior beliefs about a system's gradient to constrain the predicted function's gradient across all input dimensions. This is achieved using two neural networks: one modeling the target function and an auxiliary network expressing prior beliefs, e.g., smoothness. A customized loss function enables training the first network while enforcing gradient constraints derived from the auxiliary network. We demonstrate the advantages of GradINNs, particularly in low-data regimes, on diverse problems spanning non time-dependent systems (Friedman function, Stokes Flow) and time-dependent systems (Lotka-Volterra, Burger's equation). Experimental results showcase strong performance compared to standard neural networks and PINN-like approaches across all tested scenarios.
- Open Access
- 17 April 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (8) , 1201
Automatic Differentiation-Based Multi-Start for Gradient-Based Optimization Methods
In global optimization problems, diversification approaches are often necessary to overcome the convergence toward local optima. One approach is the multi-start method, where a set of different starting configurations are taken into account to designate the best local minimum returned by the multiple optimization procedures as the (possible) global optimum. Therefore, parallelization is crucial for multi-start. In this work, we present a new multi-start approach for gradient-based optimization methods that exploits the reverse Automatic Differentiation to perform efficiently. In particular, for each step, this Automatic Differentiation-based method is able to compute the N gradients of N optimization procedures extremely quickly, exploiting the implicit parallelization guaranteed by the computational graph representation of the multi-start problem. The practical advantages of the proposed method are illustrated by analyzing the time complexity from a theoretical point of view and showing numerical examples where the speed-up is between and , with respect to classic parallelization methods. Moreover, we show that our AD-based multi-start approach can be implemented by using tailored shallow Neural Networks, taking advantage of the built-in optimization procedures of the Deep Learning frameworks.- 17 April 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (8) , 1201
Open AccessAutomatic Differentiation-Based Multi-Start for Gradient-Based Optimization Methods
In global optimization problems, diversification approaches are often necessary to overcome the convergence toward local optima. One approach is the multi-start method, where a set of different starting configurations are taken into account to designate the best local minimum returned by the multiple optimization procedures as the (possible) global optimum. Therefore, parallelization is crucial for multi-start. In this work, we present a new multi-start approach for gradient-based optimization methods that exploits the reverse Automatic Differentiation to perform efficiently. In particular, for each step, this Automatic Differentiation-based method is able to compute the N gradients of N optimization procedures extremely quickly, exploiting the implicit parallelization guaranteed by the computational graph representation of the multi-start problem. The practical advantages of the proposed method are illustrated by analyzing the time complexity from a theoretical point of view and showing numerical examples where the speed-up is between and , with respect to classic parallelization methods. Moreover, we show that our AD-based multi-start approach can be implemented by using tailored shallow Neural Networks, taking advantage of the built-in optimization procedures of the Deep Learning frameworks. - 18 August 2022
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 419, 114678
Discontinuous neural networks and discontinuity learning
- 18 August 2022
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 419, 114678
Discontinuous neural networks and discontinuity learning
- Open Access
- 1 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 786
Graph-Informed Neural Networks for Regressions on Graph-Structured Data
In this work, we extend the formulation of the spatial-based graph convolutional networks with a new architecture, called the graph-informed neural network (GINN). This new architecture is specifically designed for regression tasks on graph-structured data that are not suitable for the well-known graph neural networks, such as the regression of functions with the domain and codomain defined on two sets of values for the vertices of a graph. In particular, we formulate a new graph-informed (GI) layer that exploits the adjacent matrix of a given graph to define the unit connections in the neural network architecture, describing a new convolution operation for inputs associated with the vertices of the graph. We study the new GINN models with respect to two maximum-flow test problems of stochastic flow networks. GINNs show very good regression abilities and interesting potentialities. Moreover, we conclude by describing a real-world application of the GINNs to a flux regression problem in underground networks of fractures.
- 1 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 786
Open AccessGraph-Informed Neural Networks for Regressions on Graph-Structured Data
In this work, we extend the formulation of the spatial-based graph convolutional networks with a new architecture, called the graph-informed neural network (GINN). This new architecture is specifically designed for regression tasks on graph-structured data that are not suitable for the well-known graph neural networks, such as the regression of functions with the domain and codomain defined on two sets of values for the vertices of a graph. In particular, we formulate a new graph-informed (GI) layer that exploits the adjacent matrix of a given graph to define the unit connections in the neural network architecture, describing a new convolution operation for inputs associated with the vertices of the graph. We study the new GINN models with respect to two maximum-flow test problems of stochastic flow networks. GINNs show very good regression abilities and interesting potentialities. Moreover, we conclude by describing a real-world application of the GINNs to a flux regression problem in underground networks of fractures.
- Open Access
- 1 October 2021
- Published by Elsevier in Journal of Computational Science
- Vol. 55
Layer-wise relevance propagation for backbone identification in discrete fracture networks
- 1 October 2021
- Published by Elsevier in Journal of Computational Science
- Vol. 55
Open AccessLayer-wise relevance propagation for backbone identification in discrete fracture networks
- 1 October 2021
- Published by Elsevier in Renewable Energy
- Vol. 176, 590-605
Design optimization of renewable energy systems for NZEBs based on deep residual learning
- 1 October 2021
- Published by Elsevier in Renewable Energy
- Vol. 176, 590-605
Design optimization of renewable energy systems for NZEBs based on deep residual learning