Papers by Qiang Xia

8 papers
GAPO: Robust Advantage Estimation for Real-World Code LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning (RL) is widely used for post-training large language models (LLMs) in code editing, but in real-world code editing scenarios, reward distributions are often skewed with unpredictable noise, leading to distorted advantage computation and increased rollout outliers.
Approach: They propose a group-relative method that finds an interval with the highest SNR and uses the median of that interval as an adaptive Q to replace the group mean in advantage calculation.
Outcome: The proposed method improves on nine instruction-tuned LLMs while remaining plug-and-play and efficient.
Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting (2024.findings-acl)

Copied to clipboard

Challenge: Existing graph-based models excel at capturing structural information within TKGs but lack semantic comprehension abilities.
Approach: They propose a plug-and-play module to enhance the performance of graph-based TKG models by exploring high-order histories step-by-step.
Outcome: Experiments on three datasets and backbones show that CoH is effective in capturing high-order historical information for LLMs.
HSGraphAgent: Knowledge-Graph-Guided Large Language Models for Harmonized System Code Classification (2026.acl-long)

Copied to clipboard

Challenge: Harmonized System (HS) code classification is a hierarchically structured and regulation-constrained task, often complicated by short and noisy product descriptions.
Approach: They propose a knowledge-graph-guided LLM framework that formulates HS classification as a stepwise, regulation-aware reasoning process over an explicit HS knowledge graph.
Outcome: The proposed framework constrains inference to legally valid paths while producing explicit and traceable reasoning trajectories.
Learning Latent Relations for Temporal Knowledge Graph Reasoning (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for Temporal Knowledge Graph reasoning capture intra- and inter-time latent relations between entities that appear at different times.
Approach: They propose a Latent relations Learning method for TKG reasoning that captures latent relations between entities at different times.
Outcome: The proposed method exploits the intra- and inter-time latent relations of entities at different times.
MetaTKG: Learning Evolutionary Meta-Knowledge for Temporal Knowledge Graph Reasoning (2022.emnlp-main)

Copied to clipboard

Challenge: Existing models rely on historical information to learn embeddings for entities, but ignore the evolution of facts.
Approach: They propose a Temporal Meta-learning framework to learn evolutionary meta-knowledge from TKGs.
Outcome: The proposed method improves on four widely-used datasets and three backbones on a wide range of scenarios on tKGs.
ALYMPICS: LLM Agents Meet Game Theory (2025.coling-main)

Copied to clipboard

Challenge: Alympics provides a framework for simulating human-like strategic interactions with Large Language Model (LLM) agents.
Approach: They propose a framework utilizing Large Language Models (LLM) agents for empirical game theory research.
Outcome: The proposed framework can be used to study human-like strategic interactions with large language model (LLM) agents in a game on the multi-round auction of scarce survival resources.
SHARP: Steering Hallucination in LVLMs via Representation Engineering (2025.emnlp-main)

Copied to clipboard

Challenge: Large Vision-Language Models (LVLMs) generate responses that are plausible but incorrect or unsupported—commonly referred to as hallucinations.
Approach: They propose a representation-level intervention framework that modulates hallucination-related features during inference by probing their encoded features.
Outcome: The proposed framework reduces hallucinations while maintaining the performance and generalization capabilities of Large Vision-Language Models (LVLMs).
Plug-and-Play Data Module for Code RL: Adaptive Ambiguity Replay (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to reinforcement learning (RL) rely on static, in-epoch metrics that overlook training dynamics, often introducing low-utility or outdated data.
Approach: They propose a plug-and-play module that prioritizes cross-epoch ambiguous samples to neutralize the noise from stale experiences.
Outcome: Extensive experiments on nine LLMs show that Adaptive Ambiguity Replay outperforms state-of-the-art baselines on real-world code editing 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