Demo Data from VLDB 2026 / reviewers in the wild / expert
Tue Le
dblp:245/4880
· DBLP profile ↗
8ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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 |
Efficient and distributed learning · 45% Language models and text generation · 40% Deep learning architectures and training · 8% | |
| Network and information security
1 paper |
Systems and software security · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
1.3 | 2 | 2026 | MCW-KD: Multi-Cost Wasserstein Knowledge Distillation for Large Language Models · AAAI 2026 Token-Level Self-Play with Importance-Aware Guidance for Large Language Models · NeurIPS 2025 |
Machine learning › Efficient and distributed learning
model compression |
1.0 | 1 | 2026 | MCW-KD: Multi-Cost Wasserstein Knowledge Distillation for Large Language Models · AAAI 2026 |
Natural language and speech › Language models and text generation
preference optimization |
0.9 | 1 | 2025 | Token-Level Self-Play with Importance-Aware Guidance for Large Language Models · NeurIPS 2025 |
Natural language and speech › Language models and text generation › large language model fine-tuning
self-play fine-tuning |
0.9 | 1 | 2025 | Token-Level Self-Play with Importance-Aware Guidance for Large Language Models · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
autoencoder |
0.4 | 1 | 2019 | Maximal Divergence Sequential Autoencoder for Binary Software Vulnerability Detection · ICLR (Poster) 2019 |
Machine learning › Representation and self-supervised learning › representation learning
sequential autoencoder |
0.4 | 1 | 2019 | Maximal Divergence Sequential Autoencoder for Binary Software Vulnerability Detection · ICLR (Poster) 2019 |
Systems and software security › vulnerability discovery › software vulnerability detection
binary vulnerability detection |
0.4 | 1 | 2019 | Maximal Divergence Sequential Autoencoder for Binary Software Vulnerability Detection · ICLR (Poster) 2019 |
Systems and software security
vulnerability discovery |
0.4 | 1 | 2019 | Maximal Divergence Sequential Autoencoder for Binary Software Vulnerability Detection · ICLR (Poster) 2019 |
Natural language and speech › Language models and text generation
large language model |
0.3 | 1 | 2026 | MCW-KD: Multi-Cost Wasserstein Knowledge Distillation for Large Language Models · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
wasserstein distance · 1.0multi-cost knowledge distillation · 1.0token-level importance weighting · 0.9teacher model guidance · 0.9maximal divergence sequential autoencoder · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MCW-KD: Multi-Cost Wasserstein Knowledge Distillation for Large Language Models
Hoang Tran Vuong, Tue Le, Quyen Tran, Ngo Van Linh 0001, Trung Le 0001 |
AAAI | 2 |
| 2026 | A multi-objective surrogate framework for training neural topic models
Chi Pham Khanh, Tue Le, Ngo Van Linh 0001 |
Neurocomputing | 2 |
| 2025 | Sharpness-Aware Minimization for Topic Models with High-Quality Document RepresentationsabstractTung Nguyen, Tue Le, Hoang Tran Vuong, Quang Duc Nguyen, Duc Anh Nguyen, Linh Ngo Van, Sang Dinh, Thien Huu Nguyen. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025. Tue Le, Hoang Tran Vuong, Ngo Van Linh 0001, Sang Dinh, Thien Huu Nguyen |
NAACL (Long Papers) | 2 |
| 2025 | Token-Level Self-Play with Importance-Aware Guidance for Large Language ModelsabstractLeveraging the power of Large Language Models (LLMs) through preference optimization is crucial for aligning model outputs with human values. Direct Preference Optimization (DPO) has recently emerged as a simple yet effective method by directly optimizing on preference data without the need for explicit reward models. However, DPO typically relies on human-labeled preference data, which can limit its scalability. Self-Play Fine-Tuning (SPIN) addresses this by allowing models to generate their own rejected samples, reducing the dependence on human annotations. Nevertheless, SPIN uniformly applies learning signals across all tokens, ignoring the fine-grained quality variations within responses. As the model improves, rejected samples increasingly contain high-quality tokens, making the uniform treatment of tokens suboptimal. In this paper, we propose SWIFT (Self-Play Weighted Fine-Tuning), a fine-grained self-refinement method that assigns token-level importance weights estimated from a stronger teacher model. Beyond alignment, we also demonstrate that SWIFT serves as an effective knowledge distillation strategy by using the teacher not for logits matching, but for reward-guided token weighting. Extensive experiments on diverse benchmarks and settings demonstrate that SWIFT consistently surpasses both existing alignment approaches and conventional knowledge distillation methods. Tue Le, Hoang Tran Vuong, Quyen Tran, Ngo Van Linh 0001, Mehrtash Harandi, Trung Le 0001 |
NeurIPS | 1 |
| 2020 | Code Pointer Network for Binary Function Scope IdentificationabstractFunction identification is a preliminary step in binary analysis for many extensive applications from malware detection, common vulnerability detection and binary instrumentation to name a few. In this paper, we propose the Code Pointer Network that leverages the underlying idea of a pointer network to efficiently and effectively tackle function scope identification - the hardest and most crucial task in function identification. We establish extensive experiments to compare our proposed method with the deep learning based baseline. Experimental results demonstrate that our proposed method significantly outperforms the state-of-the-art baseline in terms of both predictive performance and running time. Van Nguyen 0002, Trung Le 0001, Tue Le, Olivier Y. de Vel, Paul Montague, Dinh Q. Phung |
IJCNN | 3 |
| 2020 | Code Action Network for Binary Function Scope Identification
Van Nguyen 0002, Trung Le 0001, Tue Le, Olivier Y. de Vel, Paul Montague, John C. Grundy, Dinh Q. Phung |
PAKDD (1) | 3 |
| 2019 | Maximal Divergence Sequential Autoencoder for Binary Software Vulnerability Detection
Tue Le, Tuan Nguyen 0004, Trung Le 0001, Dinh Q. Phung, Paul Montague, Olivier Y. de Vel, Lizhen Qu |
ICLR (Poster) | 1 |
| 2019 | Deep Domain Adaptation for Vulnerable Code Function IdentificationabstractDue to the ubiquity of computer software, software vulnerability detection (SVD) has become crucial in the software industry and in the field of computer security. Two significant issues in SVD arise when using machine learning, namely: i) how to learn automatic features that can help improve the predictive performance of vulnerability detection and ii) how to overcome the scarcity of labeled vulnerabilities in projects that require the laborious labeling of code by software security experts. In this paper, we address these two crucial concerns by proposing a novel architecture which leverages deep domain adaptation with automatic feature learning for software vulnerability identification. Based on this architecture, we keep the principles and reapply the state-of-the-art deep domain adaptation methods to indicate that deep domain adaptation for SVD is plausible and promising. Moreover, we further propose a novel method named Semi-supervised Code Domain Adaptation Network (SCDAN) that can efficiently utilize and exploit information carried in unlabeled target data by considering them as the unlabeled portion in a semi-supervised learning context. The proposed SCDAN method enforces the clustering assumption, which is a key principle in semi-supervised learning. The experimental results using six real-world software project datasets show that our SCDAN method and the baselines using our architecture have better predictive performance by a wide margin compared with the Deep Code Network (VulDeePecker) method without domain adaptation. Also, the proposed SCDAN significantly outperforms the DIRT-T which to the best of our knowledge is currently the-state-of-the-art method in deep domain adaptation and other baselines. Van Nguyen 0002, Trung Le 0001, Tue Le, Olivier Y. de Vel, Paul Montague, Lizhen Qu, Dinh Q. Phung |
IJCNN | 3 |