[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-diffusion-models-that-always-follow-the-rules":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},1780,"diffusion-models-that-always-follow-the-rules","Diffusion Models That Always Follow the Rules","A new framework forces AI image and data generators to satisfy hard constraints every time, not just most of the time.","Researchers have built a guidance framework for diffusion models that guarantees constraint satisfaction — no exceptions, no near-misses.\n\nThe paper, posted to arXiv, addresses a gap in how conditional generation works today. Existing methods — soft guidance, reward-based steering — nudge a model toward a desired output but can't promise it arrives there. The new approach draws on Doob's h-transform, a tool from probability theory, to inject an explicit drift correction into a pretrained diffusion model's sampling process. Crucially, it does this without retraining the underlying score network, which means it can be bolted onto existing models. Two off-policy learning algorithms estimate the required functions from trajectories the pretrained model already produces.\n\nThis matters most in safety-critical settings where \"usually works\" isn't good enough — think rare-event simulation in financial risk modeling or physical systems where an out-of-bounds sample isn't just wrong, it's dangerous. The authors back the approach with non-asymptotic error bounds in both total variation and Wasserstein distances, which puts it on firmer theoretical ground than most guidance methods in circulation.\n\nDiffusion models have dominated generative AI for years, but their conditioning story has always leaned on probabilistic encouragement rather than hard guarantees. Whether this framework scales cleanly beyond the numerical experiments shown — finance simulations, not image generation — remains the open question.","[\"diffusion models\",\"ai research\",\"generative ai\",\"safety\"]","2026-06-19T04:00:00.000Z","2026-06-19T11:44:36.275Z","2026-06-19T14:22:19.137Z","published",null,[],"ai",[26,27,28,29],"diffusion models","ai research","generative ai","safety",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2602.05533",0,{"sections":36},[37,41,45,50,55,60,65,69,73,78,83,88,93,98],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",491,"2026-06-19T14:59:11.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":18},"Security","security",132,{"name":46,"slug":47,"count":48,"latest_published_at":49},"Policy","policy",88,"2026-06-16T09:26:09.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Consumer Tech","consumer-tech",78,"2026-06-16T17:58:24.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":59},"Hardware","hardware",62,"2026-06-18T15:24:16.000Z",{"name":61,"slug":62,"count":63,"latest_published_at":64},"Deals","deals",58,"2026-06-19T14:43:50.000Z",{"name":66,"slug":67,"count":63,"latest_published_at":68},"Software","software","2026-06-16T20:00:00.000Z",{"name":70,"slug":71,"count":72,"latest_published_at":18},"Dev Tools","dev-tools",50,{"name":74,"slug":75,"count":76,"latest_published_at":77},"Science","science",38,"2026-06-18T04:00:00.000Z",{"name":79,"slug":80,"count":81,"latest_published_at":82},"Gaming","gaming",31,"2026-06-16T15:25:13.000Z",{"name":84,"slug":85,"count":86,"latest_published_at":87},"General","general",26,"2026-06-13T18:35:15.000Z",{"name":89,"slug":90,"count":91,"latest_published_at":92},"Startups","startups",23,"2026-06-16T15:00:00.000Z",{"name":94,"slug":95,"count":96,"latest_published_at":97},"Reviews","reviews",19,"2026-06-14T08:00:00.000Z",{"name":99,"slug":100,"count":101,"latest_published_at":102},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]