EDBT 2026 Demo / reviewers in the wild / expert
Khanh Doan
dblp:364/2526
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 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
3 papers |
Generative modeling · 47% Trustworthy machine learning · 13% Learning paradigms · 13% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
1.6 | 2 | 2025 | Improved Training Technique for Latent Consistency Models · ICLR 2025 Erasing Undesirable Concepts in Diffusion Models with Adversarial Preservation · NeurIPS 2024 |
Machine learning › Learning paradigms
continual learning |
0.9 | 1 | 2025 | Boosting Multiple Views for pretrained-based Continual Learning · ICLR 2025 |
Machine learning › Generative modeling › diffusion model › consistency model
latent consistency model |
0.9 | 1 | 2025 | Improved Training Technique for Latent Consistency Models · ICLR 2025 |
Machine learning › Trustworthy machine learning › robustness › outlier robustness
outlier-robust estimation |
0.9 | 1 | 2025 | Improved Training Technique for Latent Consistency Models · ICLR 2025 |
Machine learning › Learning theory
random projection |
0.9 | 1 | 2025 | Boosting Multiple Views for pretrained-based Continual Learning · ICLR 2025 |
Machine learning › Generative modeling
concept erasure |
0.8 | 1 | 2024 | Erasing Undesirable Concepts in Diffusion Models with Adversarial Preservation · NeurIPS 2024 |
Natural language and speech › Language models and text generation
knowledge editing |
0.8 | 1 | 2024 | Erasing Undesirable Concepts in Diffusion Models with Adversarial Preservation · NeurIPS 2024 |
Machine learning › Kernel, tree and ensemble methods
ensemble learning |
0.3 | 1 | 2025 | Boosting Multiple Views for pretrained-based Continual Learning · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
random projection · 0.9prompt tuning · 0.9optimal transport · 0.9diffusion loss · 0.9cauchy loss · 0.9adaptive scaling · 0.9adaboost · 0.9adversarial preservation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Improved Training Technique for Latent Consistency ModelsabstractConsistency models are a new family of generative models capable of producing high-quality samples in either a single step or multiple steps. Recently, consistency models have demonstrated impressive performance, achieving results on par with diffusion models in the pixel space. However, the success of scaling consistency training to large-scale datasets, particularly for text-to-image and video generation tasks, is determined by performance in the latent space. In this work, we analyze the statistical differences between pixel and latent spaces, discovering that latent data often contains highly impulsive outliers, which significantly degrade the performance of iCT in the latent space. To address this, we replace Pseudo-Huber losses with Cauchy losses, effectively mitigating the impact of outliers. Additionally, we introduce a diffusion loss at early timesteps and employ optimal transport (OT) coupling to further enhance performance. Lastly, we introduce the adaptive scaling-$c$ scheduler to manage the robust training process and adopt Non-scaling LayerNorm in the architecture to better capture the statistics of the features and reduce outlier impact. With these strategies, we successfully train latent consistency models capable of high-quality sampling with one or two steps, significantly narrowing the performance gap between latent consistency and diffusion models. The implementation is released here: \url{https://github.com/quandao10/sLCT/} Quan Dao, Khanh Doan, Di Liu 0003, Trung Le 0001, Dimitris N. Metaxas |
ICLR | 2 |
| 2025 | Boosting Multiple Views for pretrained-based Continual LearningabstractRecent research has shown that Random Projection (RP) can effectively improve the performance of pre-trained models in Continual learning (CL). The authors hypothesized that using RP to map features onto a higher-dimensional space can make them more linearly separable. In this work, we theoretically analyze the role of RP and present its benefits for improving the model’s generalization ability
in each task and facilitating CL overall. Additionally, we take this result to the next level by proposing a Multi-View Random Projection scheme for a stronger ensemble classifier. In particular, we train a set of linear experts, among which diversity is encouraged based on the principle of AdaBoost, which was initially very challenging to apply to CL. Moreover, we employ a task-based adaptive backbone
with distinct prompts dedicated to each task for better representation learning. To properly select these task-specific components and mitigate potential feature shifts caused by misprediction, we introduce a simple yet effective technique called the self-improvement process. Experimentally, our method consistently outperforms state-of-the-art baselines across a wide range of datasets. Quyen Tran, Tung Lam Tran, Khanh Doan, Toan Tran 0003, Dinh Q. Phung, Khoat Than, Trung Le 0001 |
ICLR | 3 |
| 2024 | Erasing Undesirable Concepts in Diffusion Models with Adversarial PreservationabstractDiffusion models excel at generating visually striking content from text but can inadvertently produce undesirable or harmful content when trained on unfiltered internet data. A practical solution is to selectively removing target concepts from the model, but this may impact the remaining concepts. Prior approaches have tried to balance this by introducing a loss term to preserve neutral content or a regularization term to minimize changes in the model parameters, yet resolving this trade-off remains challenging. In this work, we propose to identify and preserving concepts most affected by parameter changes, termed as *adversarial concepts*. This approach ensures stable erasure with minimal impact on the other concepts. We demonstrate the effectiveness of our method using the Stable Diffusion model, showing that it outperforms state-of-the-art erasure methods in eliminating unwanted content while maintaining the integrity of other unrelated elements. Our code is available at \url{https://github.com/tuananhbui89/Erasing-Adversarial-Preservation}. Anh Bui, Tung Long Vuong, Khanh Doan, Trung Le 0001, Paul Montague, Tamas Abraham, Dinh Q. Phung |
NeurIPS | 3 |