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

Van-Anh Nguyen

dblp:234/2231 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
5since 2021 · last 2025
—ORCID · unresolved

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

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

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
4 papers
Trustworthy machine learning · 29% Optimization for machine learning · 23% Probabilistic and Bayesian machine learning · 20%
Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 77% Operating systems · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
gradient flow
0.912025
Geometry-Aware Collaborative Multi-Solutions Optimizer for Model Fine-Tuning with Parameter Efficiency · NeurIPS 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.912025
Geometry-Aware Collaborative Multi-Solutions Optimizer for Model Fine-Tuning with Parameter Efficiency · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.712023
Flat Seeking Bayesian Neural Networks · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models › bayesian deep learning
bayesian neural networks
0.712023
Flat Seeking Bayesian Neural Networks · NeurIPS 2023
Machine learning › Trustworthy machine learning › robustness
distributional robustness
0.712023
Optimal Transport Model Distributional Robustness · NeurIPS 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
Optimal Transport Model Distributional Robustness · NeurIPS 2023
Machine learning › Optimization for machine learning › gradient-based optimization
sharpness-aware minimization
0.712023
Optimal Transport Model Distributional Robustness · NeurIPS 2023
Machine learning › Trustworthy machine learning
uncertainty estimation
0.712023
Flat Seeking Bayesian Neural Networks · NeurIPS 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation
multi-source domain adaptation
0.512021
STEM: An approach to Multi-source Domain Adaptation with Guarantees · ICCV 2021
Debugging and program repair
automated program repair
0.412020
SPINFER: Inferring Semantic Patches for the Linux Kernel · USENIX ATC 2020
Machine learning › Transfer learning and domain adaptation
domain generalization
0.312025
Geometry-Aware Collaborative Multi-Solutions Optimizer for Model Fine-Tuning with Parameter Efficiency · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.312025
Geometry-Aware Collaborative Multi-Solutions Optimizer for Model Fine-Tuning with Parameter Efficiency · NeurIPS 2025
Operating systems › kernel
linux kernel
0.112020
SPINFER: Inferring Semantic Patches for the Linux Kernel · USENIX ATC 2020

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

