Sign inGet started
Paper · arXiv

Certified Robustness from Approximate Gaussian Mixture Structures in Pretrained Latent Spaces

Deep learning models are vulnerable to adversarial perturbations, raising important concerns for safety-critical deployment. Empirical defenses can achieve strong robustness in practice, but lack formal guarantees, motivating the need for certifiably robust classifiers. While certified methods provide formal guarantees, they often yield overly conservative bounds due to their inability to exploit structure in complex data distributions. In this work, we propose a framework for designing certifiably robust classifiers that leverages latent structure in data representations. We first analyze the Gaussian mixture setting, deriving necessary and sufficient conditions for the existence of robu...

AuthorsKonstantinos Emmanouilidis, Tianjiao Ding, Nghia Nguyen et al.
Primary categorycs.LG
Published25 May 2026
Last updated at source25 May 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/df9ec9c5-ee33-4c3d-99ef-1a6cd8e82622" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.