← Search

Ming-Syan Chen

13 accepted papers

2026

DeFuzzRAG: Handling Fuzzy Time Expressions for Temporal Robustness in Retrieval-Augmented Generation

AAAI 2026technical

Large Language Models (LLMs) have achieved remarkable success across reasoning and knowledge-intensive tasks, yet their static pretraining leaves them unable to handle rapidly evolving or domain-specific knowledge. Retrieval-Augmented Generation (RAG) addresses this by grounding LLM outputs in dynam

Cited by 0SourcePDFScholar
2026

LoGIC: Multi-LoRA Guided Importance Consensus for Multi-Task Pruning in Vision Transformers

AAAI 2026technical

Deploying Vision Transformers (ViTs) in real-world multi-task learning remains challenging due to their massive computational costs and the difficulty of pruning shared backbones without harming task performance. Single-task pruning often causes destructive interference by discarding weights critica

Cited by 0SourcePDFScholar
2025

Dual Alignment Framework for Few-shot Learning with Inter-Set and Intra-Set Shifts

NeurIPS 2025poster

Few-shot learning (FSL) aims to classify unseen examples (query set) into labeled data (support set) through low-dimensional embeddings. However, the diversity and unpredictability of environments and capture devices make FSL more challenging in real-world applications. In this paper, we propose Dua…

Cited by 0SourcecodeScholar
2024

FedGCR: Achieving Performance and Fairness for Federated Learning with Distinct Client Types via Group Customization and Reweighting

AAAI 2024technical

To achieve better performance and greater fairness in Federated Learning (FL), much of the existing research has centered on individual clients, using domain adaptation techniques and redesigned aggregation schemes to counteract client data heterogeneity. However, an overlooked scenario exists where…

2023

Incremental Reinforcement Learning with Dual-Adaptive ε-Greedy Exploration

AAAI 2023technical

Reinforcement learning (RL) has achieved impressive performance in various domains. However, most RL frameworks oversimplify the problem by assuming a fixed-yet-known environment and often have difficulty being generalized to real-world scenarios. In this paper, we address a new challenge with a mor…

2023

Random Walk Conformer: Learning Graph Representation from Long and Short Range

AAAI 2023technical

While graph neural networks (GNNs) have achieved notable success in various graph mining tasks, conventional GNNs only model the pairwise correlation in 1-hop neighbors without considering the long-term relations and the high-order patterns, thus limiting their performances. Recently, several works…

2023

SPACE: Single-round Participant Amalgamation for Contribution Evaluation in Federated Learning

NeurIPS 2023poster

The evaluation of participant contribution in federated learning (FL) has recently gained significant attention due to its applicability in various domains, such as incentive mechanisms, robustness enhancement, and client selection. Previous approaches have predominantly relied on the widely adopted…

2022

ClimbQ: Class Imbalanced Quantization Enabling Robustness on Efficient Inferences

NeurIPS 2022accept

Quantization compresses models to low bits for efficient inferences which has received increasing attentions. However, existing approaches focused on balanced datasets, while imbalanced data is pervasive in the real world. Therefore, in this study, we investigate the realistic problem, quantization…

Cited by 3SourcePDFScholar
2021

Attack As the Best Defense: Nullifying Image-to-Image Translation GANs via Limit-Aware Adversarial Attack

ICCV 2021poster

Due to the great success of image-to-image (Img2Img) translation GANs, many applications with ethics issues arise, e.g., DeepFake and DeepNude, presenting a challenging problem to prevent the misuse of these techniques. In this work, we tackle the problem by a new adversarial attack scheme, namely t…

Cited by 28PDFcodeScholar
2021

Hierarchical Negative Binomial Factorization for Recommender Systems on Implicit Feedback

AAAI 2021technical

When exposed to an item in a recommender system, a user may consume it (known as success exposure) or neglect it (known as failure exposure). The recently proposed methods that consider both success and failure exposure merely regard failure exposure as a constant prior, thus being capable of neithe…