Papers by Xianzhen Luo

10 papers
Format-Adapter: Improving Reasoning Capability of LLMs by Adapting Suitable Format (2026.findings-acl)

Copied to clipboard

Challenge: Prior work showed that multiple reasoning formats outperform a single format when generating multiple answers.
Approach: They propose a method to measure reasoning error when generating multiple answers . they propose 'formatadapter' which generates and selects suitable reasoning formats .
Outcome: The proposed method achieves a 4.3% performance improvement over previous works on math and commonsense reasoning tasks.
Python is Not Always the Best Choice: Embracing Multilingual Program of Thoughts (2024.emnlp-main)

Copied to clipboard

Challenge: Program of Thoughts (PoT) is an approach characterized by its executable intermediate steps, which ensure the accuracy of the logical calculations in the reasoning process.
Approach: They propose a task and model agnostic approach which harnesses strength and diversity from various languages to achieve better performance across all tasks.
Outcome: The proposed approach outperforms Python Self-Consistency in almost all tasks and models and achieves comparable or superior performance on ChatGPT.
Make Some Noise: Unlocking Language Model Parallel Inference Capability through Noisy Training (2024.emnlp-main)

Copied to clipboard

Challenge: Existing speculative decoding methods require additional model structure and training processes to assist the model for draft token generation.
Approach: They propose a make some noise training framework that introduces some noise at the input for the model to learn the denoising task.
Outcome: The proposed model improves inference speed by 2.3-2.7x times without compromising model performance.
ChartCoder: Advancing Multimodal Large Language Model for Chart-to-Code Generation (2025.acl-long)

Copied to clipboard

Challenge: Existing open-source MLLMs fail to fully capture dense information embedded in charts . current models still face significant challenges in understanding and analyzing visual tasks such as captioning and question answering.
Approach: They propose a chart-to-code MLLM which leverages Code LLMs as the language backbone to enhance the executability of the generated code.
Outcome: The proposed model surpasses existing open-source models on chart-to-code benchmarks with only 7B parameters and provides lossless representations that contain all critical details.
A Survey on Natural Language Processing for Programming (2024.lrec-main)

Copied to clipboard

Challenge: Natural language processing for programming is a field of NLP and software engineering . it is used to assist programming, and is increasingly prevalent for its effectiveness in improving productivity.
Approach: They propose to use NLP techniques to assist programming by obtaining a structure-based representation and a functionality-oriented algorithm.
Outcome: The proposed approach could relieve developers from laborious work while improving efficiency for non-professional users.
Scaling Laws for Code: A More Data-Hungry Regime (2026.acl-long)

Copied to clipboard

Challenge: Code Large Language Models (LLMs) are revolutionizing software engineering, but scaling laws are primarily analyzed on Natural Language (NL).
Approach: They fit Chinchilla law and Farsser law to test scaling laws for code . they find code is more data-hungry and requires higher data-to-parameter ratio .
Outcome: The proposed scaling laws show that the more expressive Farsser law offers greater accuracy and scales with model size.
ChartEdit: How Far Are MLLMs From Automating Chart Analysis? Evaluating MLLMs’ Capability via Chart Editing (2025.findings-acl)

Copied to clipboard

Challenge: Existing evaluations of multimodal large language models rely on limited case studies . however, they lack the ability to generate accurate edits according to the instructions .
Approach: They propose a benchmark for chart editing that includes 1,405 edit instructions applied to 233 real-world charts.
Outcome: The proposed benchmark includes 1,405 diverse editing instructions applied to 233 real-world charts.
OpenCoder: The Open Cookbook for Top-Tier Code Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence.
Approach: They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included .
Outcome: The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model.
Inverse is Better! Fast and Accurate Prompt for Few-shot Slot Tagging (2022.findings-acl)

Copied to clipboard

Challenge: Recent results show that prompting methods are inefficient for slot tagging tasks . inverse prompting only requires a one-turn prediction for each slot type .
Approach: They propose an inverse prompting paradigm that reversely predicts slot values given slot types . the method is faster and significantly improves the effect on 10-shot setting .
Outcome: The proposed method improves over 6.1 F1-scores on 10-shot setting and achieves new state-of-the-art performance.
Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recycling (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) generate only one token at each decoding step, leading to high latency.
Approach: They propose a speculative decoding paradigm that stores tokens in an adjacency matrix and employs a breadth-first-search algorithm to construct a draft tree.
Outcome: The proposed method outperforms existing train-free methods by 30% and even a training method by 25%.

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