Papers by Jinyan Liu
Exploring Hyperbolic Hierarchical Structure for Multimodal Rumor Detection (2025.findings-emnlp)
Copied to clipboard
| Challenge: | rumor detection models often assume a simplistic one-to-one alignment between modalities . authors present a method that preserves hierarchical, non-linear relationships . |
| Approach: | They propose a method that uses hyperbolic geometry to preserve hierarchical relationships . it decomposes image and text content into three levels and embeds them in hyperbolical space . |
| Outcome: | The proposed method preserves hierarchical relationships rather than representing them at a flat semantic level. |
Cross-Domain Fake News Detection based on Dual-Granularity Adversarial Training (2025.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to detect fake news in unseen domains are limited by domain-specific training. |
| Approach: | They propose a cross-domain fake news detection method based on adversarial training . they use a document-level and entity-level model to generate domain-independent representations . |
| Outcome: | The proposed method can detect fake news in unseen domains with the help of pre-trained language models. |
GSM-Noise: Exploring and Enhancing Large Language Models’ Reasoning under Noisy Inputs (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models struggle when dealing with complex, ill-formed, or noisy inputs . open-source models are less robust, while closed-source ones are more robust . |
| Approach: | They propose to use GSM-Noise to refine inputs before engaging in in-depth analysis to improve LLM robustness under noisy conditions. |
| Outcome: | The proposed model can achieve consistent performance gains under noisy conditions with prompt engineering, supervised finetuning, and reinforcement learning. |
AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems (2026.acl-long)
Copied to clipboard
| Challenge: | Automated expansion methods often result in bloated structures with redundant agents, leading to excessive token consumption. |
| Approach: | They propose a plug-and-play compression framework for graph-structured multi-agent workflows . they estimate the importance score of each agent and remove redundant agents . |
| Outcome: | Experiments show that AgentSlimming reduces average token cost by 78.9% with negligible performance degradation. |