Papers › GLAD: Towards Better Reconstruction with Global and Local Adaptive Diffusion Models...
GLAD: Towards Better Reconstruction with Global and Local Adaptive Diffusion Models for Unsupervised Anomaly Detection
Hang Yao, Ming Liu, Haolin Wang, Zhicun Yin, Zifei Yan, Xiaopeng Hong, WangMeng Zuo
Diffusion models have shown superior performance on unsupervised anomaly detection tasks. Since trained with normal data only, diffusion models tend to reconstruct normal counterparts of test images with certain noises added. However, these methods treat all potential anomalies equally, which may cause two main problems. From the global perspective, the difficulty of reconstructing images with different anomalies is uneven. Therefore, instead of utilizing the same setting for all samples, we propose to predict a particular denoising step for each sample by evaluating the difference between image contents and the priors extracted from diffusion models. From the local perspective, reconstructing abnormal regions differs from normal areas even in the same image. Theoretically, the diffusion model predicts a noise for each step, typically following a standard Gaussian distribution. However, due to the difference between the anomaly and its potential normal counterpart, the predicted noise in abnormal regions will inevitably deviate from the standard Gaussian distribution. To this end, we propose introducing synthetic abnormal samples in training to encourage the diffusion models to break through the limitation of standard Gaussian distribution, and a spatial-adaptive feature fusion scheme is utilized during inference. With the above modifications, we propose a global and local adaptive diffusion model (abbreviated to GLAD) for unsupervised anomaly detection, which introduces appealing flexibility and achieves anomaly-free reconstruction while retaining as much normal information as possible. Extensive experiments are conducted on three commonly used anomaly detection datasets (MVTec-AD, MPDD, and VisA) and a printed circuit board dataset (PCB-Bank) we integrated, showing the effectiveness of the proposed method.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2406.07487")
Code
Syntology Ran 10 of 15 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 2 ran · honoured contract; 2 ran · our draft was wrong; 1 ran · fixture could not drive it; 5 ran with no contract checked.
By repository: official repository: 15 samples from 1 repository, 10 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
15 samples harvested; 10 ran; 2 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 0 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from hyao1/glad. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
f1e3f7493aad4745 · report
c19231378e41dc5a · report
2b5489053b222e00 · report
361a6b24f11fc50a · report
55120f2026b56aa2 · report
d846bc783d914e10 · report
1606edd39398af6c · report
bea2d776a332f2b0 · report
6b47c0cd573d42ff · report
a67a2074238bd9ef · report
551bb566734184cc · report
293a2b1189b747fd · report
ed9e127befc02046 · report
4de91a4627a51ea2 · report
752b8d77518927c2 · report
Tasks
Datasets
Introduced by this paper, per the archive.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Anomaly Detection | MPDD | GLAD | Detection AUROC | 97.5 | #5 of 16 | Archive leaderboard | report |
| Anomaly Detection | MPDD | GLAD | Segmentation AUROC | 98.7 | #5 of 16 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | GLAD | Detection AUROC | 99.3 | #39 of 148 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | GLAD | Segmentation AP | 70.9 | #39 of 148 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | GLAD | Segmentation AUPRO | 95.3 | #39 of 148 | Archive leaderboard | report |
| Anomaly Detection | MVTec AD | GLAD | Segmentation AUROC | 98.6 | #39 of 148 | Archive leaderboard | report |
| Anomaly Detection | VisA | GLAD | Detection AUROC | 99.5 | #2 of 50 | Archive leaderboard | report |
| Anomaly Detection | VisA | GLAD | F1-Score | 98.3 | #2 of 50 | Archive leaderboard | report |
| Anomaly Detection | VisA | GLAD | Segmentation AUPRO | 94.3 | #2 of 50 | Archive leaderboard | report |
| Anomaly Detection | VisA | GLAD | Segmentation AUPRO (until 30% FPR) | 94.3 | #2 of 50 | Archive leaderboard | report |
| Anomaly Detection | VisA | GLAD | Segmentation AUROC | 98.6 | #2 of 50 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections