#[must_use]
pub fn numerical_hessian(
loss_fn: &dyn Fn(&[f64]) -> f64,
params: &[f64],
epsilon: f64,
) -> Vec<f64> {
let n = params.len();
let mut hessian = vec![0.0; n * n];
let mut p = params.to_vec();
for i in 0..n {
for j in i..n {
p.copy_from_slice(params);
p[i] += epsilon;
p[j] += epsilon;
let fpp = loss_fn(&p);
p.copy_from_slice(params);
p[i] += epsilon;
p[j] -= epsilon;
let fpm = loss_fn(&p);
p.copy_from_slice(params);
p[i] -= epsilon;
p[j] += epsilon;
let fmp = loss_fn(&p);
p.copy_from_slice(params);
p[i] -= epsilon;
p[j] -= epsilon;
let fmm = loss_fn(&p);
let hij = (fpp - fpm - fmp + fmm) / (4.0 * epsilon * epsilon);
hessian[i * n + j] = hij;
hessian[j * n + i] = hij;
}
}
hessian
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_hessian_quadratic() {
let f = |x: &[f64]| x.iter().map(|xi| xi * xi).sum::<f64>();
let params = vec![1.0, 2.0, 3.0];
let h = numerical_hessian(&f, ¶ms, 1e-5);
let n = 3;
for i in 0..n {
for j in 0..n {
let expected = if i == j { 2.0 } else { 0.0 };
assert!(
(h[i * n + j] - expected).abs() < 1e-4,
"H[{},{}] = {}, expected {}",
i,
j,
h[i * n + j],
expected
);
}
}
}
#[test]
fn test_hessian_rosenbrock() {
let f = |x: &[f64]| {
let a = 1.0 - x[0];
let b = x[0].mul_add(-x[0], x[1]);
(100.0 * b).mul_add(b, a * a)
};
let params = vec![1.0, 1.0];
let h = numerical_hessian(&f, ¶ms, 1e-5);
let det = h[0].mul_add(h[3], -(h[1] * h[2]));
assert!(
det > 0.0,
"Hessian at minimum should have positive determinant"
);
assert!(h[0] > 0.0, "H[0,0] should be positive");
}
#[test]
fn test_hessian_symmetric() {
let f = |x: &[f64]| (x[0] * x[0]).mul_add(x[1], x[1] * x[1]); let params = vec![1.0, 2.0];
let h = numerical_hessian(&f, ¶ms, 1e-5);
let n = 2;
for i in 0..n {
for j in 0..n {
assert!(
(h[i * n + j] - h[j * n + i]).abs() < 1e-6,
"H[{},{}] = {} != H[{},{}] = {}",
i,
j,
h[i * n + j],
j,
i,
h[j * n + i]
);
}
}
}
}