Shanshan Liu
Author directoryOther people with similar names: Shanshan Liu
Unverified author pages with similar names: Shanshan Liu
2026
HyDRA: Hyperbolic Damage-aware Recovery and Adaptation for Robust Multimodal Sentiment Analysis with Incomplete Data
Yun Luo | Zejiang He | Zhen Huang | Zhiliang Tian | Yanzhou Ma | Menglong Lu | Jingyuan Huang | Shanshan Liu | Faying Wu | Dongsheng Li
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yun Luo | Zejiang He | Zhen Huang | Zhiliang Tian | Yanzhou Ma | Menglong Lu | Jingyuan Huang | Shanshan Liu | Faying Wu | Dongsheng Li
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Incomplete-Modality Multimodal Sentiment Analysis extends multimodal sentiment analysis (MSA) to infer sentiment from language, audio, and visual streams when one or more modalities are incomplete at inference time. Existing methods improve incomplete-modality MSA through feature reconstruction, distillation, or fusion adjustment, but usually assign similar correction strength to all samples with incomplete inputs. This overlooks the uneven emotional impact of modality missingness: mild missingness often leaves sentiment recognizable, whereas severe missingness can distort the expressed emotion and therefore requires stronger correction. We propose HyDRA (Hyperbolic Damage-aware Recovery and Adaptation), a damage-aware and text-guided hyperbolic framework that aligns correction strength with missingness-induced sentiment damage. HyDRA first recovers lost emotional cues from available modalities, then places each sample in the Poincaré ball according to estimated damage severity, and finally applies damage-weighted hyperbolic correction toward a complete-modality teacher anchor. Since hyperbolic distances expand near the boundary, heavily incomplete samples receive stronger correction while lightly incomplete samples are gently adjusted. Experiments on MOSI, MOSEI, and SIMS show SOTA robustness across incomplete-modality conditions.
SSPC: Semantic-Structural Propagation Calibration for Multimodal Fake News Detection
Zejiang He | Yun Luo | Zhen Huang | Zhiliang Tian | Jingyuan Huang | Shanshan Liu | Yanzhou Ma | Zhaoning Zhang | Dongsheng Li
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zejiang He | Yun Luo | Zhen Huang | Zhiliang Tian | Jingyuan Huang | Shanshan Liu | Yanzhou Ma | Zhaoning Zhang | Dongsheng Li
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Multimodal fake news detection predicts post veracity from text, images, and inter-post context. Existing content-centric and graph-propagation methods model post evidence and inter-post context, but graph propagation still assumes connected posts provide compatible veracity evidence. In multimodal fake news graphs, edges often represent post relatedness rather than veracity consistency, so propagation can pass misleading evidence across conflicting posts. In this paper, we propose Semantic-Structural Propagation Calibration (SSPC), which uses noisy LLM pseudo-labels to calibrate where and how much propagation should be trusted, rather than using them as direct labels. SSPC refines graph edges from high-confidence pseudo-label agreement, computes a graph-encoded base prediction and an explicitly graph-propagated prediction, and learns node-level propagation reliance with a cross-fitted utility gate. Experiments on Twitter, PHEME, and Weibo show SOTA performance over strong multimodal and graph-propagation fake news detection baselines.
2025
MONTROSE: LLM-driven Monte Carlo Tree Search Self-Refinement for Cross-Domain Rumor Detection
Shanshan Liu | Menglong Lu | Zhen Huang | Zejiang He | Liu Liu | Zhigang Sun | Dongsheng Li
Findings of the Association for Computational Linguistics: ACL 2025
Shanshan Liu | Menglong Lu | Zhen Huang | Zejiang He | Liu Liu | Zhigang Sun | Dongsheng Li
Findings of the Association for Computational Linguistics: ACL 2025
With the emergence of new topics on social media as sources of rumor dissemination, addressing the distribution shifts between source and target domains remains a crucial task in cross-domain rumor detection. Existing feature alignment methods, which aim to reduce the discrepancies between domains, are often susceptible to task interference during training. Additionally, data distribution alignment methods, which rely on existing data to synthesize new training samples, inherently introduce noise. To deal with these challenges, a new cross-domain rumor detection method, MONTROSE, is proposed. It combines LLM-driven Monte Carlo Tree Search (MCTS) data synthesis to generate high-quality synthetic data for the target domain and a domain-sharpness-aware (DSAM) self-refinement approach to train rumor detection models with these synthetic data effectively. Experiments demonstrate the superior performance of MONTROSE in cross-domain rumor detection.
GCML: Gradient Coherence Guided Meta-Learning for Cross-Domain Emerging Topic Rumor Detection
Zejiang He | Jingyuan Huang | Menglong Lu | Zhen Huang | Shanshan Liu | Zhiliang Tian | Dongsheng Li
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Zejiang He | Jingyuan Huang | Menglong Lu | Zhen Huang | Shanshan Liu | Zhiliang Tian | Dongsheng Li
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
With the emergence of new topics on social media as sources of rumor propagation, addressing the domain shift between the source and target domain and the target domain samples scarcity remains a crucial task in cross-domain rumor detection. Traditional deep learning-based methods and LLM-based methods are mostly focused on the in-domain condition, thus having poor performance in cross-domain setting. Existing domain adaptation rumor detection approaches ignore the data generalization differences and rely on a large amount of unlabeled target domain samples to achieve domain adaptation, resulting in less effective on emerging topic rumor detection. In this paper, we propose a Gradient Coherence guided Meta-Learning approach (GCML) for emerging topics rumor detection. Firstly, we calculate the task generalization score of each source task (sampled from source domain) from a gradient coherence perspective, and selectively learn more “generalizable” tasks that are more beneficial in adapting to the target domain. Secondly, we leverage meta-learning to alleviate the target domain samples scarcity, which utilizes task generalization scores to re-weight meta-test gradients and adaptively updates learning rate. Extensive experimental results on real-world datasets show that our method substantially outperforms SOTA baselines.