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

Thanh-Thien Le

dblp:371/5938 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 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
4 papers
Information extraction and text analysis · 62% Learning paradigms · 23% Vision and language · 8%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › relation extraction
continual relation extraction
2.532025
Few-Shot, No Problem: Descriptive Continual Relation Extraction · AAAI 2025
Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective · AAAI 2025
Continual Relation Extraction via Sequential Multi-Task Learning · AAAI 2024
Natural language and speech › Information extraction and text analysis
relation extraction
2.532025
Few-Shot, No Problem: Descriptive Continual Relation Extraction · AAAI 2025
Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective · AAAI 2025
Continual Relation Extraction via Sequential Multi-Task Learning · AAAI 2024
Machine learning › Learning paradigms
continual learning
1.522024
Lifelong Event Detection via Optimal Transport · EMNLP 2024
Continual Relation Extraction via Sequential Multi-Task Learning · AAAI 2024
Natural language and speech › Information extraction and text analysis › relation extraction › continual relation extraction
few-shot continual relation extraction
0.912025
Few-Shot, No Problem: Descriptive Continual Relation Extraction · AAAI 2025
Computer vision › Vision and language › vision-language model
prompt learning
0.912025
Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective · AAAI 2025
Machine learning › Learning paradigms › continual learning › catastrophic forgetting
catastrophic forgetting mitigation
0.812024
Lifelong Event Detection via Optimal Transport · EMNLP 2024
Natural language and speech › Information extraction and text analysis › event extraction
event detection
0.812024
Lifelong Event Detection via Optimal Transport · EMNLP 2024
Natural language and speech › Language models and text generation
large language model
0.312025
Few-Shot, No Problem: Descriptive Continual Relation Extraction · AAAI 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.312025
Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective · AAAI 2025
Natural language and speech › Language models and text generation › prompt tuning
prefix tuning
0.312025
Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective · AAAI 2025
Machine learning › Learning paradigms › continual learning
rehearsal-based continual learning
0.212024
Continual Relation Extraction via Sequential Multi-Task Learning · AAAI 2024

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

retrieval-based prediction · 0.9reciprocal rank fusion · 0.9prefix-tuning · 0.9mixture of experts · 0.9large language model · 0.9generative model · 0.9bi-encoder retrieval · 0.9rehearsal · 0.8multi-task learning · 0.8gradient balancing · 0.8
YearPublicationVenuePosition
2025 Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective
abstract
To address catastrophic forgetting in Continual Relation Extraction (CRE), many current approaches rely on memory buffers to rehearse previously learned knowledge while acquiring new tasks. Recently, prompt-based methods have emerged as potent alternatives to rehearsal-based strategies, demonstrating strong empirical performance. However, upon analyzing existing prompt-based approaches for CRE, we identified several critical limitations, such as inaccurate prompt selection, inadequate mechanisms for mitigating forgetting in shared parameters, and suboptimal handling of cross-task and within-task variances. To overcome these challenges, we draw inspiration from the relationship between prefix tuning and mixture of experts, proposing a novel approach that employs a prompt pool for each task, capturing variations within each task while enhancing cross-task variances. Furthermore, we incorporate a generative model to consolidate prior knowledge within shared parameters, eliminating the need for explicit data storage. Extensive experiments validate the efficacy of our approach, demonstrating superior performance over state-of-the-art prompt-based and rehearsal-free methods in continual relation extraction.
Minh Le, Tien Ngoc Luu, An Nguyen The, Thanh-Thien Le, Tung Thanh Nguyen, Ngo Van Linh 0001, Thien Huu Nguyen
AAAI4
2025 Few-Shot, No Problem: Descriptive Continual Relation Extraction
abstract
Few-shot Continual Relation Extraction is a crucial challenge for enabling AI systems to identify and adapt to evolving relationships in dynamic real-world domains. Traditional memory-based approaches often overfit to limited samples, failing to reinforce old knowledge, with the scarcity of data in few-shot scenarios further exacerbating these issues by hindering effective data augmentation in the latent space. In this paper, we propose a novel retrieval-based solution, starting with a large language model to generate descriptions for each relation. From these descriptions, we introduce a bi-encoder retrieval training paradigm to enrich both sample and class representation learning. Leveraging these enhanced representations, we design a retrieval-based prediction method where each sample "retrieves" the best fitting relation via a reciprocal rank fusion score that integrates both relation description vectors and class prototypes. Extensive experiments on multiple datasets demonstrate that our method significantly advances the state-of-the-art by maintaining robust performance across sequential tasks, effectively addressing catastrophic forgetting.
Anh Duc Le, Quyen Tran, Thanh-Thien Le, Ngo Van Linh 0001, Thien Huu Nguyen
AAAI4
2024 Continual Relation Extraction via Sequential Multi-Task Learning
abstract
To build continual relation extraction (CRE) models, those can adapt to an ever-growing ontology of relations, is a cornerstone information extraction task that serves in various dynamic real-world domains. To mitigate catastrophic forgetting in CRE, existing state-of-the-art approaches have effectively utilized rehearsal techniques from continual learning and achieved remarkable success. However, managing multiple objectives associated with memory-based rehearsal remains underexplored, often relying on simple summation and overlooking complex trade-offs. In this paper, we propose Continual Relation Extraction via Sequential Multi-task Learning (CREST), a novel CRE approach built upon a tailored Multi-task Learning framework for continual learning. CREST takes into consideration the disparity in the magnitudes of gradient signals of different objectives, thereby effectively handling the inherent difference between multi-task learning and continual learning. Through extensive experiments on multiple datasets, CREST demonstrates significant improvements in CRE performance as well as superiority over other state-of-the-art Multi-task Learning frameworks, offering a promising solution to the challenges of continual learning in this domain.
Thanh-Thien Le, Tung Thanh Nguyen, Ngo Van Linh 0001, Thien Huu Nguyen
AAAI1
2024 Lifelong Event Detection via Optimal Transport
abstract
Continual Event Detection (CED) poses a formidable challenge due to the catastrophic forgetting phenomenon, where learning new tasks (with new coming event types) hampers performance on previous ones.In this paper, we introduce a novel approach, Lifelong Event Detection via Optimal Transport (LEDOT), that leverages optimal transport principles to align the optimization of our classification module with the intrinsic nature of each class, as defined by their pre-trained language modeling.Our method integrates replay sets, prototype latent representations, and an innovative Optimal Transport component.Extensive experiments on MAVEN and ACE datasets demonstrate LEDOT's superior performance, consistently outperforming state-of-the-art baselines.The results underscore LEDOT as a pioneering solution in continual event detection, offering a more effective and nuanced approach to addressing catastrophic forgetting in evolving environments.
Viet Dao, Van-Cuong Pham, Quyen Tran, Thanh-Thien Le, Ngo Van Linh 0001, Thien Huu Nguyen
EMNLP4
2024 SharpSeq: Empowering Continual Event Detection through Sharpness-Aware Sequential-task Learning
abstract
Thanh-Thien Le, Viet Dao, Linh Nguyen, Thi-Nhung Nguyen, Linh Ngo, Thien Nguyen. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
Thanh-Thien Le, Viet Dao, Thi-Nhung Nguyen, Ngo Van Linh 0001, Thien Huu Nguyen
NAACL-HLT1