Enhancing gradient-based parameter estimation with an evolutionary approach

2006 ◽  
Vol 316 (1-4) ◽  
pp. 266-280 ◽  
Author(s):  
Eugene Agyei ◽  
Kirk Hatfield
2021 ◽  
Author(s):  
Leonard Schmiester ◽  
Daniel Weindl ◽  
Jan Hasenauer

AbstractMotivationUnknown parameters of dynamical models are commonly estimated from experimental data. However, while various efficient optimization and uncertainty analysis methods have been proposed for quantitative data, methods for qualitative data are rare and suffer from bad scaling and convergence.ResultsHere, we propose an efficient and reliable framework for estimating the parameters of ordinary differential equation models from qualitative data. In this framework, we derive a semi-analytical algorithm for gradient calculation of the optimal scaling method developed for qualitative data. This enables the use of efficient gradient-based optimization algorithms. We demonstrate that the use of gradient information improves performance of optimization and uncertainty quantification on several application examples. On average, we achieve a speedup of more than one order of magnitude compared to gradient-free optimization. Additionally, in some examples, the gradient-based approach yields substantially improved objective function values and quality of the fits. Accordingly, the proposed framework substantially improves the parameterization of models from qualitative data.AvailabilityThe proposed approach is implemented in the open-source Python Parameter EStimation TOolbox (pyPESTO). All application examples and code to reproduce this study are available at https://doi.org/10.5281/zenodo.4507613.


Author(s):  
Saeid Bashash ◽  
Hosam K. Fathy

In this effort, we use the generalized Polynomial Chaos theory (gPC) for the real-time state and parameter estimation of electrochemical batteries. We use an equivalent circuit battery model, comprising two states and five parameters, and formulate the online parameter estimation problem using battery current and voltage measurements. Using a combination of the conventional recursive gradient-based search algorithm and gPC framework, we propose a novel battery parameter estimation strategy capable of estimating both battery state-of-charge (SOC) and parameters related to battery health, e.g., battery charge capacity, internal resistance, and relaxation time constant. Using a combination of experimental tests and numerical simulations, we examine and demonstrate the effectiveness of the proposed battery estimation method.


2018 ◽  
Vol 75 (5) ◽  
pp. 1553-1559 ◽  
Author(s):  
Sam Subbey

Abstract Using simple illustrative examples, this note highlights some of the caveats with gradient-based algorithms. This class of algorithms underpins the state-of-the-art modelling platform in fisheries science. The goal is to sound a cautionary note about an increasing trend in fisheries science, where blind faith is being invested in results obtained from algorithms that are fast, and proven to have machine precision.


2020 ◽  
Author(s):  
Simon Warder ◽  
Athanasios Angeloudis ◽  
Stephan Kramer ◽  
Colin Cotter ◽  
Matthew Piggott

SPE Journal ◽  
2009 ◽  
Vol 15 (01) ◽  
pp. 18-30 ◽  
Author(s):  
J.R.. R. Rommelse ◽  
J.D.. D. Jansen ◽  
A.W.. W. Heemink

Summary The discrepancy between observed measurements and model predictions can be used to improve either the model output alone or both the model output and the parameters that underlie the model. In the case of parameter estimation, methods exist that can efficiently calculate the gradient of the discrepancy to changes in the parameters, assuming that there are no uncertainties in addition to the unknown parameters. In the case of general nonlinear parameter estimation, many different parameter sets exist that locally minimize the discrepancy. In this case, the gradient must be regularized before it can be used by gradient-based minimization algorithms. This article proposes a method for calculating a gradient in the presence of additional model errors through the use of representer expansions. The representers are data-driven basis functions that perform the regularization. All available data can be used during every iteration of the minimization scheme, as is the case in the classical representer method (RM). However, the method proposed here also allows adaptive selection of different portions of the data during different iterations to reduce computation time; the user now has the freedom to choose the number of basis functions and revise this choice at every iteration. The method also differs from the classic RM by the introduction of measurement representers in addition to state, adjoint, and parameter representers and by the fact that no correction terms are calculated. Unlike the classic RM, where the minimization scheme is prescribed, the RM proposed here provides a gradient that can be used in any minimization algorithm. The applicability of the modified method is illustrated with a synthetic example to estimate permeability values in an inverted- five-spot waterflooding problem.


Sign in / Sign up

Export Citation Format

Share Document