Papers by Ruifang Lu

4 papers
Clear Up Confusion: Advancing Cross-Domain Few-Shot Relation Extraction through Relation-Aware Prompt Learning (2024.naacl-short)

Copied to clipboard

Challenge: Existing approaches to few-shot Relation Extraction (RE) are prone to confusion when applying knowledge to a target domain with entirely new types of relations.
Approach: They propose a relation-aware prompt learning method with pre-training to clear confusion by decomposing relation types through an innovative label prompt.
Outcome: The proposed method outperforms previous sota methods and yields better results on cross-domain few-shot RE tasks.
Always the Best Fit: Adaptive Domain Gap Filling from Causal Perspective for Few-Shot Relation Extraction (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to cross-domain relation extraction have been limited by domains . data bias between domains can be difficult to fill, especially in few-shot scenarios .
Approach: They propose a framework to bridge the semantic gap caused by data bias between domains . they use syntactic structure, label distribution, and entities to calculate causal effects .
Outcome: The proposed framework fills the domain gap and yields better results on the few-shot task.
EchoVLM: Dynamic Mixture-of-Experts Vision-Language Model for Universal Ultrasound Intelligence (2026.acl-long)

Copied to clipboard

Challenge: Ultrasound is the preferred early cancer screening modality due to non-ionizing radiation, cost-effectiveness, and real-time imaging.
Approach: They propose to use ultrasound-tailored vision-language models with a mixture-of-experts architecture to train ultrasound-specific knowledge across seven anatomical systems.
Outcome: The proposed model outperforms Qwen2-VL by 7.58 BLEU-1 and 3.45 ROUGE-1 points in report generation.
Fusion Makes Perfection: An Efficient Multi-Grained Matching Approach for Zero-Shot Relation Extraction (2024.naacl-short)

Copied to clipboard

Challenge: Existing methods to extract unseen relations require laborious manual annotation . a new approach uses fine-grained matching to reduce manual annotation cost .
Approach: They propose an efficient multi-grained matching approach that uses virtual entity matching to reduce manual annotation cost.
Outcome: The proposed approach outperforms the state-of-the-art methods and achieves inference efficiency and accuracy in zero-shot relation extraction tasks.

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