Papers by Ying Xin

18 papers
Progra: Progress-Aware Reinforcement Learning for Multi-Turn Function Calling (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for multi-turn function calling are limited by redundancy and lack explicit integration of progress awareness into training.
Approach: They propose a framework that explicitly integrates progress awareness into LLM training for multi-turn function calling.
Outcome: Empirical results show that Progra outperforms existing methods on two public benchmarks.
CLEME2.0: Towards Interpretable Evaluation by Disentangling Edits for Grammatical Error Correction (2025.acl-long)

Copied to clipboard

Challenge: Existing studies have focused on the interpretability of Grammatical Error Correction (GEC) evaluation metrics, but the interpretabilty of these metrics has been neglected.
Approach: They propose a reference-based metric that describes four aspects of GEC systems: hit-correction, wrong-corrections, under-correcties, and over-corrects.
Outcome: The proposed metric reveals critical qualities and locates drawbacks of GEC systems.
Mitigate Extrinsic Social Bias in Pre-trained Language Models via Continuous Prompts Adjustment (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods of extrinsic bias mitigation rely on manual word lists for sensitive groups . however, these word lists are limited by length and scope, resulting in poor performance.
Approach: They propose a method which generates continuous token lists from the entire vocabulary space and uses them to bridge the gap between outputs and targets in fairness learning process.
Outcome: The proposed method outperforms baseline methods on three NLU tasks.
Improving Knowledge Graph Embedding Using Affine Transformations of Entities Corresponding to Each Relation (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing knowledge graph embedding methods use k-dimensional vectors to represent each entity in a knowledge graph.
Approach: They propose to use affine transformations to embed knowledge graphs using previous methods . they propose to add k additional variables to the existing methods to perform embedding .
Outcome: The proposed method outperforms RotatE, Distmult and ComplEx on various data sets.
JointCoder: Exploring Automated ICD Coding on Real-World Chinese EHRs with a Multi-Agent Framework (2026.acl-demo)

Copied to clipboard

Challenge: Existing automated ICD coding systems face several fundamental challenges due to the limited availability of publicly available Chinese ICD datasets.
Approach: They propose to use a Chinese ICD coding dataset and a multi-agent framework to reformulate ICD as a joint disease-procedure coding task.
Outcome: The proposed system outperforms state-of-the-art methods on real-world Chinese ICD coding datasets and 1.7B-parameter models.
Knowledge Graph Embedding by Adaptive Limit Scoring Loss Using Dynamic Weighting Strategy (2022.findings-acl)

Copied to clipboard

Challenge: Existing knowledge graph embedding models use a loss framework to distinguish between correct and incorrect triplets.
Approach: They propose a loss framework that reweights each triplet to highlight the less-optimized triplets.
Outcome: The proposed method performs on several knowledge graph embedding models, including TransE, TransH and ComplEx.
ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling (2026.acl-long)

Copied to clipboard

Challenge: Existing research on inference scaling focuses on unstructured output generation tasks, such as mathematical problems.
Approach: They propose an inference-scaling framework that combines fine-grained beam search with ToolPRM, a process reward model scoring each intra-call decision.
Outcome: The proposed framework outperforms outcome and coarse-grained reward models in predictive accuracy and yields consistent test-time gains on multiple function-calling benchmarks.
Data-Centric Explainable Debiasing for Improving Fairness in Pre-trained Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Existing data-centric debiasing strategies mainly leverage explicit bias words for counterfactual data augmentation to balance the training data.
Approach: They propose a method which uses an explainability method to search for implicit bias words to assist in debiasing PLMs.
Outcome: Extensive results show that the proposed method achieves state-of-the-art debiasing performance and strong generalization while maintaining predictive abilities.
Is the Attention Matrix Really the Key to Self-Attention in Multivariate Long-Term Time Series Forecasting? (2026.acl-long)

Copied to clipboard

Challenge: In multivariate long-term time series forecasting, it is widely believed that the effectiveness of self-attention arises from its attention matrix.
Approach: They propose a multi-branch MLP that isolates the ‘multi-brain mapping with element-wise operation’ structure from the Transformer and shows that it achieves competitive performance.
Outcome: The proposed model outperforms three classic and three latest Transformer models and shows that it achieves competitive performance.
MMLU-CF: A Contamination-free Multi-task Language Understanding Benchmark (2025.acl-long)

Copied to clipboard

Challenge: Multiple-choice question datasets like Massive Multitask Language Understanding (MMLU) have inevitably led to benchmark contamination, resulting in unreliable evaluation.
Approach: They propose a contamination-free MCQ benchmark called MMLU-CF which reassesses LLMs’ understanding of world knowledge by averting both unintentional and malicious data contamination.
Outcome: The proposed MMLU-CF reassesses LLMs’ understanding of world knowledge by averting both unintentional and malicious data contamination.
Prompt Tuning Pushes Farther, Contrastive Learning Pulls Closer: A Two-Stage Approach to Mitigate Social Biases (2023.acl-long)

Copied to clipboard

Challenge: Existing debiasing techniques use Counterfactual Data Augmentation (CDA) to balance the training corpus, but this technique slightly modifies the original corpus limiting the representation distance between different demographic groups.
Approach: They propose a two-stage debiasing model using Contrastive learning with Continuous Prompt Augmentation to mitigate social biases in PLMs’ encoding.
Outcome: The proposed model outperforms baselines in terms of debiasing performance while maintaining the language modeling capability of PLMs.
EARA: Improving Biomedical Semantic Textual Similarity with Entity-Aligned Attention and Retrieval Augmentation (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to measure semantic similarity between biomedical texts are inefficient due to too many biomedically-related entities.
Approach: They propose an entity-aligned, attention-based and retrieval-augmented PLM that aligns the same type of fine-grained entity information in each sentence pair with an entity alignment matrix with an auxiliary loss.
Outcome: The proposed model can achieve state-of-the-art on both in-domain and out-of domain datasets.
TARN-VIST: Topic Aware Reinforcement Network for Visual Storytelling (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for visual storytelling ignore latent topic information.
Approach: They propose a topic-aware reinforcement network for VIsual StoryTelling that takes topic information into account to generate a coherent story.
Outcome: The proposed method outperforms most of the competing models across multiple evaluation metrics.
Learning Hierarchy-Aware Quaternion Knowledge Graph Embeddings with Representing Relations as 3D Rotations (2022.coling-1)

Copied to clipboard

Challenge: Existing knowledge graph embedding models fail to model semantic hierarchies . Existing methods fail to understand the semantic hierarchies of knowledge graphs .
Approach: They propose a model which embeds entities as pure quaternions and constrains the modulus of entities to make them have hierarchical distributions.
Outcome: The proposed model can encode symmetry/antisymmetry, inversion, composition, multiple relation patterns and learn semantic hierarchies simultaneously.
Transferable End-to-End Aspect-based Sentiment Analysis with Selective Adversarial Learning (D19-1)

Copied to clipboard

Challenge: Existing methods to extract aspects and sentiments are limited due to lack of annotated sequence data.
Approach: They propose a Selective Adversarial Learning method to align latent correlation vectors . they propose tagging a set of aspect boundary tags and sentiment tags to create a joint label space .
Outcome: The proposed method can learn weights for words to achieve fine-grained adaptation.
CrystalICL: Enabling In-Context Learning for Crystal Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for crystal generation are limited to zero-shot scenarios and are unable to benefit from few-shot situations.
Approach: They propose a model designed for few-shot crystal generation that exploits in-context learning by capturing structure-property relationships from limited data.
Outcome: The proposed model reduces complexity of modeling crystal symmetry in LLMs and exploits ICL by capturing structure-property relationships from limited data.
SolEval: Benchmarking Large Language Models for Repository-level Solidity Smart Contract Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods focus on Python and Java, neglecting Solidity, the programming language for Ethereum smart contracts.
Approach: They construct a repository-level benchmark for Solidity to evaluate the performance of LLMs on Ethereum.
Outcome: The proposed benchmarks show that the best performing LLM achieves only 26.29% Pass@10, highlighting room for improvement in Solidity code generation.
Improving Zero-Shot Entity Linking Candidate Generation with Ultra-Fine Entity Type Information (2022.coling-1)

Copied to clipboard

Challenge: Entity linking is a task of assigning entity mentions to referent entities in a knowledge base.
Approach: They propose to use ultra-fine-grained type information to improve the generalization ability of EL models by utilizing a low-level task to extract ultra-finish entity type information.
Outcome: The proposed model achieves state-of-the-art in the zero-shot entity linking task .

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