← Search

Minh Le

8 accepted papers

2026

Graph-Theoretic Consistency for Robust and Topology-Aware Semi-Supervised Histopathology Segmentation (Student Abstract)

AAAI 2026technical

Semi-supervised semantic segmentation (SSSS) is vital in computational pathology, where dense annotations are costly and limited. Existing methods often rely on pixel-level consistency, which propagates noisy pseudo-labels and produces fragmented or topologically invalid masks. We propose Topology G

Cited by 0SourcePDFScholar
2026

One-Prompt Strikes Back: Sparse Mixture of Experts for Prompt-based Continual Learning

ICLR 2026poster

Prompt-based methods have recently gained prominence in Continual Learning (CL) due to their strong performance and memory efficiency. A prevalent strategy in this paradigm assigns a dedicated subset of prompts to each task, which, while effective, incurs substantial computational overhead and cause…

Cited by 0SourcecodeScholar
2026

Revisit Visual Prompt Tuning: The Expressiveness of Prompt Experts

ICLR 2026poster

Visual Prompt Tuning (VPT) has proven effective for parameter-efficient adaptation of pre-trained vision models to downstream tasks by inserting task-specific learnable prompt tokens. Despite its empirical success, a comprehensive theoretical understanding of VPT remains an active area of research.…

Cited by 0SourcecodeScholar
2025

Adaptive Prompting for Continual Relation Extraction: A Within-Task Variance Perspective

AAAI 2025technical

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, demonstratin…

Cited by 1SourcePDFScholar
2025

On Zero-Initialized Attention: Optimal Prompt and Gating Factor Estimation

ICML 2025poster

LLaMA-Adapter has recently emerged as an efficient fine-tuning technique for LLaMA models, leveraging zero-initialized attention to stabilize training and enhance performance. However, despite its empirical success, the theoretical foundations of zero-initialized attention remain largely unexplored.…

Cited by 1SourcePDFScholar
2025

RepLoRA: Reparameterizing Low-rank Adaptation via the Perspective of Mixture of Experts

ICML 2025poster

Low-rank Adaptation (LoRA) has emerged as a powerful and efficient method for fine-tuning large-scale foundation models. Despite its popularity, the theoretical understanding of LoRA has remained underexplored. In this paper, we present a theoretical analysis of LoRA by examining its connection to t…

Cited by 1SourcePDFScholar
2025

Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Prompts

ICLR 2025poster

Prompt-based techniques, such as prompt-tuning and prefix-tuning, have gained prominence for their efficiency in fine-tuning large pre-trained models. Despite their widespread adoption, the theoretical foundations of these methods remain limited. For instance, in prefix-tuning, we observe that a key…

Cited by 4SourcePDFScholar
2024

Mixture of Experts Meets Prompt-Based Continual Learning

NeurIPS 2024poster

Exploiting the power of pre-trained models, prompt-based approaches stand out compared to other continual learning solutions in effectively preventing catastrophic forgetting, even with very few learnable parameters and without the need for a memory buffer. While existing prompt-based continual lear…