← Search

Dung D. Le

11 accepted papers

2026

CLIP-FMoE: Scalable CLIP via Fused Mixture-of-Experts with Enforced Specialization

ICLR 2026poster

Mixture-of-Experts (MoE) architectures have emerged as a promising approach for scaling deep learning models while maintaining computational efficiency. However, existing MoE adaptations for Contrastive Language-Image Pre-training (CLIP) models suffer from significant computational overhead during s…

Cited by 0SourceScholar
2026

Computation and Communication Efficient Federated Unlearning via On-server Gradient Conflict Mitigation and Expression

CVPR 2026

Federated Unlearning (FUL) aims to remove specific participants' data contributions from a trained Federated Learning model, thereby ensuring data privacy and compliance with regulatory requirements. Despite its potential, progress in FUL has been limited due to several challenges, including the cro

Cited by 0SourcecodeScholar
2025

Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks

AAAI 2025technical

Expensive multi-objective optimization problems (EMOPs) are common in real-world scenarios where evaluating objective functions is costly and involves extensive computations or physical experiments. Current Pareto set learning methods for such problems often rely on surrogate models like Gaussian pr…

2025

Provably Improving Generalization of Few-shot models with Synthetic Data

ICML 2025poster

Few-shot image classification remains challenging due to the scarcity of labeled training examples. Augmenting them with synthetic data has emerged as a promising way to alleviate this issue, but models trained on synthetic samples often face performance degradation due to the inherent gap between r…

Cited by 4SourcePDFScholar
2025

VisualCoder: Guiding Large Language Models in Code Execution with Fine-grained Multimodal Chain-of-Thought Reasoning

NAACL 2025findings

Predicting program behavior and reasoning about code execution remain significant challenges in software engineering, particularly for large language models (LLMs) designed for code analysis. While these models excel at understanding static syntax, they often struggle with dynamic reasoning tasks. W…

Cited by 1SourcePDFScholar
2024

Experience as Source for Anticipation and Planning: Experiential Policy Learning for Target-driven Recommendation Dialogues

EMNLP 2024finding

Target-driven recommendation dialogues present unique challenges in dialogue management due to the necessity of anticipating user interactions for successful conversations. Current methods face significant limitations: (I) inadequate capabilities for conversation anticipation, (II) computational ine…

2024

Improving Vietnamese-English Medical Machine Translation

COLING 2024main

Machine translation for Vietnamese-English in the medical domain is still an under-explored research area. In this paper, we introduce MedEV—a high-quality Vietnamese-English parallel dataset constructed specifically for the medical domain, comprising approximately 360K sentence pairs. We conduct ex…

Cited by 0SourcePDFScholar
2023

A Probabilistic Framework for Pruning Transformers Via a Finite Admixture of Keys

ICASSP 2023accepted

Pairwise dot product-based self-attention is key to the success of transformers which achieve state-of-the-art performance across a variety of applications in language and vision, but are costly to compute. It has been shown that most attention scores and keys in transformers are redundant and can b…

Cited by 0SourceScholar
2023

Improving Pareto Front Learning via Multi-Sample Hypernetworks

AAAI 2023technical

Pareto Front Learning (PFL) was recently introduced as an effective approach to obtain a mapping function from a given trade-off vector to a solution on the Pareto front, which solves the multi-objective optimization (MOO) problem. Due to the inherent trade-off between conflicting objectives, PFL of…

2023

Towards Data-Agnostic Pruning At Initialization: What Makes a Good Sparse Mask?

NeurIPS 2023poster

Pruning at initialization (PaI) aims to remove weights of neural networks before training in pursuit of training efficiency besides the inference. While off-the-shelf PaI methods manage to find trainable subnetworks that outperform random pruning, their performance in terms of both accuracy and com…