1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
use nalgebra::DVector;
use nalgebra::{storage::Storage, U1, Dynamic};
use crate::algebra::{SVector, SMatrix};
pub trait Prior
{
fn default(input_dimension: usize) -> Self;
fn prior<S: Storage<f64, Dynamic, Dynamic>>(&self, input: &SMatrix<S>) -> DVector<f64>;
fn fit<SM: Storage<f64, Dynamic, Dynamic> + Clone, SV: Storage<f64, Dynamic, U1>>(&mut self,
_training_inputs: &SMatrix<SM>,
_training_outputs: &SVector<SV>)
{
}
}
#[derive(Clone, Copy, Debug)]
pub struct ZeroPrior {}
impl Prior for ZeroPrior
{
fn default(_input_dimension: usize) -> Self
{
Self {}
}
fn prior<S: Storage<f64, Dynamic, Dynamic>>(&self, input: &SMatrix<S>) -> DVector<f64>
{
DVector::zeros(input.nrows())
}
}
#[derive(Clone, Debug)]
pub struct ConstantPrior
{
c: f64
}
impl ConstantPrior
{
pub fn new(c: f64) -> Self
{
Self { c: c }
}
}
impl Prior for ConstantPrior
{
fn default(_input_dimension: usize) -> Self
{
Self::new(0f64)
}
fn prior<S: Storage<f64, Dynamic, Dynamic>>(&self, input: &SMatrix<S>) -> DVector<f64>
{
DVector::from_element(input.nrows(), self.c)
}
fn fit<SM: Storage<f64, Dynamic, Dynamic>, SV: Storage<f64, Dynamic, U1>>(&mut self,
_training_inputs: &SMatrix<SM>,
training_outputs: &SVector<SV>)
{
self.c = training_outputs.mean();
}
}
#[derive(Clone, Debug)]
pub struct LinearPrior
{
weights: DVector<f64>,
intercept: f64
}
impl LinearPrior
{
pub fn new(weights: DVector<f64>, intercept: f64) -> Self
{
LinearPrior { weights, intercept }
}
}
impl Prior for LinearPrior
{
fn default(input_dimension: usize) -> Self
{
Self { weights: DVector::zeros(input_dimension), intercept: 0f64 }
}
fn prior<S: Storage<f64, Dynamic, Dynamic>>(&self, input: &SMatrix<S>) -> DVector<f64>
{
let mut result = input * &self.weights;
result.add_scalar_mut(self.intercept);
result
}
fn fit<SM: Storage<f64, Dynamic, Dynamic> + Clone, SV: Storage<f64, Dynamic, U1>>(&mut self,
training_inputs: &SMatrix<SM>,
training_outputs: &SVector<SV>)
{
let weights = training_inputs.clone()
.insert_column(0, 1.)
.svd(true, true)
.solve(training_outputs, 0.)
.expect("Linear prior fit : solve failed.");
self.intercept = weights[0];
self.weights = weights.remove_row(0);
}
}