24.12.2012 Views

Online Model Selection Based on the Variational Bayes

Online Model Selection Based on the Variational Bayes

Online Model Selection Based on the Variational Bayes

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<str<strong>on</strong>g>Online</str<strong>on</strong>g> <str<strong>on</strong>g>Model</str<strong>on</strong>g> <str<strong>on</strong>g>Selecti<strong>on</strong></str<strong>on</strong>g> <str<strong>on</strong>g>Based</str<strong>on</strong>g> <strong>on</strong> <strong>the</strong> Variati<strong>on</strong>al <strong>Bayes</strong> 1663<br />

D 1<br />

c g(t ) ± h<br />

TEz r(x(t ), z(t ))| µ N (t ) i<br />

C c 0®0 ¡ c ® (t ¡ 1) ² . (3.11)<br />

By using equati<strong>on</strong> 3.7, <strong>the</strong> ensemble average of <strong>the</strong> parameter N µ (t ) de�ned<br />

in equati<strong>on</strong> 3.6 can be calculated as<br />

µ<br />

N (t ) D hµi ® (t ¡1) D 1 @©<br />

c @® (® (t ¡ 1), c ). (3.12)<br />

The <strong>on</strong>line VB algorithm is summarized as follows. In <strong>the</strong> VB E-step, <strong>the</strong><br />

ensemble average of <strong>the</strong> parameter N µ (t ) is determined by equati<strong>on</strong> 3.12. Using<br />

this value, <strong>on</strong>e calculates <strong>the</strong> expectati<strong>on</strong> value of <strong>the</strong> suf�cient statistics<br />

(see equati<strong>on</strong> 3.10) for <strong>the</strong> current data. The posterior hyperparameter ® (t )<br />

is updated by equati<strong>on</strong> 3.11 in <strong>the</strong> VB M-step. This process is repeated when<br />

new data are observed. By combining <strong>the</strong> VB E-step (3.12) and VB M-step<br />

(3.11) equati<strong>on</strong>s, <strong>on</strong>e can get <strong>the</strong> recursive update equati<strong>on</strong> for ® (t ):<br />

D® (t ) D 1<br />

c g(t<br />

�<br />

£<br />

) TEz r(x(t ), z(t ))|hh i ® (t ¡1) ¤<br />

C c 0®0 ¡ c ® (t ¡ 1)<br />

´<br />

. (3.13)<br />

3.3 Stochastic Approximati<strong>on</strong>. Unlike <strong>the</strong> VB algorithm, <strong>the</strong> discounted<br />

free energy in <strong>the</strong> <strong>on</strong>line VB algorithm does not always increase, because<br />

a new c<strong>on</strong>tributi<strong>on</strong> is added to <strong>the</strong> discounted free energy at each time<br />

instance. In <strong>the</strong> following, we prove that <strong>the</strong> <strong>on</strong>line VB algorithm can be<br />

c<strong>on</strong>sidered as a stochastic approximati<strong>on</strong> (Kushner & Yin, 1997) for �nding<br />

<strong>the</strong> maximum of <strong>the</strong> expected free energy de�ned in equati<strong>on</strong> 3.2, which<br />

gives a lower bound for <strong>the</strong> expected log evidence de�ned in equati<strong>on</strong> 3.1.<br />

The expected free energy (see equati<strong>on</strong> 3.2), in which <strong>the</strong> maximizati<strong>on</strong> with<br />

respect to Qz has been performed, can be written as<br />

where<br />

max E [F(XfTg, Qh , Qz)] r D E [FM(x, ®, T)] r , (3.14)<br />

Qz<br />

Z<br />

FM(x, ®, T) D T<br />

Z<br />

£<br />

dm (z)P(z|x, hµi ® )<br />

dm (µ )Q h (µ ) log ¡ P(x, z| µ )/P(z|x, hµi ® ) ¢

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!