Parametric score models and realizability/approximation under coarse optimization
Develop a fully parametric class of score networks for the small-noise regime that explicitly encodes projection-like geometry (e.g., via physics‑informed architectures) and prove realizability and approximation guarantees for such models under local denoising score matching with coarse optimization.
References
Several directions remain open: From nonparametric function classes to explicit parametrizations. An important next step is to make this inductive bias explicit by working with a fully parametric score model and proving realizability/approximation guarantees under coarse optimization—for instance, via physics-informed architectures (PINNs) or other structured networks that directly encode projection-like behavior.
We provide closed-form solutions for circular and rectangular feasible sets in Appendix \ref{appendix:analytical_score_derivation}, \ref{appendix:rectangular_box_score_function_derivation}, and \ref{appendix:rectangular_infeasible_region_score_function_derivation}, respectively, however, closed-form solutions are not available for general, non-convex sets, for which we propose a low-noise approximation that avoids computing the convolution integral directly.