Papers by Yidan Xu

5 papers
A Streamlined Span-based Factorization Method for Few Shot Named Entity Recognition (2024.lrec-main)

Copied to clipboard

Challenge: Existing approaches to few-shot named entity recognition require large amounts of labeled data.
Approach: They propose a streamlined span-based factorization method that solves few-shot NER problem . they propose to decompose the span-level alignment problem into several refined procedures .
Outcome: The proposed method achieves an average F1 score improvement of 12 points on the FewNERD dataset and 10 points on SNIPS dataset.
ACR: Adaptive Context Refactoring via Context Refactoring Operators for Multi-Turn Dialogue (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to multi-turn dialogues lack contextual consistency and dependencies, and models struggle to maintain factual faithfulness as interaction turns increase.
Approach: They propose an adaptive context refactoring framework that monitors and reshapes the interaction history to mitigate contextual inertia and state drift.
Outcome: The proposed model outperforms baselines while reducing token consumption.
Disentangled Information Bottleneck for Adversarial Text Defense (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies have proven that these deep models are super vulnerable to adversarial examples, which are slightly modified inputs.
Approach: They propose a novel text defense method that separates the robust and non-robust features with a disentangled two-line framework rather than the one-line compression network in IB.
Outcome: The proposed method outperforms six baselines on four datasets with accuracy improvements ranging from 3.8% to 20.7%.
RSDA: Restoring Stale Data Affinity via Dynamic Renovation Strategy for Mitigating Data Scarcity (2026.acl-long)

Copied to clipboard

Challenge: High-quality data is the cornerstone of advancing large language models, but the supply of premium data is nearing depletion, while vast stale corpora remain underutilized.
Approach: They propose a framework to restore stale data affinity by quantifying the latent value of samples and employing a dynamic renovation strategy selection mechanism to determine the optimal component-level strategy.
Outcome: The proposed framework achieves performance improvements using less than 10% of the data volume, underscoring that the latent potential of stale corpora remains largely untapped.
KCVR: Knowledge-Centric Video Reconstruction for Structured Pedagogical Summarization via Dynamic Graph Planning (2026.acl-long)

Copied to clipboard

Challenge: Existing summarization methods compress content for gist browsing, but they break prerequisite logic in instructional videos.
Approach: They propose a framework that decouples epistemic planning from content generation.
Outcome: The proposed framework outperforms strong end-to-end baselines on Knowledge Progression Consistency and Learning Objective Coverage.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations