Kristen Moore
Author directory2026
Take Only What You Need: Rank Minimization as an Implicit Forgetting Regularizer in Continual Learning
Haodong Lu | Chongyang Zhao | Jason Xue | Lina Yao | Kristen Moore | Dong Gong
Findings of the Association for Computational Linguistics: EMNLP 2026
Haodong Lu | Chongyang Zhao | Jason Xue | Lina Yao | Kristen Moore | Dong Gong
Findings of the Association for Computational Linguistics: EMNLP 2026
The central tension in continual learning (CL) is the trade-off between plasticity (acquiring new knowledge) and stability (retaining prior knowledge). We study how a pre-trained backbone can be continually updated to absorb new knowledge while preserving existing capabilities, via capacity control: regulating the effective rank of each parameter update, a per-step quantity directly controllable inside a LoRA update. A controlled probe of LoRA rank and placement across modules and tasks reveals a consistent trade-off, with a moderate-rank sweet spot that varies by placement and task, leaving no universally optimal fixed rank; a formal bound shows forgetting grows with rank. Building on these findings, we propose Continual Dynamic Rank-Selective LoRA (CoDyRA), which jointly trains each LoRA update with rank minimization via sparsity-promoting regularization on per-component importance weights. The supervised objective drives plasticity; rank minimization regularizes forgetting. We show that rank minimization serves as an implicit forgetting regularizer in the CL regime, protecting general capability and prior-task knowledge simultaneously by controlling forgetting against the current model state. Across MTIL, X-TAIL, and TRACE (CLIP, LLaMA, Gemma), CoDyRA outperforms prior CL methods on new knowledge learning and forgetting, achieving a strong plasticity–stability balance. Project page: https://artificer-ai-lab.github.io/CoDyRA.
2025
Adversarial Attacks Against Automated Fact-Checking: A Survey
Fanzhen Liu | Sharif Abuadbba | Kristen Moore | Surya Nepal | Cecile Paris | Jia Wu | Jian Yang | Quan Z. Sheng
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Fanzhen Liu | Sharif Abuadbba | Kristen Moore | Surya Nepal | Cecile Paris | Jia Wu | Jian Yang | Quan Z. Sheng
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
In an era where misinformation spreads freely, fact-checking (FC) plays a crucial role in verifying claims and promoting reliable information. While automated fact-checking (AFC) has advanced significantly, existing systems remain vulnerable to adversarial attacks that manipulate or generate claims, evidence, or claim-evidence pairs. These attacks can distort the truth, mislead decision-makers, and ultimately undermine the reliability of FC models. Despite growing research interest in adversarial attacks against AFC systems, a comprehensive, holistic overview of key challenges remains lacking. These challenges include understanding attack strategies, assessing the resilience of current models, and identifying ways to enhance robustness. This survey provides the first in-depth review of adversarial attacks targeting FC, categorizing existing attack methodologies and evaluating their impact on AFC systems. Additionally, we examine recent advancements in adversary-aware defenses and highlight open research questions that require further exploration. Our findings underscore the urgent need for resilient FC frameworks capable of withstanding adversarial manipulations in pursuit of preserving high verification accuracy.