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

Huy Quang Mai

dblp:329/6787 · 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
Trustworthy machine learning · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › adversarial machine learning › adversarial defense
adversarial example detection
0.912025
Topological Signatures of Adversaries in Multimodal Alignments · ICML 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
Topological Signatures of Adversaries in Multimodal Alignments · ICML 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
EMaP: Explainable AI with Manifold-based Perturbations · J. Mach. Learn. Res. 2025
Machine learning › Trustworthy machine learning › interpretability › post-hoc explanation
perturbation-based explanation
0.912025
EMaP: Explainable AI with Manifold-based Perturbations · J. Mach. Learn. Res. 2025
Computational geometry › topological data analysis
persistent homology
0.312025
EMaP: Explainable AI with Manifold-based Perturbations · J. Mach. Learn. Res. 2025
Computational geometry
topological data analysis
0.312025
EMaP: Explainable AI with Manifold-based Perturbations · J. Mach. Learn. Res. 2025

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

persistent homology · 2.6manifold perturbation · 1.7gromov-hausdorff distance · 1.7topological-contrastive loss · 0.9maximum mean discrepancy · 0.9
YearPublicationVenuePosition
2025 Topological Signatures of Adversaries in Multimodal Alignments
abstract
Multimodal Machine Learning systems, particularly those aligning text and image data like CLIP/BLIP models, have become increasingly prevalent, yet remain susceptible to adversarial attacks. While substantial research has addressed adversarial robustness in unimodal contexts, defense strategies for multimodal systems are underexplored. This work investigates the topological signatures that arise between image and text embeddings and shows how adversarial attacks disrupt their alignment, introducing distinctive signatures. We specifically leverage persistent homology and introduce two novel Topological-Contrastive losses based on Total Persistence and Multi-scale kernel methods to analyze the topological signatures introduced by adversarial perturbations. We observe a pattern of monotonic changes in the proposed topological losses emerging in a wide range of attacks on image-text alignments, as more adversarial samples are introduced in the data. By designing an algorithm to back-propagate these signatures to input samples, we are able to integrate these signatures into Maximum Mean Discrepancy tests, creating a novel class of tests that leverage topological signatures for better adversarial detection.
Minh Nhat Vu, Geigh Zollicoffer, Huy Quang Mai, Ben Nebgen, Boian S. Alexandrov, Manish Bhattarai
ICML3
2025 EMaP: Explainable AI with Manifold-based Perturbations
abstract
In the last few years, many explanation methods based on the perturbations of input data have been introduced to shed light on the predictions generated by black-box models. The goal of this work is to introduce a novel perturbation scheme so that more faithful and robust explanations can be obtained. Our study focuses on the impact of perturbing directions on the data topology. We show that perturbing along the orthogonal directions of the input manifold better preserves the data topology, both in the worst-case analysis of the discrete Gromov-Hausdorff distance and in the average-case analysis via persistent homology. From those results, we introduce EMaP algorithm, realizing the orthogonal perturbation scheme. Our experiments show that EMaP not only improves the explainers' performance but also helps them overcome a recently developed attack against perturbation-based explanation methods.
Minh Nhat Vu, Huy Quang Mai, My T. Thai
J. Mach. Learn. Res.2