Pith. sign in

REVIEW 6 cited by

Diffusion Models for Constrained Domains

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.05364 v2 pith:YCA4X775 submitted 2023-04-11 cs.LG stat.ML

classification cs.LGstat.ML
keywords diffusionmodelstasksappliedconstraintsdomainsframeworkincluding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Denoising diffusion models are a novel class of generative algorithms that achieve state-of-the-art performance across a range of domains, including image generation and text-to-image tasks. Building on this success, diffusion models have recently been extended to the Riemannian manifold setting, broadening their applicability to a range of problems from the natural and engineering sciences. However, these Riemannian diffusion models are built on the assumption that their forward and backward processes are well-defined for all times, preventing them from being applied to an important set of tasks that consider manifolds defined via a set of inequality constraints. In this work, we introduce a principled framework to bridge this gap. We present two distinct noising processes based on (i) the logarithmic barrier metric and (ii) the reflected Brownian motion induced by the constraints. As existing diffusion model techniques cannot be applied in this setting, we derive new tools to define such models in our framework. We then demonstrate the practical utility of our methods on a number of synthetic and real-world tasks, including applications from robotics and protein design.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DiPhon: Diffusion on Graphons for Scalable Graph Generation

    stat.ML 2026-07 conditional novelty 7.0 of 10

    A Jacobi diffusion on graphon space is discretized into a graph-level generative process that matches the continuous process's first moment exactly and second moment up to a closed-form gap, enabling out-of-scale grap...

  2. A collaborative constrained graph diffusion model for the generation of realistic synthetic molecules

    cs.LG 2025-05 conditional novelty 7.0 of 10

    A valence-preserving double edge-swap diffusion model with a learned time estimator generates chemically valid molecules with property distributions closer to real molecules than JTVAE and DiGress on the GuacaMol benchmark.

  3. Motion Planning with Model-Based Diffusion via Constraint Optimization and Adaptive Scheduling

    cs.RO 2026-07 conditional novelty 6.0 of 10

    MD-COAS unifies inexact augmented-Lagrangian soft constraints with convex-feasible-set hard projection and adaptively schedules them during model-based diffusion, improving safe and successful planning in non-convex e...

  4. Picasso: Holistic Scene Reconstruction with Physics-Constrained Sampling

    cs.CV 2026-02 unverdicted novelty 6.0 of 10

    Picasso produces multi-object scene reconstructions that are both geometrically accurate and physically plausible by using physics-constrained rejection sampling over an inferred contact graph, outperforming prior met...

  5. Constrained Diffusers for Safe Planning and Control

    eess.SY 2025-06 conditional novelty 5.0 of 10

    Constrained Diffusers enforces trajectory constraints on pre-trained diffusion models without retraining by replacing the reverse process with constrained Langevin sampling.

  6. Bayesian Inference of Discretization Error Means in ODEs via Ensemble Kalman Filtering

    math.NA 2026-07 conditional novelty 4.0 of 10

    A Bayesian state-space model with an Ensemble Kalman Filter infers the mean of ODE discretization errors from noisy observations, using a step-size-dependent Markov prior whose convergence is proven.

Pith tools