Angelique Loesch

Angelique Loesch

Auto-generated profile, based on publicly available information

Angelique Loesch

Université Paris-Saclay, CEA, List

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 November 2021 in IEEE Access
Verified
Journal Article
Open access
FDFabian Dubourvieux
Fabian Dubourvieux
ALAngelique Loesch
Angelique Loesch
RARomaric Audigier
Romaric Audigier
SASamia Ainouz
Samia Ainouz
SCStephane Canu
Stephane Canu
Unsupervised Domain Adaptation (UDA) for re-identification (re-ID) is a challenging task: to avoid a costly annotation of additional data, it aims at transferring knowledge from a domain with annotated data to a domain of interest with only unlabeled data. Pseudo-labeling approaches have proven to be effective for UDA re-ID. However, the effectiveness of these approaches heavily depends on the choice of some hyperparameters (HP) that affect the generation of pseudo-labels by clustering. The lack of annotation in the domain of interest makes this choice non-trivial. Current approaches simply reuse the same empirical value for all adaptation tasks and regardless of the target data representation that changes through pseudo-labeling training phases. As this simplistic choice may limit their performance, we aim at addressing this issue. We propose new theoretical grounds on HP selection for clustering UDA re-ID as well as method of automatic and cyclic HP tuning for pseudo-labeling UDA clustering: HyPASS. HyPASS consists in incorporating two modules in pseudo-labeling methods: (i) HP selection based on a labeled source validation set and (ii) conditional domain alignment of feature discriminativeness to improve HP selection based on source samples. Experiments on commonly used person re-ID and vehicle re-ID datasets show that our proposed HyPASS consistently improves the best state-of-the-art methods in re-ID compared to the commonly used empirical HP setting.

4 August 2022 in Computer Vision and Image Understanding
Verified
Journal Article
Closed access
FDFabian Dubourvieux
Fabian Dubourvieux
RARomaric Audigier
Romaric Audigier
ALAngélique Loesch
Angélique Loesch
SASamia Ainouz
Samia Ainouz
SCStéphane Canu
Stéphane Canu

30 June 2018 in Machine Vision and Applications
Verified
Journal Article
Closed access
PDF file
ALAngelique Loesch
Angelique Loesch
SBSteve Bourgeois
Steve Bourgeois
VGVincent Gay-Bellile
Vincent Gay-Bellile
OGOlivier Gomez
Olivier Gomez
MDMichel Dhome
Michel Dhome

20 October 2022
Verified
Book Chapter
Closed access
PDF file
QBQuentin Bouniot
Quentin Bouniot
IRIevgen Redko
Ievgen Redko
RARomaric Audigier
Romaric Audigier
ALAngélique Loesch
Angélique Loesch
AHAmaury Habrard
Amaury Habrard

30 March 2021 in arXiv
Verified
Preprint
Open access
PDF file
QBQuentin Bouniot
Quentin Bouniot
RARomaric Audigier
Romaric Audigier
ALAngélique Loesch
Angélique Loesch
Deep learning classifiers are now known to have flaws in the representations of their class. Adversarial attacks can find a human-imperceptible perturbation for a given image that will mislead a trained model. The most effective methods to defend against such attacks trains on generated adversarial examples to learn their distribution. Previous work aimed to align original and adversarial image representations in the same way as domain adaptation to improve robustness. Yet, they partially align the representations using approaches that do not reflect the geometry of space and distribution. In addition, it is difficult to accurately compare robustness between defended models. Until now, they have been evaluated using a fixed perturbation size. However, defended models may react differently to variations of this perturbation size. In this paper, the analogy of domain adaptation is taken a step further by exploiting optimal transport theory. We propose to use a loss between distributions that faithfully reflect the ground distance. This leads to SAT (Sinkhorn Adversarial Training), a more robust defense against adversarial attacks. Then, we propose to quantify more precisely the robustness of a model to adversarial attacks over a wide range of perturbation sizes using a different metric, the Area Under the Accuracy Curve (AUAC). We perform extensive experiments on both CIFAR-10 and CIFAR-100 datasets and show that our defense is globally more robust than the state-of-the-art.