sharpness-aware minimization · 1.3gradient flow theory · 0.9bayesian methods · 0.9wasserstein ball · 0.7variational inference · 0.7optimal transport · 0.7knowledge distillation · 0.5feature alignment · 0.5domain expert ensemble · 0.5
YearPublicationVenuePosition
2025 Geometry-Aware Collaborative Multi-Solutions Optimizer for Model Fine-Tuning with Parameter Efficiency
abstract
We propose a framework grounded in gradient flow theory and informed by geometric structure that provides multiple diverse solutions for a given task, ensuring collaborative results that enhance performance and adaptability across different tasks. This framework enables flexibility, allowing for efficient task-specific fine-tuning while preserving the knowledge of the pre-trained foundation models. Extensive experiments across transfer learning, few-shot learning, and domain generalization show that our proposed approach consistently outperforms existing Bayesian methods, delivering strong performance with affordable computational overhead and offering a practical solution by updating only a small subset of parameters.
Van-Anh Nguyen, Trung Le 0001, Mehrtash Harandi, Ehsan Abbasnejad, Thanh-Toan Do, Dinh Q. Phung
NeurIPS1
2024 Frequency Attention for Knowledge Distillation
abstract
Knowledge distillation is an attractive approach for learning compact deep neural networks, which learns a lightweight student model by distilling knowledge from a complex teacher model. Attention-based knowledge distillation is a specific form of intermediate feature-based knowledge distillation that uses attention mechanisms to encourage the student to better mimic the teacher. However, most of the previous attention-based distillation approaches perform attention in the spatial domain, which primarily affects local regions in the input image. This may not be sufficient when we need to capture the broader context or global information necessary for effective knowledge transfer. In frequency domain, since each frequency is determined from all pixels of the image in spatial domain, it can contain global information about the image. Inspired by the benefits of the frequency domain, we propose a novel module that functions as an attention mechanism in the frequency domain. The module consists of a learnable global filter that can adjust the frequencies of student’s features under the guidance of the teacher’s features, which encourages the student’s features to have patterns similar to the teacher’s features. We then propose an enhanced knowledge review-based distillation model by leveraging the proposed frequency attention module. The extensive experiments with various teacher and student architectures on image classification and object detection benchmark datasets show that the proposed approach outperforms other knowledge distillation methods.
Cuong Pham 0007, Van-Anh Nguyen, Trung Le 0001, Dinh Q. Phung, Gustavo Carneiro 0001, Thanh-Toan Do
WACV2
2023 Optimal Transport Model Distributional Robustness
abstract
Distributional robustness is a promising framework for training deep learning models that are less vulnerable to adversarial examples and data distribution shifts. Previous works have mainly focused on exploiting distributional robustness in the data space. In this work, we explore an optimal transport-based distributional robustness framework in model spaces. Specifically, we examine a model distribution within a Wasserstein ball centered on a given model distribution that maximizes the loss. We have developed theories that enable us to learn the optimal robust center model distribution. Interestingly, our developed theories allow us to flexibly incorporate the concept of sharpness awareness into training, whether it's a single model, ensemble models, or Bayesian Neural Networks, by considering specific forms of the center model distribution. These forms include a Dirac delta distribution over a single model, a uniform distribution over several models, and a general Bayesian Neural Network. Furthermore, we demonstrate that Sharpness-Aware Minimization (SAM) is a specific case of our framework when using a Dirac delta distribution over a single model, while our framework can be seen as a probabilistic extension of SAM. To validate the effectiveness of our framework in the aforementioned settings, we conducted extensive experiments, and the results reveal remarkable improvements compared to the baselines.
Van-Anh Nguyen, Trung Le 0001, Anh Tuan Bui, Thanh-Toan Do, Dinh Q. Phung
NeurIPS1
2023 Flat Seeking Bayesian Neural Networks
abstract
Bayesian Neural Networks (BNNs) provide a probabilistic interpretation for deep learning models by imposing a prior distribution over model parameters and inferring a posterior distribution based on observed data. The model sampled from the posterior distribution can be used for providing ensemble predictions and quantifying prediction uncertainty. It is well-known that deep learning models with lower sharpness have better generalization ability. However, existing posterior inferences are not aware of sharpness/flatness in terms of formulation, possibly leading to high sharpness for the models sampled from them. In this paper, we develop theories, the Bayesian setting, and the variational inference approach for the sharpness-aware posterior. Specifically, the models sampled from our sharpness-aware posterior, and the optimal approximate posterior estimating this sharpness-aware posterior, have better flatness, hence possibly possessing higher generalization ability. We conduct experiments by leveraging the sharpness-aware posterior with state-of-the-art Bayesian Neural Networks, showing that the flat-seeking counterparts outperform their baselines in all metrics of interest.
Van-Anh Nguyen, Tung Long Vuong, Hoang Phan, Thanh-Toan Do, Dinh Q. Phung, Trung Le 0001
NeurIPS1
2021 STEM: An approach to Multi-source Domain Adaptation with Guarantees
abstract
Multi-source Domain Adaptation (MSDA) is more practical but challenging than the conventional unsupervised domain adaptation due to the involvement of diverse multiple data sources. Two fundamental challenges of MSDA are: (i) how to deal with the diversity in the multiple source domains and (ii) how to cope with the data shift between the target domain and the source domains. In this paper, to address the first challenge, we propose a theoretical-guaranteed approach to combine domain experts locally trained on its own source domain to achieve a combined multi-source teacher that globally predicts well on the mixture of source domains. To address the second challenge, we propose to bridge the gap between the target domain and the mixture of source domains in the latent space via a generator or feature extractor. Together with bridging the gap in the latent space, we train a student to mimic the predictions of the teacher expert on both source and target examples. In addition, our approach is guaranteed with rigorous theory offered insightful justifications of how each component influences the transferring performance. Extensive experiments conducted on three benchmark datasets show that our proposed method achieves state-of-the-art performances to the best of our knowledge.
Van-Anh Nguyen, Tuan Nguyen 0004, Trung Le 0001, Quan Hung Tran, Dinh Q. Phung
ICCV1
2020 SPINFER: Inferring Semantic Patches for the Linux Kernel
Lucas Serrano, Van-Anh Nguyen, Ferdian Thung, Lingxiao Jiang, David Lo 0001, Julia Lawall, Gilles Muller
USENIX ATC2