Papers by Liping Wang
Reframe Your Life Story: Interactive Narrative Therapist and Innovative Moment Assessment with Large Language Models (2025.emnlp-main)
Copied to clipboard
Yi Feng, Jiaqi Wang, Wenxuan Zhang, Zhuang Chen, Shen Yutong, Xiyao Xiao, Minlie Huang, Liping Jing, Jian Yu
| Challenge: | Existing approaches to mental health support lack realism and capture therapeutic progression over time. |
| Approach: | They propose a framework that simulates expert narrative therapists by planning therapeutic stages, guiding reflection levels, and generating contextually appropriate responses through retrieval-augmentation. |
| Outcome: | The proposed framework outperforms standard methods in quality and depth on 260 simulated clients and 230 human participants. |
FactVerse: A Benchmark for Factual Consistency in Interleaved Image–Text Generation (2026.acl-long)
Copied to clipboard
Yubo Shan, Kun Zhang, Qiming Xu, Liping Cao, Yingying Cao, Jian Zhang, Yu Wang, Jingyuan Li, Yuanzhuo Wang
| Challenge: | Existing benchmarks lack effective mechanisms to evaluate factual consistency in interleaved image-text generation. |
| Approach: | They propose a benchmark dedicated to evaluating factual consistency in interleaved image-text generation. |
| Outcome: | The proposed framework outperforms existing evaluation methods in evaluating factual consistency in interleaved image-text generation. |
SVD-GCL: A Noise-Augmented Hybrid Graph Contrastive Learning Framework for Recommendation (2025.coling-main)
Copied to clipboard
| Challenge: | Recent advances in graph neural networks have made it difficult to capture user preferences. |
| Approach: | They propose a graph contrastive learning recommendation model based on noise augmentation that integrates truncated singular value decomposition in the feature engineering stage. |
| Outcome: | The proposed model reduces dimensionality and denoises the original data. |
Continual Gradient Low-Rank Projection Fine-Tuning for LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) offers efficiency but constrains the model’s ability to learn new tasks and transfer knowledge due to its low-rank nature and reliance on explicit parameter constraints. |
| Approach: | They propose a training strategy that synergistically combines full and low-rank parameters and jointly updating within a unified low-ranked gradient subspace. |
| Outcome: | Extensive experiments on continual learning benchmarks show that GORP improves performance compared to state-of-the-art approaches. |
EffiVLM-BENCH: A Comprehensive Benchmark for Evaluating Training-Free Acceleration in Large Vision-Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for accelerating Large Vision-Language Models lack comprehensive evaluation across diverse backbones, benchmarks, and metrics. |
| Approach: | They propose EffiVLM-BENCH framework for evaluating absolute performance and generalization and loyalty. |
| Outcome: | The proposed framework offers insights into optimal strategies for accelerating LVLMs. |
SmartTrim: Adaptive Tokens and Attention Pruning for Efficient Vision-Language Models (2024.lrec-main)
Copied to clipboard
Zekun Wang, Jingchang Chen, Wangchunshu Zhou, Haichao Zhu, Jiafeng Liang, Liping Shan, Ming Liu, Dongliang Xu, Qing Yang, Bing Qin
| Challenge: | Experimental results show that SmartTrim accelerates the original model by 2-3 times with minimal performance degradation. |
| Approach: | They propose an adaptive acceleration framework which prunes redundant token representations and attention heads within each layer of the original model. |
| Outcome: | The proposed framework accelerates the original model by 2-3 times with minimal performance degradation across vision-language tasks. |
CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Information (2025.coling-main)
Copied to clipboard
Yuxin Wang, MingHua Ma, Zekun Wang, Jingchang Chen, Shan Liping, Qing Yang, Dongliang Xu, Ming Liu, Bing Qin
| Challenge: | Existing LLM pruning works focus on unstructured pruning, which typically requires special hardware support for a practical speed-up. |
| Approach: | They propose a network pruning framework that leverages both coarse and fine-grained activation information as an importance criterion to guide pruning. |
| Outcome: | The proposed framework outperforms existing pruning methods on diverse models across sparsity budgets. |