skip to main content

Feedback particle filter for collective inference

The purpose of this paper is to describe the feedback particle filter algorithm for problems where there are a large number (\begin{document}$M$\end{document}) of non-interacting agents (targets) with a large number (\begin{document}$M$\end{document}) of non-agent specific observations (measurements) that originate from these agents. In its basic form, the problem is characterized by data association uncertainty whereby the association between the observations and agents must be deduced in addition to the agent state. In this paper, the large-\begin{document}$M$\end{document} limit is interpreted as a problem of collective inference. This viewpoint is used to derive the equation for the empirical distribution of the hidden agent states. A feedback particle filter (FPF) algorithm for this problem is presented and illustrated via numerical simulations. Results are presented for the Euclidean and the finite state-space cases, both in continuous-time settings. The classical FPF algorithm is shown to be the special case (with \begin{document}$M = 1$\end{document}) of these more general results. The simulations help show that the algorithm well approximates the empirical distribution of the hidden states for large \begin{document}$M$\end{document}.

Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10340146
Journal Name:
Foundations of Data Science
Volume:
3
Issue:
3
Page Range or eLocation-ID:
543
ISSN:
2639-8001
Sponsoring Org:
National Science Foundation
##### More Like this
1. Stochastic differential games have been used extensively to model agents' competitions in finance, for instance, in P2P lending platforms from the Fintech industry, the banking system for systemic risk, and insurance markets. The recently proposed machine learning algorithm, deep fictitious play, provides a novel and efficient tool for finding Markovian Nash equilibrium of large \begin{document}$N$\end{document}-player asymmetric stochastic differential games [J. Han and R. Hu, Mathematical and Scientific Machine Learning Conference, pages 221-245, PMLR, 2020]. By incorporating the idea of fictitious play, the algorithm decouples the game into \begin{document}$N$\end{document} sub-optimization problems, and identifies each player's optimal strategy with the deep backward stochastic differential equation (BSDE) method parallelly and repeatedly. In this paper, we prove the convergence of deep fictitious play (DFP) to the true Nash equilibrium. We can also show that the strategy based on DFP forms an \begin{document}$\epsilon$\end{document}-Nash equilibrium. We generalize the algorithm by proposing a new approach to decouple the games, and present numerical results of large population games showing the empirical convergence of the algorithm beyond the technical assumptions in the theorems.

2. This paper introduces a novel generative encoder (GE) framework for generative imaging and image processing tasks like image reconstruction, compression, denoising, inpainting, deblurring, and super-resolution. GE unifies the generative capacity of GANs and the stability of AEs in an optimization framework instead of stacking GANs and AEs into a single network or combining their loss functions as in existing literature. GE provides a novel approach to visualizing relationships between latent spaces and the data space. The GE framework is made up of a pre-training phase and a solving phase. In the former, a GAN with generator \begin{document}$G$\end{document} capturing the data distribution of a given image set, and an AE network with encoder \begin{document}$E$\end{document} that compresses images following the estimated distribution by \begin{document}$G$\end{document} are trained separately, resulting in two latent representations of the data, denoted as the generative and encoding latent space respectively. In the solving phase, given noisy image \begin{document}$x = \mathcal{P}(x^*)$\end{document}, where \begin{document}$x^*$\end{document} is the target unknown image, \begin{document}$\mathcal{P}$\end{document} is an operator adding an addictive, or multiplicative, or convolutional noise, or equivalently given such an image \begin{document}$x$\end{document}more »

and the image \begin{document}$x^*$\end{document} is recovered in a generative way via \begin{document}$\hat{x}: = G(z^*)\approx x^*$\end{document}, where \begin{document}$\lambda>0$\end{document} is a hyperparameter. The unification of the two spaces allows improved performance against corresponding GAN and AE networks while visualizing interesting properties in each latent space.

3. We consider the well-known Lieb-Liniger (LL) model for \begin{document}$N$\end{document} bosons interacting pairwise on the line via the \begin{document}$\delta$\end{document} potential in the mean-field scaling regime. Assuming suitable asymptotic factorization of the initial wave functions and convergence of the microscopic energy per particle, we show that the time-dependent reduced density matrices of the system converge in trace norm to the pure states given by the solution to the one-dimensional cubic nonlinear Schrödinger equation (NLS) with an explict rate of convergence. In contrast to previous work [3] relying on the formalism of second quantization and coherent states and without an explicit rate, our proof is based on the counting method of Pickl [65,66,67] and Knowles and Pickl [44]. To overcome difficulties stemming from the singularity of the \begin{document}$\delta$\end{document} potential, we introduce a new short-range approximation argument that exploits the Hölder continuity of the \begin{document}$N$\end{document}-body wave function in a single particle variable. By further exploiting the \begin{document}$L^2$\end{document}-subcritical well-posedness theory for the 1D cubic NLS, we can prove mean-field convergence when the limiting solution to the NLS has finitemore »

4. In this paper, we propose a new class of operator factorization methods to discretize the integral fractional Laplacian \begin{document}$(- \Delta)^\frac{{ \alpha}}{{2}}$\end{document} for \begin{document}$\alpha \in (0, 2)$\end{document}. One main advantage is that our method can easily increase numerical accuracy by using high-degree Lagrange basis functions, but remain its scheme structure and computer implementation unchanged. Moreover, it results in a symmetric (multilevel) Toeplitz differentiation matrix, enabling efficient computation via the fast Fourier transforms. If constant or linear basis functions are used, our method has an accuracy of \begin{document}${\mathcal O}(h^2)$\end{document}, while \begin{document}${\mathcal O}(h^4)$\end{document} for quadratic basis functions with \begin{document}$h$\end{document} a small mesh size. This accuracy can be achieved for any \begin{document}$\alpha \in (0, 2)$\end{document} and can be further increased if higher-degree basis functions are chosen. Numerical experiments are provided to approximate the fractional Laplacian and solve the fractional Poisson problems. It shows that if the solution of fractional Poisson problem satisfies \begin{document}$u \in C^{m, l}(\bar{ \Omega})$\end{document} for \begin{document}$m \in {\mathbb N}$\end{document} and \begin{document}$0 < l < 1$\end{document}, our method has an accuracy of \begin{document}$more » for constant and linear basis functions, while \begin{document}$ {\mathcal O}(h^{\min\{m+l, \, 4\}}) $\end{document} for quadratic basis functions. Additionally, our method can be readily applied to approximate the generalized fractional Laplacians with symmetric kernel function, and numerical study on the tempered fractional Poisson problem demonstrates its efficiency. 5. In this paper we consider the inverse problem of determining structural properties of a thin anisotropic and dissipative inhomogeneity in \begin{document}$ {\mathbb R}^m $\end{document}, \begin{document}$ m = 2, 3 $\end{document} from scattering data. In the asymptotic limit as the thickness goes to zero, the thin inhomogeneity is modeled by an open \begin{document}$ m-1 \$\end{document} dimensional manifold (here referred to as screen), and the field inside is replaced by jump conditions on the total field involving a second order surface differential operator. We show that all the surface coefficients (possibly matrix valued and complex) are uniquely determined from far field patterns of the scattered fields due to infinitely many incident plane waves at a fixed frequency. Then we introduce a target signature characterized by a novel eigenvalue problem such that the eigenvalues can be determined from measured scattering data, adapting the approach in [20]. Changes in the measured eigenvalues are used to identified changes in the coefficients without making use of the governing equations that model the healthy screen. In our investigation the shape of the screen is known, since it represents the object being evaluated. We present some preliminary numerical results indicating the validitymore »