Papers by Fanyu Meng
A structure-enhanced graph convolutional network for sentiment analysis (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Recent work on sentiment analysis and aspect-based sentiment analysis does not exploit syntactic information from dependency parsing. |
| Approach: | They propose a weighted graph convolutional network which exploits syntactic information . they use BERT instead of Bi-LSTM to generate contextualized representations as inputs . |
| Outcome: | The proposed model can exploit rich syntactic information based on feature combination . it can improve on four ABSA tasks out of six and two SA tasks out . |
PD3F: A Pluggable and Dynamic DoS-Defense Framework against resource consumption attacks targeting Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work lacks mitigation strategies against resource consumption attacks . existing work does not provide mitigation strategies for real-world LLM deployments . |
| Approach: | They propose a pluggable and dynamic doS-Defense framework which employs a two-stage approach to defend against resource consumption attacks from both the input and output sides. |
| Outcome: | The proposed framework significantly mitigates resource consumption attacks, improving users’ access capacity by up to 500% during adversarial load. |
Adversarial Semantic Decoupling for Recognizing Open-Vocabulary Slots (2020.emnlp-main)
Copied to clipboard
| Challenge: | Open-vocabulary slots degrade neural-based slot filling models because they can take on unlimited set of values and have no semantic restriction nor length limit. |
| Approach: | They propose a model-agnostic slot filling method that explicitly decouples local semantics inherent in open-vocabulary slot words from the global context. |
| Outcome: | The proposed method outperforms other models on open-vocabulary slots without deteriorating performance. |
Thinking-Based Non-Thinking: Solving the Reward Hacking Problem in Training Hybrid Reasoning Models via Reinforcement Learning (2026.acl-long)
Copied to clipboard
Siyuan Gan, Jiaheng Liu, Boyan Wang, Tianpei Yang, Runqing Miao, Yuyao Zhang, Fanyu Meng, Junlan Feng, Linjian Meng, Jing Huo, Yang Gao
| Challenge: | Existing work on large reasoning models (LRMs) focuses on using reinforcement learning (RL) to train hybrid reasoning models that automatically decide whether to engage in thinking or not based on the complexity of the query. |
| Approach: | They propose to use reinforcement learning to train hybrid reasoning models that automatically decide whether to engage in thinking or not based on the complexity of the query. |
| Outcome: | The proposed model reduces token usage by around 50%$ compared to DeepSeek-R1-Distill-Qwen-1.5B/7B and DeepScaleR-1.5b, while significantly improving accuracy. |