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

Bahar Dibaei Nia

dblp:396/8761 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 2 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
Representation and self-supervised learning · 70% Trustworthy machine learning · 30%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation matching › feature alignment
embedding alignment
0.912025
Towards an Explainable Comparison and Alignment of Feature Embeddings · ICML 2025
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
feature embedding
0.912025
Towards an Explainable Comparison and Alignment of Feature Embeddings · ICML 2025
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.812024
Scanning Trojaned Models Using Out-of-Distribution Samples · NeurIPS 2024
Security and privacy of machine learning › adversarial attack › backdoor attack › backdoor defense
backdoor detection
0.812024
Scanning Trojaned Models Using Out-of-Distribution Samples · NeurIPS 2024

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

out-of-distribution sampling · 1.5adversarial perturbation · 1.5spectral decomposition · 0.9kernel matrix analysis · 0.9
YearPublicationVenuePosition
2025 Towards an Explainable Comparison and Alignment of Feature Embeddings
abstract
While several feature embedding models have been developed in the literature, comparisons of these embeddings have largely focused on their numerical performance in classification-related downstream applications. However, an interpretable comparison of different embeddings requires identifying and analyzing mismatches between sample groups clustered within the embedding spaces. In this work, we propose the Spectral Pairwise Embedding Comparison (SPEC) framework to compare embeddings and identify their differences in clustering a reference dataset. Our approach examines the kernel matrices derived from two embeddings and leverages the eigendecomposition of the difference kernel matrix to detect sample clusters that are captured differently by the two embeddings. We present a scalable implementation of this kernel-based approach, with computational complexity that grows linearly with the sample size. Furthermore, we introduce an optimization problem using this framework to align two embeddings, ensuring that clusters identified in one embedding are also captured in the other model. We provide numerical results demonstrating the SPEC's application to compare and align embeddings on large-scale datasets such as ImageNet and MS-COCO. The project page is available at [https://mjalali.github.io/SPEC/](https://mjalali.github.io/SPEC/).
Mohammad Jalali, Bahar Dibaei Nia, Farzan Farnia
ICML2
2024 Scanning Trojaned Models Using Out-of-Distribution Samples
abstract
Scanning for trojan (backdoor) in deep neural networks is crucial due to their significant real-world applications. There has been an increasing focus on developing effective general trojan scanning methods across various trojan attacks. Despite advancements, there remains a shortage of methods that perform effectively without preconceived assumptions about the backdoor attack method. Additionally, we have observed that current methods struggle to identify classifiers trojaned using adversarial training. Motivated by these challenges, our study introduces a novel scanning method named TRODO (TROjan scanning by Detection of adversarial shifts in Out-of-distribution samples). TRODO leverages the concept of "blind spots"—regions where trojaned classifiers erroneously identify out-of-distribution (OOD) samples as in-distribution (ID). We scan for these blind spots by adversarially shifting OOD samples towards in-distribution. The increased likelihood of perturbed OOD samples being classified as ID serves as a signature for trojan detection. TRODO is both trojan and label mapping agnostic, effective even against adversarially trained trojaned classifiers. It is applicable even in scenarios where training data is absent, demonstrating high accuracy and adaptability across various scenarios and datasets, highlighting its potential as a robust trojan scanning strategy.
Hossein Mirzaei, Ali Ansari 0001, Bahar Dibaei Nia, Mojtaba Nafez, Moein Madadi, Sepehr Rezaee, Zeinab Taghavi 0001, Arad Maleki, Kian Shamsaie, Mahdi Hajialilue, Jafar Habibi, Mohammad Sabokrou, Mohammad H. Rohban
NeurIPS3