论文标题
深FPF:高维度的增益函数近似
Deep FPF: Gain function approximation in high-dimensional setting
论文作者
论文摘要
在本文中,我们提出了一种近似反馈粒子滤波器(FPF)的增益功能的新方法。精确增益函数是涉及概率加权拉普拉斯式的泊松方程的解决方案。数值问题是仅使用从概率分布中采样的许多粒子来近似精确的增益函数。 受深度学习方法最近成功的启发,我们代表了增益函数作为神经网络输出的梯度。因此,考虑了泊松方程的一定变化表述,提出了一个优化问题,用于学习神经网络的权重。为此,描述了随机梯度算法。 所提出的方法具有两个重要的属性/优势:(i)随机优化算法允许一个并行处理一批样品(粒子),以确保具有颗粒数量的良好缩放特性; (ii)神经网络的显着表示能力意味着该算法可能适用且可用于解决高维问题。我们从数值上建立了这两个属性,并与现有方法进行了广泛的比较。
In this paper, we present a novel approach to approximate the gain function of the feedback particle filter (FPF). The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian. The numerical problem is to approximate the exact gain function using only finitely many particles sampled from the probability distribution. Inspired by the recent success of the deep learning methods, we represent the gain function as a gradient of the output of a neural network. Thereupon considering a certain variational formulation of the Poisson equation, an optimization problem is posed for learning the weights of the neural network. A stochastic gradient algorithm is described for this purpose. The proposed approach has two significant properties/advantages: (i) The stochastic optimization algorithm allows one to process, in parallel, only a batch of samples (particles) ensuring good scaling properties with the number of particles; (ii) The remarkable representation power of neural networks means that the algorithm is potentially applicable and useful to solve high-dimensional problems. We numerically establish these two properties and provide extensive comparison to the existing approaches.