Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jonas Ngnawé

dblp:381/1311 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 58% Transfer learning and domain adaptation · 42%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › parameter-efficient transfer learning
layer selection
0.912025
A Layer Selection Approach to Test Time Adaptation · AAAI 2025
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.912025
A Layer Selection Approach to Test Time Adaptation · AAAI 2025
Machine learning › Transfer learning and domain adaptation
test-time adaptation
0.912025
A Layer Selection Approach to Test Time Adaptation · AAAI 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.812024
Detecting Brittle Decisions for Free: Leveraging Margin Consistency in Deep Robust Classifiers · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Detecting Brittle Decisions for Free: Leveraging Margin Consistency in Deep Robust Classifiers · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

test time adaptation loss · 0.9gradient-based layer selection · 0.9adversarial training · 0.8
YearPublicationVenuePosition
2025 A Layer Selection Approach to Test Time Adaptation
abstract
Test Time Adaptation (TTA) addresses the problem of distribution shift by adapting a pretrained model to a new domain during inference. When faced with challenging shifts, most methods collapse and perform worse than the original pretrained model. In this paper, we find that not all layers are equally receptive to the adaptation, and the layers with the most misaligned gradients often cause performance degradation. To address this, we propose GALA, a novel layer selection criterion to identify the most beneficial updates to perform during test time adaptation. This criterion can also filter out unreliable samples with noisy gradients. Its simplicity allows seamless integration with existing TTA loss functions, thereby preventing degradation and focusing adaptation on the most trainable layers. This approach also helps to regularize adaptation to preserve the pretrained features, which are crucial for handling unseen domains. Through extensive experiments, we demonstrate that the proposed layer selection framework improves the performance of existing TTA approaches across multiple datasets, domain shifts, model architectures, and TTA losses.
Sabyasachi Sahoo, Mostafa ElAraby, Jonas Ngnawé, Yann Pequignot, Frédéric Precioso, Christian Gagné 0001
AAAI3
2024 Detecting Brittle Decisions for Free: Leveraging Margin Consistency in Deep Robust Classifiers
abstract
Despite extensive research on adversarial training strategies to improve robustness, the decisions of even the most robust deep learning models can still be quite sensitive to imperceptible perturbations, creating serious risks when deploying them for high-stakes real-world applications. While detecting such cases may be critical, evaluating a model's vulnerability at a per-instance level using adversarial attacks is computationally too intensive and unsuitable for real-time deployment scenarios. The input space margin is the exact score to detect non-robust samples and is intractable for deep neural networks. This paper introduces the concept of margin consistency -- a property that links the input space margins and the logit margins in robust models -- for efficient detection of vulnerable samples. First, we establish that margin consistency is a necessary and sufficient condition to use a model's logit margin as a score for identifying non-robust samples. Next, through comprehensive empirical analysis of various robustly trained models on CIFAR10 and CIFAR100 datasets, we show that they indicate high margin consistency with a strong correlation between their input space margins and the logit margins. Then, we show that we can effectively use the logit margin to confidently detect brittle decisions with such models. Finally, we address cases where the model is not sufficiently margin-consistent by learning a pseudo-margin from the feature representation. Our findings highlight the potential of leveraging deep representations to efficiently assess adversarial vulnerability in deployment scenarios.
Jonas Ngnawé, Sabyasachi Sahoo, Yann Pequignot, Frédéric Precioso, Christian Gagné 0001
NeurIPS1