arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0801.1883cs.NEcs.ITmath.IT
收藏

D-optimal Bayesian Interrogation for Parameter and Noise Identification of Recurrent Neural Networks

Barnabas Poczos, Andras Lorincz

英文摘要:

We introduce a novel online Bayesian method for the identification of a family of noisy recurrent neural networks (RNNs). We develop Bayesian active learning technique in order to optimize the interrogating stimuli given past experiences. In particular, we consider the unknown parameters as stochastic variables and use the D-optimality principle, also known as `\emph{infomax method}', to choose optimal stimuli. We apply a greedy technique to maximize the information gain concerning network parameters at each time step. We also derive the D-optimal estimation of the additive noise that perturbs the dynamical system of the RNN. Our analytical results are approximation-free. The analytic derivation gives rise to attractive quadratic update rules.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