Empirical Models
Empirical Models
developing an accurate theoretical (i.e., physics-based) model of a chemical process based on phys-
ical principles could be impractical:
• often, there are many physical parameters (chemical & physical properties, reaction rate con-
stants, etc.) that are difficult/impractical to measure
alternative: develop an empirical (i.e., data-driven) model from process response data
process
empirical modeling is a generic term for activities that
u(t) y (t) create models by observation and experiment.
process
Wikipedia
∗
goal: find transfer function G(s) = CB (s)/F ∗ (s)
complications:
2. based on time series data characterizing the process response, select a suitable model
input output
f (t) [mol/s] cB (t) [mol/L]
t [s] t [s]
2. model selection.
CB∗ (s)
G(s) = =
F ∗ (s)
3. parameter identification.
process/system identification:
2
note on model selection
Occam’s razor: in explaining something, make no more assumptions than necessary (invoked to de-
fend model parsimony and favor models with fewer parameters).
y (t) model 1:
K
G(s) =
τs + 1
model 2:
t
K
G(s) =
a4 s4 + a3 s3 + a2 s 2 + a1 s + 1
ambitious Beavers: look up “Akaike information criterion” to select a model that appropriately bal-
ances model complexity (one metric = the number of parameters) and goodness of fit to the data.
build a cost/loss function that describes the “distance” between (i) the model with a given set of
parameters and (ii) the data. the sum of squares error is commonly used as a cost/loss function.
ℓ = ℓ(β) :=
3
geometric picture:
y (t)
the loss ℓ:
minimizing the loss, ie., tuning the model parameters β to minimize the loss ℓ(β)
βopt =
eg., the gradient-free Nelder-Mead simplex method: a heuristic algorithm to search for a minimum
of a function ℓ(β) by systematically transforming a simplex in parameter space. the idea is that the
simplex will eventually find, surround, and shrink in on the minimizer β opt .
4
cartoon of the loss function ℓ(β) = ℓ(τ, K)
in the Nelder-Mead algorithm (the “dance of the simplices”), at each iteration, we choose a simplex
operation to perform:
β1 β1 β1
a simplex operation is chosen, with the aim of enclosing the minimum, by sequentially:
• reflecting, expanding, or contracting the triangle, based on the loss at the newly proposed
vertex