303 lines
7.5 KiB
Rust
303 lines
7.5 KiB
Rust
use ndarray::prelude::*;
|
|
|
|
mod affine;
|
|
mod constant;
|
|
mod exponential;
|
|
mod matern32;
|
|
mod matern52;
|
|
mod wiener;
|
|
|
|
pub use affine::Affine;
|
|
pub use constant::Constant;
|
|
pub use exponential::Exponential;
|
|
pub use matern32::Matern32;
|
|
pub use matern52::Matern52;
|
|
pub use wiener::Wiener;
|
|
|
|
pub(crate) fn distance(ts1: &[f64], ts2: &[f64]) -> Array2<f64> {
|
|
let mut r = Array2::zeros((ts1.len(), ts2.len()));
|
|
|
|
for (i, v1) in ts1.iter().enumerate() {
|
|
for (j, v2) in ts2.iter().enumerate() {
|
|
r[(i, j)] = (v1 - v2).abs();
|
|
}
|
|
}
|
|
|
|
r
|
|
}
|
|
|
|
pub trait Kernel {
|
|
fn k_mat(&self, ts1: &[f64], ts2: Option<&[f64]>) -> Array2<f64>;
|
|
fn k_diag(&self, ts: &[f64]) -> Array1<f64>;
|
|
fn order(&self) -> usize;
|
|
fn state_mean(&self, t: f64) -> Array1<f64>;
|
|
fn state_cov(&self, t: f64) -> Array2<f64>;
|
|
fn measurement_vector(&self) -> Array1<f64>;
|
|
fn feedback(&self) -> Array2<f64>;
|
|
fn transition(&self, t0: f64, t1: f64) -> Array2<f64>;
|
|
fn noise_effect(&self) -> Array2<f64>;
|
|
fn noise_cov(&self, t0: f64, t1: f64) -> Array2<f64>;
|
|
}
|
|
|
|
impl Kernel for Vec<Box<dyn Kernel>> {
|
|
fn k_mat(&self, ts1: &[f64], ts2: Option<&[f64]>) -> Array2<f64> {
|
|
let n = ts1.len();
|
|
let m = ts2.map_or(n, |ts| ts.len());
|
|
|
|
self.iter()
|
|
.fold(Array2::zeros((n, m)), |k_diag: Array2<f64>, kernel| {
|
|
k_diag + kernel.k_mat(ts1, ts2)
|
|
})
|
|
}
|
|
|
|
fn k_diag(&self, ts: &[f64]) -> Array1<f64> {
|
|
self.iter()
|
|
.fold(Array1::zeros(ts.len()), |k_diag: Array1<f64>, kernel| {
|
|
k_diag + kernel.k_diag(ts)
|
|
})
|
|
}
|
|
|
|
fn order(&self) -> usize {
|
|
self.iter().map(|kernel| kernel.order()).sum()
|
|
}
|
|
|
|
fn state_mean(&self, t: f64) -> Array1<f64> {
|
|
let data = self
|
|
.iter()
|
|
.flat_map(|kernel| kernel.state_mean(t).to_vec().into_iter())
|
|
.collect::<Vec<f64>>();
|
|
|
|
Array1::from(data)
|
|
}
|
|
|
|
fn state_cov(&self, t: f64) -> Array2<f64> {
|
|
let data = self
|
|
.iter()
|
|
.map(|kernel| kernel.state_cov(t))
|
|
.collect::<Vec<_>>();
|
|
|
|
let dim = data
|
|
.iter()
|
|
.fold((0, 0), |(h, w), m| (h + m.nrows(), w + m.ncols()));
|
|
|
|
let mut block = Array2::zeros(dim);
|
|
|
|
let mut r_d = 0;
|
|
let mut c_d = 0;
|
|
|
|
for m in data {
|
|
for ((r, c), v) in m.indexed_iter() {
|
|
block[(r + r_d, c + c_d)] = *v;
|
|
}
|
|
|
|
r_d += m.nrows();
|
|
c_d += m.ncols();
|
|
}
|
|
|
|
block
|
|
}
|
|
|
|
fn measurement_vector(&self) -> Array1<f64> {
|
|
let data = self
|
|
.iter()
|
|
.flat_map(|kernel| kernel.measurement_vector().to_vec().into_iter())
|
|
.collect::<Vec<f64>>();
|
|
|
|
Array1::from(data)
|
|
}
|
|
|
|
fn feedback(&self) -> Array2<f64> {
|
|
let data = self
|
|
.iter()
|
|
.map(|kernel| kernel.feedback())
|
|
.collect::<Vec<_>>();
|
|
|
|
let dim = data
|
|
.iter()
|
|
.fold((0, 0), |(h, w), m| (h + m.nrows(), w + m.ncols()));
|
|
|
|
let mut block = Array2::zeros(dim);
|
|
|
|
let mut r_d = 0;
|
|
let mut c_d = 0;
|
|
|
|
for m in data {
|
|
for ((r, c), v) in m.indexed_iter() {
|
|
block[(r + r_d, c + c_d)] = *v;
|
|
}
|
|
|
|
r_d += m.nrows();
|
|
c_d += m.ncols();
|
|
}
|
|
|
|
block
|
|
}
|
|
|
|
fn transition(&self, t0: f64, t1: f64) -> Array2<f64> {
|
|
let data = self
|
|
.iter()
|
|
.map(|kernel| kernel.transition(t0, t1))
|
|
.collect::<Vec<_>>();
|
|
|
|
let dim = data
|
|
.iter()
|
|
.fold((0, 0), |(h, w), m| (h + m.nrows(), w + m.ncols()));
|
|
|
|
let mut block = Array2::zeros(dim);
|
|
|
|
let mut r_d = 0;
|
|
let mut c_d = 0;
|
|
|
|
for m in data {
|
|
for ((r, c), v) in m.indexed_iter() {
|
|
block[(r + r_d, c + c_d)] = *v;
|
|
}
|
|
|
|
r_d += m.nrows();
|
|
c_d += m.ncols();
|
|
}
|
|
|
|
block
|
|
}
|
|
|
|
fn noise_effect(&self) -> Array2<f64> {
|
|
let data = self
|
|
.iter()
|
|
.map(|kernel| kernel.noise_effect())
|
|
.collect::<Vec<_>>();
|
|
|
|
let dim = data
|
|
.iter()
|
|
.fold((0, 0), |(h, w), m| (h + m.nrows(), w + m.ncols()));
|
|
|
|
let mut block = Array2::zeros(dim);
|
|
|
|
let mut r_d = 0;
|
|
let mut c_d = 0;
|
|
|
|
for m in data {
|
|
for ((r, c), v) in m.indexed_iter() {
|
|
block[(r + r_d, c + c_d)] = *v;
|
|
}
|
|
|
|
r_d += m.nrows();
|
|
c_d += m.ncols();
|
|
}
|
|
|
|
block
|
|
}
|
|
|
|
fn noise_cov(&self, t0: f64, t1: f64) -> Array2<f64> {
|
|
let data = self
|
|
.iter()
|
|
.map(|kernel| kernel.noise_cov(t0, t1))
|
|
.collect::<Vec<_>>();
|
|
|
|
let dim = data
|
|
.iter()
|
|
.fold((0, 0), |(h, w), m| (h + m.nrows(), w + m.ncols()));
|
|
|
|
let mut block = Array2::zeros(dim);
|
|
|
|
let mut r_d = 0;
|
|
let mut c_d = 0;
|
|
|
|
for m in data {
|
|
for ((r, c), v) in m.indexed_iter() {
|
|
block[(r + r_d, c + c_d)] = *v;
|
|
}
|
|
|
|
r_d += m.nrows();
|
|
c_d += m.ncols();
|
|
}
|
|
|
|
block
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
extern crate intel_mkl_src;
|
|
|
|
use approx::assert_abs_diff_eq;
|
|
use rand::{distributions::Standard, thread_rng, Rng};
|
|
|
|
use super::*;
|
|
|
|
#[test]
|
|
fn test_kernel_matrix() {
|
|
let kernel: Vec<Box<dyn Kernel>> = vec![
|
|
Box::new(Matern32::new(1.5, 0.7)),
|
|
Box::new(Matern52::new(0.2, 5.0)),
|
|
];
|
|
|
|
let ts = [1.26, 1.46, 2.67];
|
|
|
|
assert_abs_diff_eq!(
|
|
kernel.k_mat(&ts, None),
|
|
array![
|
|
[1.7, 1.5667546855502472, 0.3933043131476467],
|
|
[1.5667546855502472, 1.7, 0.4908539038626858],
|
|
[0.3933043131476467, 0.4908539038626858, 1.7]
|
|
]
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn test_kernel_diag() {
|
|
let kernel: Vec<Box<dyn Kernel>> = vec![
|
|
Box::new(Matern32::new(1.5, 0.7)),
|
|
Box::new(Matern52::new(0.2, 5.0)),
|
|
];
|
|
|
|
let ts: Vec<_> = thread_rng()
|
|
.sample_iter::<f64, _>(Standard)
|
|
.take(10)
|
|
.map(|x| x * 10.0)
|
|
.collect();
|
|
|
|
assert_eq!(kernel.k_mat(&ts, None).diag(), kernel.k_diag(&ts));
|
|
}
|
|
|
|
#[test]
|
|
fn test_kernel_order() {
|
|
let kernel: Vec<Box<dyn Kernel>> = vec![
|
|
Box::new(Matern32::new(1.5, 0.7)),
|
|
Box::new(Matern52::new(0.2, 5.0)),
|
|
];
|
|
|
|
let m = kernel.order();
|
|
|
|
assert_eq!(kernel.state_mean(0.0).shape(), &[m]);
|
|
assert_eq!(kernel.state_cov(0.0).shape(), &[m, m]);
|
|
assert_eq!(kernel.measurement_vector().shape(), &[m]);
|
|
assert_eq!(kernel.feedback().shape(), &[m, m]);
|
|
assert_eq!(kernel.noise_effect().shape()[0], m);
|
|
assert_eq!(kernel.transition(0.0, 1.0).shape(), &[m, m]);
|
|
assert_eq!(kernel.noise_cov(0.0, 1.0).shape(), &[m, m]);
|
|
}
|
|
|
|
#[test]
|
|
fn test_ssm_variance() {
|
|
let kernel: Vec<Box<dyn Kernel>> = vec![
|
|
Box::new(Matern32::new(1.5, 0.7)),
|
|
Box::new(Matern52::new(0.2, 5.0)),
|
|
];
|
|
|
|
let ts: Vec<_> = thread_rng()
|
|
.sample_iter::<f64, _>(Standard)
|
|
.take(10)
|
|
.map(|x| x * 10.0)
|
|
.collect();
|
|
|
|
let h = kernel.measurement_vector();
|
|
|
|
let vars = ts
|
|
.iter()
|
|
.map(|t| h.dot(&kernel.state_cov(*t)).dot(&h))
|
|
.collect::<Vec<_>>();
|
|
|
|
assert_abs_diff_eq!(Array::from(vars), kernel.k_diag(&ts));
|
|
}
|
|
}
|