{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/linear-beta-schedule","entry":"linear_beta_schedule","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":42,"n_papers_ran":35,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":22,"n_samples_ran":16,"n_samples_fingerprinted":12,"n_places":43,"n_places_pointer_only":20,"by_status":{"ran_honours":10,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":6},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.11831","paper":"/paper/arxiv-2606-11831","title":"From Uniform to Learned Graph Priors: Diffusion for Structure Discovery","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Hardy158118/Diffprior","path":"NRI_with_diffusion/diffusion_prior2.py","file_url":"https://github.com/Hardy158118/Diffprior/blob/HEAD/NRI_with_diffusion/diffusion_prior2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"afad0080cce6a218","mcp_get_code":{"code_sha256":"afad0080cce6a218"}},{"arxiv_id":"2605.27095","paper":"/paper/arxiv-2605-27095","title":"Adversarial Dual On-Policy Distillation from Expressive Teacher","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vanzll/FA-OPD","path":"faopd/ddpm/policy_model.py","file_url":"https://github.com/vanzll/FA-OPD/blob/HEAD/faopd/ddpm/policy_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"37a36e71b86103ce","mcp_get_code":{"code_sha256":"37a36e71b86103ce"}},{"arxiv_id":"2605.21282","paper":"/paper/arxiv-2605-21282","title":"Stochastic MeanFlow Policies: One-Step Generative Control with Entropic Mirror Descent","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"diffusionyes/MaxEntDP","path":"jaxrl5/networks/diffusion.py","file_url":"https://github.com/diffusionyes/MaxEntDP/blob/HEAD/jaxrl5/networks/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0cd44ae2231fcb3b","mcp_get_code":{"code_sha256":"0cd44ae2231fcb3b"}},{"arxiv_id":"2603.23719","paper":"/paper/arxiv-2603-23719","title":"CDMT-EHR: A Continuous-Time Diffusion Framework for Generating Mixed-Type Time-Series Electronic Health Records","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"482723f534770483","mcp_get_code":{"code_sha256":"482723f534770483"}},{"arxiv_id":"2512.07289","paper":"/paper/arxiv-2512-07289","title":"Equivariant Diffusion for Crystal Structure Prediction","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"EmperorJia/EquiCSP","path":"equicsp/pl_modules/diff_utils.py","file_url":"https://github.com/EmperorJia/EquiCSP/blob/HEAD/equicsp/pl_modules/diff_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84a1879c66fb8e8b","mcp_get_code":{"code_sha256":"84a1879c66fb8e8b"}},{"arxiv_id":"2505.12283","paper":"/paper/addressing-missing-data-issue-for-diffusion","title":"Addressing Missing Data Issue for Diffusion-based Recommendation","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maowenyu-11/TDM","path":"TDM.py","file_url":"https://github.com/maowenyu-11/TDM/blob/HEAD/TDM.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b3d941e8a7485c5","mcp_get_code":{"code_sha256":"4b3d941e8a7485c5"}},{"arxiv_id":"2503.00522","paper":"/paper/periodic-materials-generation-using-text","title":"Periodic Materials Generation using Text-Guided Joint Diffusion Model","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdmsit/TGDMat","path":"csp_task/model/diff_utils.py","file_url":"https://github.com/kdmsit/TGDMat/blob/HEAD/csp_task/model/diff_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84a1879c66fb8e8b","mcp_get_code":{"code_sha256":"84a1879c66fb8e8b"}},{"arxiv_id":"2502.05932","paper":"/paper/skill-expansion-and-composition-in-parameter","title":"Skill Expansion and Composition in Parameter Space","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ltlhuuu/PSEC","path":"jaxrl5/networks/diffusion.py","file_url":"https://github.com/ltlhuuu/PSEC/blob/HEAD/jaxrl5/networks/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0cd44ae2231fcb3b","mcp_get_code":{"code_sha256":"0cd44ae2231fcb3b"}},{"arxiv_id":"2502.05450","paper":"/paper/conrft-a-reinforced-fine-tuning-method-for","title":"ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy","date":"2025-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cccedric/conrft","path":"serl_launcher/serl_launcher/networks/diffusion_nets.py","file_url":"https://github.com/cccedric/conrft/blob/HEAD/serl_launcher/serl_launcher/networks/diffusion_nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0cd44ae2231fcb3b","mcp_get_code":{"code_sha256":"0cd44ae2231fcb3b"}},{"arxiv_id":"2412.09328","paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Models/autoregressive_diffusion/armd.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Models/autoregressive_diffusion/armd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"482723f534770483","mcp_get_code":{"code_sha256":"482723f534770483"}},{"arxiv_id":"2412.09328","paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Models/autoregressive_diffusion/linear.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Models/autoregressive_diffusion/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1c96b38eaa2a9e7","mcp_get_code":{"code_sha256":"b1c96b38eaa2a9e7"}},{"arxiv_id":"2410.14488","paper":"/paper/ant-adaptive-noise-schedule-for-time-series","title":"ANT: Adaptive Noise Schedule for Time Series Diffusion Models","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seunghan96/ANT","path":"ANT_utils.py","file_url":"https://github.com/seunghan96/ANT/blob/HEAD/ANT_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c62c17c347c7b739","mcp_get_code":{"code_sha256":"c62c17c347c7b739"}},{"arxiv_id":"2410.13117","paper":"/paper/preference-diffusion-for-recommendation","title":"Preference Diffusion for Recommendation","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"4b3d941e8a7485c5","mcp_get_code":{"code_sha256":"4b3d941e8a7485c5"}},{"arxiv_id":"2410.06549","paper":"/paper/diffgad-a-diffusion-based-unsupervised-graph","title":"DiffGAD: A Diffusion-based Unsupervised Graph Anomaly Detector","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fortunato-all/LJH_DiffGAD","path":"utils.py","file_url":"https://github.com/fortunato-all/LJH_DiffGAD/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"37a36e71b86103ce","mcp_get_code":{"code_sha256":"37a36e71b86103ce"}},{"arxiv_id":"2407.12538","paper":"/paper/high-frequency-matters-uncertainty-guided","title":"High Frequency Matters: Uncertainty Guided Image Compression with Wavelet Diffusion","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hejiaxiang1/wavelet-diffusion","path":"diffusion/ddpm.py","file_url":"https://github.com/hejiaxiang1/wavelet-diffusion/blob/HEAD/diffusion/ddpm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"482723f534770483","mcp_get_code":{"code_sha256":"482723f534770483"}},{"arxiv_id":"2406.09326","paper":"/paper/pianomotion10m-dataset-and-benchmark-for-hand","title":"PianoMotion10M: Dataset and Benchmark for Hand Motion Generation in Piano Performance","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agnjason/pianomotion10m","path":"models/denoise_diffusion.py","file_url":"https://github.com/agnjason/pianomotion10m/blob/HEAD/models/denoise_diffusion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"482723f534770483","mcp_get_code":{"code_sha256":"482723f534770483"}},{"arxiv_id":"2404.14743","paper":"/paper/gradient-guidance-for-diffusion-models-an","title":"Gradient Guidance for Diffusion Models: An Optimization Perspective","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukang123/ggdmoptim","path":"simulations/diffusion.py","file_url":"https://github.com/yukang123/ggdmoptim/blob/HEAD/simulations/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ef43df46647b5b46","mcp_get_code":{"code_sha256":"ef43df46647b5b46"}},{"arxiv_id":"2403.17259","paper":"/paper/diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntkien1904/dmns","path":"model/model.py","file_url":"https://github.com/ntkien1904/dmns/blob/HEAD/model/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"37a36e71b86103ce","mcp_get_code":{"code_sha256":"37a36e71b86103ce"}},{"arxiv_id":"2403.01734","paper":"/paper/offline-goal-conditioned-reinforcement","title":"Offline Goal-Conditioned Reinforcement Learning for Safety-Critical Tasks with Recovery Policy","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunlighted/rbsl","path":"rl_modules/helpers.py","file_url":"https://github.com/sunlighted/rbsl/blob/HEAD/rl_modules/helpers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"63d21c7afce1a9e5","mcp_get_code":{"code_sha256":"63d21c7afce1a9e5"}},{"arxiv_id":"2402.19302","paper":"/paper/diffassemble-a-unified-graph-diffusion-model","title":"DiffAssemble: A Unified Graph-Diffusion Model for 2D and 3D Reassembly","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iit-pavis/diffassemble","path":"puzzle_diff/model/spatial_diffusion.py","file_url":"https://github.com/iit-pavis/diffassemble/blob/HEAD/puzzle_diff/model/spatial_diffusion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"37a36e71b86103ce","mcp_get_code":{"code_sha256":"37a36e71b86103ce"}},{"arxiv_id":"2402.06559","paper":"/paper/diffusion-es-gradient-free-planning-with","title":"Diffusion-ES: Gradient-free Planning with Diffusion for Autonomous Driving and Zero-Shot Instruction Following","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bhyang/diffusion-es","path":"nuplan-devkit/nuplan/planning/training/modeling/models/diffusion_utils.py","file_url":"https://github.com/bhyang/diffusion-es/blob/HEAD/nuplan-devkit/nuplan/planning/training/modeling/models/diffusion_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e8ee6936e1f689c","mcp_get_code":{"code_sha256":"8e8ee6936e1f689c"}},{"arxiv_id":"2401.14404","paper":"/paper/deconstructing-denoising-diffusion-models-for","title":"Deconstructing Denoising Diffusion Models for Self-Supervised Learning","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futurexiang/ddae","path":"model/DDPM.py","file_url":"https://github.com/futurexiang/ddae/blob/HEAD/model/DDPM.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6dea3711db7301ac","mcp_get_code":{"code_sha256":"6dea3711db7301ac"}},{"arxiv_id":"2401.10700","paper":"/paper/safe-offline-reinforcement-learning-with","title":"Safe Offline Reinforcement Learning with Feasibility-Guided Diffusion Model","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengyinan-air/fisor","path":"jaxrl5/networks/diffusion.py","file_url":"https://github.com/zhengyinan-air/fisor/blob/HEAD/jaxrl5/networks/diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0cd44ae2231fcb3b","mcp_get_code":{"code_sha256":"0cd44ae2231fcb3b"}},{"arxiv_id":"2312.08533","paper":"/paper/world-models-via-policy-guided-trajectory","title":"World Models via Policy-Guided Trajectory Diffusion","date":"2023-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marc-rigter/polygrad-world-models","path":"polygrad/models/helpers.py","file_url":"https://github.com/marc-rigter/polygrad-world-models/blob/HEAD/polygrad/models/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a01c4a94e1b491c","mcp_get_code":{"code_sha256":"3a01c4a94e1b491c"}},{"arxiv_id":"2311.17901","paper":"/paper/soda-bottleneck-diffusion-models-for","title":"SODA: Bottleneck Diffusion Models for Representation Learning","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futurexiang/soda","path":"model/SODA.py","file_url":"https://github.com/futurexiang/soda/blob/HEAD/model/SODA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6dea3711db7301ac","mcp_get_code":{"code_sha256":"6dea3711db7301ac"}},{"arxiv_id":"2310.20487","paper":"/paper/large-language-model-can-interpret-latent","title":"Large Language Model Can Interpret Latent Space of Sequential Recommender","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzhengyi98/dreamrec","path":"DreamRec.py","file_url":"https://github.com/yangzhengyi98/dreamrec/blob/HEAD/DreamRec.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b3d941e8a7485c5","mcp_get_code":{"code_sha256":"4b3d941e8a7485c5"}},{"arxiv_id":"2310.05333","paper":"/paper/diffcps-diffusion-model-based-constrained","title":"DiffCPS: Diffusion Model based Constrained Policy Search for Offline Reinforcement Learning","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felix-thu/DiffCPS","path":"agents/diffcps.py","file_url":"https://github.com/felix-thu/DiffCPS/blob/HEAD/agents/diffcps.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"63d21c7afce1a9e5","mcp_get_code":{"code_sha256":"63d21c7afce1a9e5"}},{"arxiv_id":"2309.01745","paper":"/paper/turbulent-flow-simulation-using","title":"Benchmarking Autoregressive Conditional Diffusion Models for Turbulent Flow Simulation","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/autoreg-pde-diffusion","path":"src/turbpred/model_diffusion_blocks.py","file_url":"https://github.com/tum-pbs/autoreg-pde-diffusion/blob/HEAD/src/turbpred/model_diffusion_blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3628306c692a3215","mcp_get_code":{"code_sha256":"3628306c692a3215"}},{"arxiv_id":"2308.12952","paper":"/paper/bridgedata-v2-a-dataset-for-robot-learning-at","title":"BridgeData V2: A Dataset for Robot Learning at Scale","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rail-berkeley/BridgeData-V2","path":"jaxrl_m/networks/diffusion_nets.py","file_url":"https://github.com/rail-berkeley/BridgeData-V2/blob/HEAD/jaxrl_m/networks/diffusion_nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0cd44ae2231fcb3b","mcp_get_code":{"code_sha256":"0cd44ae2231fcb3b"}},{"arxiv_id":"2306.13384","paper":"/paper/diffinfinite-large-mask-image-synthesis-via","title":"DiffInfinite: Large Mask-Image Synthesis via Parallel Random Patch Diffusion in Histopathology","date":"2023-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcoaversa/diffinfinite","path":"dm.py","file_url":"https://github.com/marcoaversa/diffinfinite/blob/HEAD/dm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"482723f534770483","mcp_get_code":{"code_sha256":"482723f534770483"}},{"arxiv_id":"2306.11363","paper":"/paper/masked-diffusion-models-are-fast-learners","title":"Masked Diffusion Models Are Fast Distribution Learners","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiachenlei/maskdm","path":"gaussian_ddpm.py","file_url":"https://github.com/jiachenlei/maskdm/blob/HEAD/gaussian_ddpm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"482723f534770483","mcp_get_code":{"code_sha256":"482723f534770483"}},{"arxiv_id":"2306.06874","paper":"/paper/villandiffusion-a-unified-backdoor-attack-1","title":"VillanDiffusion: A Unified Backdoor Attack Framework for Diffusion Models","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/villandiffusion","path":"loss.py","file_url":"https://github.com/IBM/villandiffusion/blob/HEAD/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"37a36e71b86103ce","mcp_get_code":{"code_sha256":"37a36e71b86103ce"}},{"arxiv_id":"2303.09769","paper":"/paper/denoising-diffusion-autoencoders-are-unified","title":"Denoising Diffusion Autoencoders are Unified Self-supervised Learners","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"6dea3711db7301ac","mcp_get_code":{"code_sha256":"6dea3711db7301ac"}},{"arxiv_id":"2302.11552","paper":"/paper/reduce-reuse-recycle-compositional-generation","title":"Reduce, Reuse, Recycle: Compositional Generation with Energy-Based Diffusion Models and MCMC","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackonelli/mcmc_corr_score_diffusion","path":"src/diffusion/beta_schedules.py","file_url":"https://github.com/jackonelli/mcmc_corr_score_diffusion/blob/HEAD/src/diffusion/beta_schedules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d285d148cec3cf9","mcp_get_code":{"code_sha256":"2d285d148cec3cf9"}},{"arxiv_id":"2301.12485","paper":"/paper/generating-novel-designable-and-diverse","title":"Generating Novel, Designable, and Diverse Protein Structures by Equivariantly Diffusing Oriented Residue Clouds","date":"2023-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aqlaboratory/genie","path":"genie/diffusion/schedule.py","file_url":"https://github.com/aqlaboratory/genie/blob/HEAD/genie/diffusion/schedule.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c272b47dbf7a9212","mcp_get_code":{"code_sha256":"c272b47dbf7a9212"}},{"arxiv_id":"2209.15611","paper":"/paper/protein-structure-generation-via-folding","title":"Protein structure generation via folding diffusion","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/foldingdiff","path":"foldingdiff/beta_schedules.py","file_url":"https://github.com/microsoft/foldingdiff/blob/HEAD/foldingdiff/beta_schedules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d79d8da3ec92f2f8","mcp_get_code":{"code_sha256":"d79d8da3ec92f2f8"}},{"arxiv_id":"2208.04202","paper":"/paper/analog-bits-generating-discrete-data-using","title":"Analog Bits: Generating Discrete Data using Diffusion Models with Self-Conditioning","date":"2022-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pinellolab/dna-diffusion","path":"src/dnadiffusion/models/diffusion.py","file_url":"https://github.com/pinellolab/dna-diffusion/blob/HEAD/src/dnadiffusion/models/diffusion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"96c65b4e8f4db8cd","mcp_get_code":{"code_sha256":"96c65b4e8f4db8cd"}},{"arxiv_id":"2206.00927","paper":"/paper/dpm-solver-a-fast-ode-solver-for-diffusion","title":"DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astra-vision/LiDPM","path":"lidpm/utils/scheduling.py","file_url":"https://github.com/astra-vision/LiDPM/blob/HEAD/lidpm/utils/scheduling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"84a1879c66fb8e8b","mcp_get_code":{"code_sha256":"84a1879c66fb8e8b"}},{"arxiv_id":"2204.00227","paper":"/paper/perception-prioritized-training-of-diffusion","title":"Perception Prioritized Training of Diffusion Models","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiyixuxu/denoising-diffusion-flax","path":"denoising_diffusion_flax/utils.py","file_url":"https://github.com/yiyixuxu/denoising-diffusion-flax/blob/HEAD/denoising_diffusion_flax/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8f45dd6e777921e5","mcp_get_code":{"code_sha256":"8f45dd6e777921e5"}},{"arxiv_id":"2102.09672","paper":"/paper/improved-denoising-diffusion-probabilistic-1","title":"Improved Denoising Diffusion Probabilistic Models","date":"2021-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YHL04/ddpm","path":"ddpm.py","file_url":"https://github.com/YHL04/ddpm/blob/HEAD/ddpm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"412c5c40339e2941","mcp_get_code":{"code_sha256":"412c5c40339e2941"}},{"arxiv_id":"2010.02502","paper":"/paper/denoising-diffusion-implicit-models-1","title":"Denoising Diffusion Implicit Models","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4science-westlakeu/cl_diffphycon","path":"diffusion/diffusion_2d.py","file_url":"https://github.com/ai4science-westlakeu/cl_diffphycon/blob/HEAD/diffusion/diffusion_2d.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a00659c3eac0648","mcp_get_code":{"code_sha256":"6a00659c3eac0648"}},{"arxiv_id":"1710.11248","paper":"/paper/learning-robust-rewards-with-adversarial","title":"Learning Robust Rewards with Adversarial Inverse Reinforcement Learning","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohitrango/Reward-bias-in-GAIL","path":"src/imitation/algorithms/dagger.py","file_url":"https://github.com/rohitrango/Reward-bias-in-GAIL/blob/HEAD/src/imitation/algorithms/dagger.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"41fbf53df6ae4012","mcp_get_code":{"code_sha256":"41fbf53df6ae4012"}},{"arxiv_id":"Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","paper":null,"title":"arXiv:Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TheLaoLab/UIBDiffusion","path":"loss.py","file_url":"https://github.com/TheLaoLab/UIBDiffusion/blob/HEAD/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"37a36e71b86103ce","mcp_get_code":{"code_sha256":"37a36e71b86103ce"}}]}