paper-with-me

홈 › Papers

Robust One-Class Classification with Signed Distance Function using 1-Lipschitz Neural Networks

2023-01-26 · Louis Bethune, Paul Novello, Thibaut Boissin, Guillaume Coiffier, Mathieu Serrurier, Quentin Vincenot, Andres Troya-Galvis

We propose a new method, dubbed One Class Signed Distance Function (OCSDF), to perform One Class Classification (OCC) by provably learning the Signed Distance Function (SDF) to the boundary of the support of any distribution. The distance to the support can be interpreted as a normality score, and its approximation using 1-Lipschitz neural networks provides robustness bounds against $l2$ adversarial attacks, an under-explored weakness of deep learning-based OCC algorithms. As a result, OCSDF comes with a new metric, certified AUROC, that can be computed at the same cost as any classical AUROC. We show that OCSDF is competitive against concurrent methods on tabular and image data while being way more robust to adversarial attacks, illustrating its theoretical properties. Finally, as exploratory research perspectives, we theoretically and empirically show how OCSDF connects OCC with image generation and implicit neural surface parametrization. Our code is available at https://github.com/Algue-Rythme/OneClassMetricLearning

📄 PDF Abstract BibTeX arXiv:2303.01978

Code (1)

algue-rythme/oneclassmetriclearning 공식 구현 tf

Tasks

Image GenerationOne-Class Classification

Similar Papers 제목 키워드 기반

1-Lipschitz Neural Distance Fields

2024-06-14 · Guillaume Coiffier, Louis Bethune

Neural implicit surfaces are a promising tool for geometry processing that represent a solid object as the zero level set of a neural network. Usually trained to approximate a signed distance function of the considered o…

DADA: Dual Averaging with Distance Adaptation

2025-01-17 · Mohammad Moshtaghifar, Anton Rodomanov, Daniil Vankov, Sebastian Stich

We present a novel universal gradient method for solving convex optimization problems. Our algorithm -- Dual Averaging with Distance Adaptation (DADA) -- is based on the classical scheme of dual averaging and dynamically…

Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspective

2022-10-04 · Bohang Zhang, Du Jiang, Di He, LiWei Wang

Designing neural networks with bounded Lipschitz constant is a promising way to obtain certifiably robust classifiers against adversarial examples. However, the relevant progress for the important $\ell_\infty$ perturbat…

Robust classification

Lipschitz Continuity of Mahalanobis Distances and Bilinear Forms

2016-04-04 · Valentina Zantedeschi, Rémi Emonet, Marc Sebban

Many theoretical results in the machine learning domain stand only for functions that are Lipschitz continuous. Lipschitz continuity is a strong form of continuity that linearly bounds the variations of a function. In th…

BIG-bench Machine Learning

Achieving robustness in classification using optimal transport with hinge regularization

2020-06-11 · CVPR 2021 1 · Mathieu Serrurier, Franck Mamalet, Alberto González-Sanz, Thibaut Boissin 외

Adversarial examples have pointed out Deep Neural Networks vulnerability to small local noise. It has been shown that constraining their Lipschitz constant should enhance robustness, but make them harder to learn with cl…

Adversarial RobustnessBinary ClassificationGeneral Classification