Should the Boundary Term Be Learned in Reflected Diffusion? Conormal Trace and Reflection Masking

• URL: http://arxiv.org/abs/2608.03469v1
• Date: Tue, 04 Aug 2026 11:05:02 GMT
• Title: Should the Boundary Term Be Learned in Reflected Diffusion? Conormal Trace and Reflection Masking
• Abstract summary: We study score learning for reflected diffusion on bounded domains.<n>We identify reflection masking: hard reflection can keep samples feasible even when the learned trace is wrong.
• Score: 4.262498901922258
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study score learning for reflected diffusion on bounded domains. Reflection keeps trajectories feasible but does not ensure that the learned score satisfies the boundary behavior implied by the forward process. With implicit score matching, integration by parts leaves a boundary term, and we show that it depends on one scalar at each boundary point: the diffusion- weighted normal component of the score, or conormal trace. The no-flux condition fixes this value while leaving the re- maining boundary components unrestricted; under anisotropic diffusion it generally differs from the ordinary normal score component. On hyperrectangles, our parametrization enforces the required trace without additional trainable parameters or a stochastic boundary estimator and, under regularity assump- tions, can represent the true score, whereas fixing an incorrect value creates an error that more data cannot remove. We ex- tend the construction to simplices and polygonal domains and identify reflection masking: hard reflection can keep samples feasible even when the learned trace is wrong, so post-reflection metrics may hide the error. Experiments show the clearest separation with less frequent reflection, anisotropic diffusion, and mass near intersections of constraints; under full reflection, final sample placement improves inconsistently, illustrating how hard repair can mask boundary-score errors and decouple score accuracy from downstream generation quality.

Related papers

• Cone Extended Rayleigh Quotients for Directed Graph Learning: Minimax Spectral Certificates, Sensitivity, and Adaptive Control [0.0]
  We develop a learning-oriented methodology for spectral certification, sensitivity analysis, and control without requiring symmetry, nonnegativity, or cone preservation.<n>For a simple interior level, the right and left modes satisfy [ D_C(B)[H]=v_CT H u_C, ] yielding first-order optimal graph-supported interventions.<n> Numerical experiments demonstrate the applicability of the approach beyond cone-preserving operators and in directed learning settings.
  arXiv  Detail & Related papers  (2026-08-27T13:37:02Z)
• Simplex Relaxation for Discrete Diffusion [58.33696160279345]
  We introduce Simplax, an exact Dirichlet--categorical augmentation that couples each corrupted categorical state with an auxiliary simplex-valued variable.<n>Simplax improves the generative perplexity--entropy tradeoff on unconditional OpenWebText generation.
  arXiv  Detail & Related papers  (2026-08-11T07:58:17Z)
• Beyond Negative-Ridge Endpoints: Mixed-Sign Spectral Regularization via Negative-Shifted Gradient Descent [11.327284468812948]
  We show that negative-shifted gradient descent escapes a structural constraint.<n>The filter is smooth at the would-be pole and mixed-sign-capable.<n>A finite-grid hold-out inequality transfers the separations to the validation-selected algorithm.
  arXiv  Detail & Related papers  (2026-07-24T16:42:46Z)
• Rethinking Structural Anomaly Detection: From Decision Boundaries to Projection Operators [51.771100367755544]
  We introduce a geometric perspective to address the mismatch between the inductive bias of existing methods and the structure of the data.<n>Specifically, we learn a projection operator onto the manifold of normal samples and define a sample as anomalous if it is altered by this projection.<n> Notably, it provides a unifying interpretation of reconstruction-based methods by explaining their success and failure in terms of projection quality.
  arXiv  Detail & Related papers  (2026-06-13T12:37:20Z)
• Need We Teach Foundation Models What is a Generative Image? Gradient-Free Generative Artifact Detection via Analytic Spectral Adaptation [3.881211374324378]
  Adapting foundation models to detect generative artifacts via gradient-based updates compromises their intrinsic representations.<n>We propose a gradient-free methodology reframing detection from binary classification to an out-of-distribution (OOD) anomaly measurement problem.
  arXiv  Detail & Related papers  (2026-06-03T13:04:23Z)
• Rate-optimal neural boundary detection from unlabeled noisy images [1.8620637029128548]
  We study boundary detection for unlabeled noisy images from a statistical perspective.<n>Motivated by robust Gibbs posterior approaches, we propose a continuous hinge-type surrogate loss for boundary detection.<n>The proposed loss is amenable to gradient-based optimization and can be combined with deep neural networks to represent complex object boundaries.
  arXiv  Detail & Related papers  (2026-05-30T12:58:09Z)
• The conditional-mean barrier: From deterministic regression to conditional distribution learning [6.160113667162026]
  This tutorial develops a self-contained module centered on the conditional-mean barrier.<n>Adding latent randomness to a squared-loss predictor collapses it back to the conditional mean.<n>We briefly organize common distributional objectives, including negative log-likelihood, moment and observable matching, variational objectives, adversarial divergences, and score matching.
  arXiv  Detail & Related papers  (2026-05-27T07:31:42Z)
• Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees [10.73598638822051]
  We study zero-shot conditional sampling with pretrained diffusion models for linear inverse problems.<n>We prove that the error from replacing this score by the unconditional tangent score is upper bounded by a dimension-free conditional mutual information between observed and unobserved components.
  arXiv  Detail & Related papers  (2026-05-06T19:19:54Z)
• The Hidden Cost of Approximation in Online Mirror Descent [56.99972253009168]
  Online mirror descent (OMD) is a fundamental algorithmic paradigm that underlies many algorithms in optimization, machine learning and sequential decision-making.<n>In this work we initiate a systematic study into inexact OMD, and uncover an intricate relation between regularizer smoothness and robustness to approximation errors.
  arXiv  Detail & Related papers  (2025-11-27T10:09:07Z)
• Unlearning-based Neural Interpretations [51.99182464831169]
  We show that current baselines defined using static functions are biased, fragile and manipulable.<n>We propose UNI to compute an (un)learnable, debiased and adaptive baseline by perturbing the input towards an unlearning direction of steepest ascent.
  arXiv  Detail & Related papers  (2024-10-10T16:02:39Z)
• RecDiffusion: Rectangling for Image Stitching with Diffusion Models [53.824503710254206]
  We introduce a novel diffusion-based learning framework, textbfRecDiffusion, for image stitching rectangling. This framework combines Motion Diffusion Models (MDM) to generate motion fields, effectively transitioning from the stitched image's irregular borders to a geometrically corrected intermediary.
  arXiv  Detail & Related papers  (2024-03-28T06:22:45Z)
• Self-Supervised Training with Autoencoders for Visual Anomaly Detection [61.62861063776813]
  We focus on a specific use case in anomaly detection where the distribution of normal samples is supported by a lower-dimensional manifold. We adapt a self-supervised learning regime that exploits discriminative information during training but focuses on the submanifold of normal examples. We achieve a new state-of-the-art result on the MVTec AD dataset -- a challenging benchmark for visual anomaly detection in the manufacturing domain.
  arXiv  Detail & Related papers  (2022-06-23T14:16:30Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.