Daniel Sanz-Alonso

Prof. Daniel Sanz-Alonso

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2021 in Foundations of Data Science
Verified
Journal Article
Closed access
PDF file
NCNeil K. Chada
Neil K. Chada
YCYuming Chen
Yuming Chen
DSDaniel Sanz-Alonso
Daniel Sanz-Alonso
This paper provides a unified perspective of iterative ensemble Kalman methods, a family of derivative-free algorithms for parameter reconstruction and other related tasks. We identify, compare and develop three subfamilies of ensemble methods that differ in the objective they seek to minimize and the derivative-based optimization scheme they approximate through the ensemble. Our work emphasizes two principles for the derivation and analysis of iterative ensemble Kalman methods: statistical linearization and continuum limits. Following these guiding principles, we introduce new iterative ensemble Kalman methods that show promising numerical performance in Bayesian inverse problems, data assimilation and machine learning tasks.

1 January 2023 in Foundations of Data Science
Verified
Journal Article
Closed access
PDF file
HKHwanwoo Kim
Hwanwoo Kim
DSDaniel Sanz-Alonso
Daniel Sanz-Alonso
ASAlexander Strang
Alexander Strang
This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. The effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

27 October 2023 in Inverse Problems
Verified
Journal Article
Open access
YCYuming Chen
Yuming Chen
DSDaniel Sanz-Alonso
Daniel Sanz-Alonso
RWRebecca Willett
Rebecca Willett
This paper introduces a computational framework to reconstruct and forecast a partially observed state that evolves according to an unknown or expensive-to-simulate dynamical system. Our reduced-order autodifferentiable ensemble Kalman filters (ROAD-EnKFs) learn a latent low-dimensional surrogate model for the dynamics and a decoder that maps from the latent space to the state space. The learned dynamics and decoder are then used within an EnKF to reconstruct and forecast the state. Numerical experiments show that if the state dynamics exhibit a hidden low-dimensional structure, ROAD-EnKFs achieve higher accuracy at lower computational cost compared to existing methods. If such structure is not expressed in the latent state dynamics, ROAD-EnKFs achieve similar accuracy at lower cost, making them a promising approach for surrogate state reconstruction and forecasting.

31 January 2022 in Inverse Problems
Verified
Journal Article
Closed access
JHJohn Harlim
John Harlim
SJShixiao W Jiang
Shixiao W Jiang
HKHwanwoo Kim
Hwanwoo Kim
DSDaniel Sanz-Alonso
Daniel Sanz-Alonso
This paper develops manifold learning techniques for the numerical solution of PDE-constrained Bayesian inverse problems on manifolds with boundaries. We introduce graphical Matérn-type Gaussian field priors that enable flexible modeling near the boundaries, representing boundary values by superposition of harmonic functions with appropriate Dirichlet boundary conditions. We also investigate the graph-based approximation of forward models from PDE parameters to observed quantities. In the construction of graph-based prior and forward models, we leverage the ghost point diffusion map algorithm to approximate second-order elliptic operators with classical boundary conditions. Numerical results validate our graph-based approach and demonstrate the need to design prior covariance models that account for boundary conditions.

25 September 2020 in Inverse Problems
Verified
Journal Article
Closed access
PDF file
DBDaniele Bigoni
Daniele Bigoni
YCYuming Chen
Yuming Chen
NTNicolas Garcia Trillos
Nicolas Garcia Trillos
YMYoussef Marzouk
Youssef Marzouk
DSDaniel Sanz-Alonso
Daniel Sanz-Alonso
This paper suggests a framework for the learning of discretizations of expensive forward models in Bayesian inverse problems. The main idea is to incorporate the parameters governing the discretization as part of the unknown to be estimated within the Bayesian machinery. We numerically show that in a variety of inverse problems arising in mechanical engineering, signal processing and the geosciences, the observations contain useful information to guide the choice of discretization.

26 December 2020 in Entropy
Verified
Journal Article
Open access
PDF file
DSDaniel Sanz-Alonso
Daniel Sanz-Alonso
ZWZijian Wang
Zijian Wang
Importance sampling is used to approximate Bayes’ rule in many computational approaches to Bayesian inverse problems, data assimilation and machine learning. This paper reviews and further investigates the required sample size for importance sampling in terms of the χ2-divergence between target and proposal. We illustrate through examples the roles that dimension, noise-level and other model parameters play in approximating the Bayesian update with importance sampling. Our examples also facilitate a new direct comparison of standard and optimal proposals for particle filtering.