Papers by Qingrong Xia

12 papers
A Unified Span-Based Approach for Opinion Mining with Syntactic Constituents (2021.naacl-main)

Copied to clipboard

Challenge: Existing methods for fine-grained opinion mining (OM) are based on span-based annotations, but they are not effective.
Approach: They propose a unified span-based approach for the end-to-end OM setting using syntactic constituents and multi-task learning to integrate them into the proposed model.
Outcome: The proposed approach achieves significant improvements over previous work on the MPQA 2.0 dataset and reduces the number of wrongly-predicted opinion expressions and roles.
Fast and Accurate End-to-End Span-based Semantic Role Labeling as Word-based Graph Parsing (2022.coling-1)

Copied to clipboard

Challenge: Using end-to-end span-based SRL, we propose a word-based graph parsing task for word-level representation of spans . compared with word-driven SRL, span-Based SRL is more complex due to difficulties in determining argument boundaries.
Approach: They propose to cast end-to-end span-based SRL as a word-based graph parsing task . they propose a constrained Viterbi procedure to ensure the legality of the output graph .
Outcome: The proposed model can parse 669/252 sentences per second without and with pre-trained models.
Accurate KV Cache Quantization with Outlier Tokens Tracing (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) require substantial computational resources during deployment.
Approach: They propose a method to identify outlier tokens and exclude them from quantization . they find that the method can deliver a 6.4 times reduction in memory usage and a 2.5 times increase in throughput .
Outcome: The proposed method delivers a 6.4 times reduction in memory usage and a 2.5 times increase in throughput under 2-bit quantization.
Adaptive Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimization (2024.findings-emnlp)

Copied to clipboard

Challenge: Large language models require a balance between efficiency and performance.
Approach: They propose a low-rank compression technique that reduces non-essential parameters by decomposing weight matrices into products of two low-ranked matrici.
Outcome: The proposed method outperforms existing pruning and low-rank compression techniques in maintaining model performance at the same compression ratio.
Semantic Role Labeling with Heterogeneous Syntactic Knowledge (2020.coling-main)

Copied to clipboard

Challenge: Recent work on incorporating syntactic knowledge into neural semantic role labeling has gained much attention . incorporating heterogeneous syntaktic knowledge brings significant improvements over strong baselines .
Approach: They propose to encode heterogeneous syntactic knowledge for SRL from explicit and implicit representations from heterogenous treebanks.
Outcome: The proposed approaches improve on two widely-used benchmark datasets.
Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to accelerate autoregressive generation of large language models require training costs.
Approach: They propose a training-free alignment-augmented speculative decoding algorithm . it leverages the output distribution obtained in the prefilling phase to provide more aligned draft candidates .
Outcome: The proposed method increases the average generation score by 3.3 points for the LLaMA3 model.
OPT-Tree: Speculative Decoding with Adaptive Draft Tree Structure (2025.tacl-1)

Copied to clipboard

Challenge: Autoregressive language models generate one token in one step, limiting inference efficiency . Existing methods do not adapt to different situations to maximize acceptance length . speculative decoding has shown great potential for lossless acceleration .
Approach: They propose an algorithm to construct adaptive and scalable draft trees for autoregressive language models.
Outcome: Experimental results show that OPT-Tree outperforms existing draft trees and achieves speed-up ratio of up to 3.2 compared with autoregressive decoding.
Stacked AMR Parsing with Silver Data (2021.findings-emnlp)

Copied to clipboard

Challenge: Lack of large-scale annotated data is one main challenge for abstract meaning representation (AMR) parsing.
Approach: They propose to use silver data to train a pre-trained abstract meaning representation model.
Outcome: The proposed model outperforms previous models on the AMR2.0 dataset and is faster than the SOTA model.
A Syntax-aware Multi-task Learning Framework for Chinese Semantic Role Labeling (D19-1)

Copied to clipboard

Challenge: Semantic role labeling (SRL) aims to identify the predicate-argument structure of a sentence.
Approach: They propose to use a unified span-based model for Chinese SRL as a strong baseline.
Outcome: The proposed framework achieves state-of-the-art 87.54 and 88.5 F1 scores on the Chinese Proposition Bank and CoNLL-2009 datasets.
MuCPAD: A Multi-Domain Chinese Predicate-Argument Dataset (2022.naacl-main)

Copied to clipboard

Challenge: Recent studies show that shallow semantic role labeling (SRL) performance drops under out-of-domain setting.
Approach: They propose to annotate a multi-domain Chinese predicate-argument dataset using a frame-free annotation methodology and strict double annotation for improving data quality.
Outcome: The proposed dataset is compared with a dataset from six different domains.
Semantic Role Labeling as Dependency Parsing: Exploring Latent Tree Structures inside Arguments (2022.coling-1)

Copied to clipboard

Challenge: Recent works of SRL mainly fall into two lines: 1) BIO-based; 2) span-based.
Approach: They propose to regard flat argument spans as latent subtrees, thus reducing SRL to a tree parsing task.
Outcome: The proposed model performs better than previous syntax-agnostic models on CoNLL05 and CoNll12 benchmarks.
AraMUS: Pushing the Limits of Data and Model Scale for Arabic Natural Language Processing (2023.findings-acl)

Copied to clipboard

Challenge: Developing monolingual large Pre-trained Language Models (PLMs) is shown to be very successful in handling different tasks in Natural Language Processing (NLP).
Approach: They present AraMUS, the largest Arabic PLM with 11B parameters trained on 529GB of high-quality Arabic textual data.
Outcome: The proposed model achieves state-of-the-art performance on a diverse set of Arabic classification and generative 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