Diffusion scores learn the graph and the filter at once: TopoScore-FAF turns residual scores into topology gradients without transition densities
Inferring a network's interaction graph together with its hidden states is hard when observations are intermittent and transition noise is unknown and non-Gaussian, because an unconstrained generative model can absorb graph structure into its own mean. TopoScore-FAF restricts the graph to the conditional mean of a leaky diffusion and lets a frozen diffusion emulator represent only the centered residual, then projects the residual score onto edge directions through a score-topology duality, so topology gradients need neither transition densities nor backpropagation through the sampler. Experiments on synthetic and four real datasets show the combination improves topology recovery and probabilistic calibration under non-Gaussian forcing.