1 | #include "emix.h" |
---|
2 | |
---|
3 | namespace bdm{ |
---|
4 | |
---|
5 | void emix::set_parameters ( const vec &w0, const Array<epdf*> &Coms0, bool copy ) { |
---|
6 | w = w0/sum ( w0 ); |
---|
7 | dim = Coms0(0)->dimension(); |
---|
8 | bool isnamed = Coms0(0)->isnamed(); |
---|
9 | int i; |
---|
10 | RV tmp_rv; |
---|
11 | if (isnamed) tmp_rv=Coms0(0)->_rv(); |
---|
12 | |
---|
13 | for ( i=0;i<w.length();i++ ) { |
---|
14 | it_assert_debug ( dim== ( Coms0 ( i )->dimension() ),"Component sizes do not match!" ); |
---|
15 | it_assert_debug ( !isnamed || tmp_rv.equal( Coms0 ( i )->_rv() ),"Component RVs do not match!" ); |
---|
16 | } |
---|
17 | if ( copy ) { |
---|
18 | Coms.set_length(Coms0.length()); |
---|
19 | for ( i=0;i<w.length();i++ ) {it_error("Not imp..."); |
---|
20 | *Coms ( i ) =*Coms0 ( i );} |
---|
21 | destroyComs=true; |
---|
22 | } |
---|
23 | else { |
---|
24 | Coms = Coms0; |
---|
25 | destroyComs=false; |
---|
26 | } |
---|
27 | if (isnamed) epdf::set_rv(tmp_rv); //coms aer already OK, no need for set_rv |
---|
28 | } |
---|
29 | |
---|
30 | vec emix::sample() const { |
---|
31 | //Sample which component |
---|
32 | vec cumDist = cumsum ( w ); |
---|
33 | double u0; |
---|
34 | #pragma omp critical |
---|
35 | u0 = UniRNG.sample(); |
---|
36 | |
---|
37 | int i=0; |
---|
38 | while ( ( cumDist ( i ) <u0 ) && ( i< ( w.length()-1 ) ) ) {i++;} |
---|
39 | |
---|
40 | return Coms ( i )->sample(); |
---|
41 | } |
---|
42 | |
---|
43 | emix* emix::marginal(const RV &rv) const{ |
---|
44 | it_assert_debug(isnamed(), "rvs are not assigned"); |
---|
45 | |
---|
46 | Array<epdf*> Cn(Coms.length()); |
---|
47 | for(int i=0;i<Coms.length();i++){Cn(i)=Coms(i)->marginal(rv);} |
---|
48 | emix* tmp = new emix(); |
---|
49 | tmp->set_parameters(w,Cn,false); |
---|
50 | tmp->ownComs(); |
---|
51 | return tmp; |
---|
52 | } |
---|
53 | |
---|
54 | mratio* emix::condition(const RV &rv) const{ |
---|
55 | it_assert_debug(isnamed(), "rvs are not assigned"); |
---|
56 | return new mratio(this,rv); |
---|
57 | }; |
---|
58 | |
---|
59 | void egiwmix::set_parameters ( const vec &w0, const Array<egiw*> &Coms0, bool copy ) { |
---|
60 | w = w0/sum ( w0 ); |
---|
61 | dim = Coms0(0)->dimension(); |
---|
62 | int i; |
---|
63 | for ( i=0;i<w.length();i++ ) { |
---|
64 | it_assert_debug ( dim== ( Coms0 ( i )->dimension() ),"Component sizes do not match!" ); |
---|
65 | } |
---|
66 | if ( copy ) { |
---|
67 | Coms.set_length(Coms0.length()); |
---|
68 | for ( i=0;i<w.length();i++ ) {it_error("Not imp..."); |
---|
69 | *Coms ( i ) =*Coms0 ( i );} |
---|
70 | destroyComs=true; |
---|
71 | } |
---|
72 | else { |
---|
73 | Coms = Coms0; |
---|
74 | destroyComs=false; |
---|
75 | } |
---|
76 | } |
---|
77 | |
---|
78 | vec egiwmix::sample() const { |
---|
79 | //Sample which component |
---|
80 | vec cumDist = cumsum ( w ); |
---|
81 | double u0; |
---|
82 | #pragma omp critical |
---|
83 | u0 = UniRNG.sample(); |
---|
84 | |
---|
85 | int i=0; |
---|
86 | while ( ( cumDist ( i ) <u0 ) && ( i< ( w.length()-1 ) ) ) {i++;} |
---|
87 | |
---|
88 | return Coms ( i )->sample(); |
---|
89 | } |
---|
90 | |
---|
91 | vec egiwmix::mean() const { |
---|
92 | int i; vec mu = zeros ( dim ); |
---|
93 | for ( i = 0;i < w.length();i++ ) {mu += w ( i ) * Coms ( i )->mean(); } |
---|
94 | return mu; |
---|
95 | } |
---|
96 | |
---|
97 | vec egiwmix::variance() const { |
---|
98 | // non-central moment |
---|
99 | vec mom2 = zeros ( dim ); |
---|
100 | for ( int i = 0;i < w.length();i++ ) { |
---|
101 | // pow is overloaded, we have to use another approach |
---|
102 | mom2 += w ( i ) * (Coms(i)->variance() + elem_mult ( Coms(i)->mean(), Coms(i)->mean() )); |
---|
103 | } |
---|
104 | // central moment |
---|
105 | // pow is overloaded, we have to use another approach |
---|
106 | return mom2 - elem_mult( mean(), mean() ); |
---|
107 | } |
---|
108 | |
---|
109 | emix* egiwmix::marginal(const RV &rv) const{ |
---|
110 | it_assert_debug(isnamed(), "rvs are not assigned"); |
---|
111 | |
---|
112 | Array<epdf*> Cn(Coms.length()); |
---|
113 | for(int i=0;i<Coms.length();i++){Cn(i)=Coms(i)->marginal(rv);} |
---|
114 | emix* tmp = new emix(); |
---|
115 | tmp->set_parameters(w,Cn,false); |
---|
116 | tmp->ownComs(); |
---|
117 | return tmp; |
---|
118 | } |
---|
119 | |
---|
120 | egiw* egiwmix::approx() { |
---|
121 | // NB: dimx == 1 !!! |
---|
122 | // The following code might look a bit spaghetti-like, |
---|
123 | // consult Dedecius, K. et al.: Partial forgetting in AR models. |
---|
124 | |
---|
125 | double sumVecCommon; // common part for many terms in eq. |
---|
126 | int len = w.length(); // no. of mix components |
---|
127 | int dimLS = Coms(1)->_V()._D().length() - 1; // dim of LS |
---|
128 | vec vecNu(len); // vector of dfms of components |
---|
129 | vec vecD(len); // vector of LS reminders of comps. |
---|
130 | vec vecCommon(len); // vector of common parts |
---|
131 | mat matVecsTheta; // matrix which rows are theta vects. |
---|
132 | |
---|
133 | // fill in the vectors vecNu, vecD and matVecsTheta |
---|
134 | for ( int i=0; i<len; i++ ) { |
---|
135 | vecNu.shift_left( Coms(i)->_nu() ); |
---|
136 | vecD.shift_left( Coms(i)->_V()._D()(0) ); |
---|
137 | matVecsTheta.append_row( Coms(i)->est_theta() ); |
---|
138 | } |
---|
139 | |
---|
140 | // calculate the common parts and their sum |
---|
141 | vecCommon = elem_mult ( w, elem_div(vecNu, vecD) ); |
---|
142 | sumVecCommon = sum(vecCommon); |
---|
143 | |
---|
144 | // LS estimator of theta |
---|
145 | vec aprEstTheta(dimLS); aprEstTheta.zeros(); |
---|
146 | for ( int i=0; i<len; i++ ) { |
---|
147 | aprEstTheta += matVecsTheta.get_row( i ) * vecCommon ( i ); |
---|
148 | } |
---|
149 | aprEstTheta /= sumVecCommon; |
---|
150 | |
---|
151 | |
---|
152 | // LS estimator of dfm |
---|
153 | double aprNu; |
---|
154 | double A = log( sumVecCommon ); // Term 'A' in equation |
---|
155 | |
---|
156 | for ( int i=0; i<len; i++ ) { |
---|
157 | A += w(i) * ( log( vecD(i) ) - psi( 0.5 * vecNu(i) ) ); |
---|
158 | } |
---|
159 | |
---|
160 | aprNu = ( 1 + sqrt(1 + 2 * (A - LOG2)/3 ) ) / ( 2 * (A - LOG2) ); |
---|
161 | |
---|
162 | |
---|
163 | // LS reminder (term D(0,0) in C-syntax) |
---|
164 | double aprD = aprNu / sumVecCommon; |
---|
165 | |
---|
166 | // Aproximation of cov |
---|
167 | // the following code is very numerically sensitive, thus |
---|
168 | // we have to eliminate decompositions etc. as much as possible |
---|
169 | mat aprC = zeros(dimLS, dimLS); |
---|
170 | for ( int i=0; i<len; i++ ) { |
---|
171 | aprC += Coms(i)->est_theta_cov().to_mat() * w(i); |
---|
172 | vec tmp = ( matVecsTheta.get_row(i) - aprEstTheta ); |
---|
173 | aprC += vecCommon(i) * outer_product( tmp, tmp); |
---|
174 | } |
---|
175 | |
---|
176 | // Construct GiW pdf :: BEGIN |
---|
177 | ldmat aprCinv ( inv(aprC) ); |
---|
178 | vec D = concat( aprD, aprCinv._D() ); |
---|
179 | mat L = eye(dimLS+1); |
---|
180 | L.set_submatrix(1,0, aprCinv._L() * aprEstTheta); |
---|
181 | L.set_submatrix(1,1, aprCinv._L()); |
---|
182 | ldmat aprLD (L, D); |
---|
183 | |
---|
184 | egiw* aprgiw = new egiw(1, aprLD, aprNu); |
---|
185 | return aprgiw; |
---|
186 | }; |
---|
187 | |
---|
188 | } |
---|
189 | // mprod::mprod ( Array<mpdf*> mFacs, bool overlap) : mpdf ( RV(), RV() ), n ( mFacs.length() ), epdfs ( n ), mpdfs ( mFacs ), rvinds ( n ), rvcinrv ( n ), irvcs_rvc ( n ) { |
---|
190 | // int i; |
---|
191 | // bool rvaddok; |
---|
192 | // // Create rv |
---|
193 | // for ( i = 0;i < n;i++ ) { |
---|
194 | // rvaddok=rv.add ( mpdfs ( i )->_rv() ); //add rv to common rvs. |
---|
195 | // // If rvaddok==false, mpdfs overlap => assert error. |
---|
196 | // it_assert_debug(rvaddok||overlap,"mprod::mprod() input mpdfs overlap in rv!"); |
---|
197 | // epdfs ( i ) = & ( mpdfs ( i )->posterior() ); // add pointer to epdf |
---|
198 | // }; |
---|
199 | // // Create rvc |
---|
200 | // for ( i = 0;i < n;i++ ) { |
---|
201 | // rvc.add ( mpdfs ( i )->_rvc().subt ( rv ) ); //add rv to common rvs. |
---|
202 | // }; |
---|
203 | // |
---|
204 | // // independent = true; |
---|
205 | // //test rvc of mpdfs and fill rvinds |
---|
206 | // for ( i = 0;i < n;i++ ) { |
---|
207 | // // find ith rv in common rv |
---|
208 | // rvsinrv ( i ) = mpdfs ( i )->_rv().dataind ( rv ); |
---|
209 | // // find ith rvc in common rv |
---|
210 | // rvcinrv ( i ) = mpdfs ( i )->_rvc().dataind ( rv ); |
---|
211 | // // find ith rvc in common rv |
---|
212 | // irvcs_rvc ( i ) = mpdfs ( i )->_rvc().dataind ( rvc ); |
---|
213 | // // |
---|
214 | // /* if ( rvcinrv ( i ).length() >0 ) {independent = false;} |
---|
215 | // if ( irvcs_rvc ( i ).length() >0 ) {independent = false;}*/ |
---|
216 | // } |
---|
217 | // }; |
---|