199 research outputs found

    Inverse problems for discrete heat equations and random walks

    Full text link
    We study the inverse problem of determining a finite weighted graph (X,E)(X,E) from the source-to-solution map on a vertex subset B⊂XB\subset X for heat equations on graphs, where the time variable can be either discrete or continuous. We prove that this problem is equivalent to the discrete version of the inverse interior spectral problem, provided that there does not exist a nonzero eigenfunction of the weighted graph Laplacian vanishing identically on BB. In particular, we consider inverse problems for discrete-time random walks on finite graphs. We show that under the Two-Points Condition, the graph structure and the transition matrix of the random walk can be uniquely recovered from the distributions of the first passing times on BB, or from the observation on BB of one realization of the random walk.Comment: 31 pages, 3 figures. arXiv admin note: text overlap with arXiv:2101.1002

    Reflected Diffusion Models

    Full text link
    Score-based diffusion models learn to reverse a stochastic differential equation that maps data to noise. However, for complex tasks, numerical error can compound and result in highly unnatural samples. Previous work mitigates this drift with thresholding, which projects to the natural data domain (such as pixel space for images) after each diffusion step, but this leads to a mismatch between the training and generative processes. To incorporate data constraints in a principled manner, we present Reflected Diffusion Models, which instead reverse a reflected stochastic differential equation evolving on the support of the data. Our approach learns the perturbed score function through a generalized score matching loss and extends key components of standard diffusion models including diffusion guidance, likelihood-based training, and ODE sampling. We also bridge the theoretical gap with thresholding: such schemes are just discretizations of reflected SDEs. On standard image benchmarks, our method is competitive with or surpasses the state of the art and, for classifier-free guidance, our approach enables fast exact sampling with ODEs and produces more faithful samples under high guidance weight.Comment: Preprint. 27 Pages, 21 Figure
    • …
    corecore