Papers by Ling Huang

29 papers
TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling (2025.findings-emnlp)

Copied to clipboard

Challenge: Best-of-N (BoN) sampling generates multiple responses and selects the best one, achieving improved performance but with a high computational cost.
Approach: They propose a framework that integrates a speculative tree-search strategy into Best-of-N (BoN) Sampling.
Outcome: The proposed framework outperforms Best-of-N (BoN) sampling but has high computational cost . tree-search strategy reduces computational overhead while maintaining high output quality .
Self-supervised Quantized Representation for Seamlessly Integrating Knowledge Graphs with Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are gaining popularity due to their lack of knowledge hallucination and lack of a coherent model.
Approach: They propose a self-supervised quantized representation method to compress KG structural and semantic knowledge into discrete codes that align the format of language sentences.
Outcome: The proposed framework outperforms existing unsupervised methods producing more distinguishable codes on KG link prediction and triple classification tasks.
H3Fusion: Helpful, Harmless, Honest Fusion of Aligned LLMs (2026.eacl-long)

Copied to clipboard

Challenge: Existing approaches to align pre-trained LLMs with instructions for one property are difficult to fine-tune.
Approach: They propose a mixture-of-experts-based fusion mechanism that models alignment as a controllable drift within the subspace, guided by a drift-regularization loss to balance competing alignment dimensions.
Outcome: Extensive evaluations of three benchmark datasets show that H3Fusion outperforms each individually aligned model by 11.37% and provides stronger robustness compared to the state-of-the-art LLM ensemble approaches by 13.77% and model-merging approaches by 6.18 %.
Neural Chain-of-Thought Search: Searching the Optimal Reasoning Path to Enhance Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Recent research indicates that Large Reasoning Models suffer from a strategic bottleneck at reasoning path planning.
Approach: They propose a framework that reformulates reasoning as a dynamic search for the optimal thinking strategy.
Outcome: The proposed framework improves accuracy and computational cost while reducing generation length by over 22%.
Spiral of Silence in Large Language Model Agents (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing theories of Spiral of Silence do not apply to large language models .
Approach: They propose an evaluation framework for examining SoS in large language models . they consider four controlled conditions that vary the availability of "History" and "Persona" signals .
Outcome: The proposed framework examines the SoS-like dynamics in large language models . it shows that history and persona together produce strong majority dominance .
Aligning Large Language Models with Human Preferences through Representation Engineering (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for achieving this alignment involve employing reinforcement learning from human feedback (RLHF) Existing approaches involve using RLHF to fine-tune LLMs based on human labels . however, RLRF is susceptible to instability during fine- tuning and presents challenges in implementation.
Approach: They propose to use reinforcement learning from human feedback to fine-tune large language models with human preferences to achieve precise control of model behavior.
Outcome: Experiments show that RAHF can be used to capture and manipulate representations to align with a broad spectrum of human preferences or values rather than being confined to a single concept or function.
Infinity-Parser: Layout-Aware Reinforcement Learning with High-quality Document Parsing Dataset (2026.findings-acl)

Copied to clipboard

Challenge: Existing supervised fine-tuning methods struggle to generalize across document types, leading to poor performance.
Approach: They propose layoutRL, a reinforcement learning framework that optimizes layout understanding through composite rewards integrating normalized edit distance, paragraph count accuracy, and reading order preservation.
Outcome: The proposed model outperforms specialized document parsing systems and general-purpose vision-language models on a broad range of document types, languages, and structural complexities.
OpenEval: Benchmarking Chinese LLMs across Capability, Alignment and Safety (2024.acl-demos)

Copied to clipboard

Challenge: a rapid development of Chinese large language models poses big challenges for efficient LLM evaluation.
Approach: They propose an evaluation testbed that benchmarks Chinese LLMs across capability, alignment and safety.
Outcome: The evaluation platform OpenEval benchmarks Chinese LLMs across capability, alignment and safety.
Call Me When Necessary: LLMs can Efficiently and Faithfully Reason over Structured Environments (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graphs and tables.
Approach: They propose a framework that allows LLMs to efficiently and faithfully reason over structured environments.
Outcome: The proposed framework surpasses state-of-the-art fine-tuned methods on three KGQA and two TableQA datasets and surpasse CWQ and WTQ methods.
Parameter Efficient Multi-task Fine-tuning by Learning to Transfer Token-wise Prompts (2023.findings-emnlp)

Copied to clipboard

Challenge: Prompt tuning has been proven to be successful on various tasks by incorporating a small number of trainable parameters while freezing large pre-trained language models.
Approach: They propose a token-wise prompt tuning method that uses a bank of finer-grained soft prompt tokens to generate an instance-dependent prompt.
Outcome: The proposed method performs far better than full parameter fine-tuned models and achieves state-of-the-art by tuning only 0.035% parameters on 14 datasets.
Temporal Consistency for LLM Reasoning Process Error Identification (2025.findings-emnlp)

Copied to clipboard

Challenge: Empirical evaluations show consistent performance improvements over baseline methods . 7B/8B distilled models outperform all 70B/72B models and GPT-4o on ProcessBench .
Approach: They propose a temporal consistency method that leverages consistency in a sequence of self-reflection actions to improve verification accuracy.
Outcome: The proposed method outperforms existing methods on three benchmarks . it leverages consistency in a sequence of self-reflection actions to improve accuracy .
EcoLANG: Efficient and Effective Agent Communication Language Induction for Social Simulation (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated impressive ability to role-play humans and replicate complex social dynamics.
Approach: They propose an efficient agent communication language induction for social simulations that reduces token consumption by over 20%.
Outcome: The proposed model reduces token consumption by over 20% while preserving human language.
Pre-training Language Model as a Multi-perspective Course Learner (2023.findings-acl)

Copied to clipboard

Challenge: Experimental results show that our method significantly improves ELECTRA’s average performance by 2.8% and 3.2% absolute points respectively on GLUE and SQuAD 2.0 benchmarks.
Approach: They propose a multi-perspective course learning method to fetch many degrees and visual angles for sample-efficient pre-training and to fully leverage the relationship between generator and discriminator.
Outcome: The proposed method improves ELECTRA's performance on GLUE and SQuAD 2.0 benchmarks and overshadows recent advanced ELECL-style models under the same settings.
Joint Enhancement of Relational Reasoning for Long-Context LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: JERR is a graph-based reasoning framework for large language models . it enables LLMs to handle extended contexts with improved reliability and transparency .
Approach: They propose a graph-based reasoning framework that integrates synopsis extraction, graph construction, and relational reasoning.
Outcome: The proposed framework outperforms baselines on ROUGE and F1 metrics and achieves the highest scores on the LLM-Rater evaluation.
LLM-TOPLA: Efficient LLM Ensemble by Maximising Diversity (2024.findings-emnlp)

Copied to clipboard

Challenge: Extensive evaluation of modern large language models shows performance gain over component LLMs.
Approach: They propose a diversityoptimized LLM ensemble method with three unique properties . they introduce the focal diversity metric to capture diversityperformance correlation .
Outcome: The proposed method outperforms the best-performing ensemble on four benchmarks.
Identifying the Achilles’ Heel: An Iterative Method for Uncovering Factual Errors in Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Current methods for evaluating LLMs’ veracity are limited by the need for extensive human labor, test data contamination, or limited scope, hindering efficient and effective exposure of errors.
Approach: They propose a framework that extracts fact triplets to generate diverse question types using rule-based natural language processing techniques.
Outcome: The proposed framework can trigger factual errors in up to 55% of questions in large LLMs while maintaining coverage of questions.
Learning to Ask: When LLM Agents Meet Unclear Instruction (2025.emnlp-main)

Copied to clipboard

Challenge: Despite their impressive capabilities, LLMs struggle with complex computations and delivering accurate, timely information.
Approach: They propose a framework that prompts LLM agents to ask questions when they encounter obstacles due to unclear instructions and an automated evaluation tool called ToolEvaluator.
Outcome: The proposed framework outperforms existing frameworks for tool learning in the Noisy ToolBench.
VaseVQA: Multimodal Agent and Benchmark for Ancient Greek Pottery (2026.findings-eacl)

Copied to clipboard

Challenge: MLLMs that use domain-specific data are limited in understanding cultural heritage artifacts such as ancient Greek pottery . supervised fine-tuning improves adaptation to domain knowledge, but it struggles with deeper reasoning tasks.
Approach: They propose a visual question-answer tool that augments SFT with reinforcement learning using verifiable rewards.
Outcome: The proposed model outperforms baseline models on reasoning-intensive questions on ancient Greek pottery.
DIAG-NRE: A Neural Pattern Diagnosis Framework for Distantly Supervised Neural Relation Extraction (P19-1)

Copied to clipboard

Challenge: Existing methods for labeling relational facts require significant expert labor to write relation-specific patterns, which makes them too sophisticated to generalize quickly.
Approach: They propose a neural pattern diagnosis framework that can summarize and refine relation-specific patterns with human experts in the loop.
Outcome: The proposed framework can summarize and refine high-quality relational patterns from noise data with human experts in the loop.
IF-CRITIC: Towards a Fine-Grained LLM Critic for Instruction-Following Evaluation (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluation models for instruction-following have many shortcomings, such as substantial costs and unreliable assessments.
Approach: They propose an LLM critic for fine-grained instruction-following evaluation using a checklist generator and a constraint-level preference optimization method.
Outcome: The proposed model beats strong LLM-as-a-Judge baselines in evaluations under lower computational overhead compared to baselines.
IF-RewardBench: Benchmarking Judge Models for Instruction-Following Evaluation (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for instruction-following lack data coverage and oversimplified pairwise evaluation paradigms that misalign with model optimization scenarios.
Approach: They propose a meta-evaluation benchmark for instruction-following that covers diverse instruction and constraint types and a preference graph for each instruction.
Outcome: Extensive experiments on IF-RewardBench show that the proposed benchmark achieves a stronger positive correlation with downstream task performance compared to existing benchmarks.
HeterMPC: A Heterogeneous Graph Neural Network for Response Generation in Multi-Party Conversations (2022.acl-long)

Copied to clipboard

Challenge: Experimental results show that HeterMPC outperforms various baseline models for response generation in multi-party conversations.
Approach: They propose a heterogeneous graph-based neural network for response generation in multi-party conversations which models the semantics of utterances and interlocutors simultaneously with two types of nodes in a graph.
Outcome: The proposed model outperforms baseline models on the Ubuntu Internet Relay Chat (IRC) channel.
TegTok: Augmenting Text Generation via Task-specific and Open-world Knowledge (2022.findings-acl)

Copied to clipboard

Challenge: Generating natural and informative texts has been a long-standing problem in NLP.
Approach: They propose to augment TExt Generation via Task-specific and Open-world Knowledge in a unified framework.
Outcome: The proposed model can learn what and how to generate on two text generation tasks.
RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: a lack of comprehensive benchmarks for Routing large language models has hindered the development of routers.
Approach: They propose a router-based benchmark to evaluate Routing large language models . the benchmark includes performance records for 12 popular LLM evaluations .
Outcome: The proposed model-level scaling up phenomenon can surpass the best single model in the pool and many existing strong LLMs.
Advancing Parameter Efficiency in Fine-tuning via Representation Editing (2024.acl-long)

Copied to clipboard

Challenge: Parameter Efficient Fine-Tuning (PEFT) has gained significant attention for its ability to achieve competitive results while updating only a small subset of trainable parameters.
Approach: They propose a new approach to fine-tuning neural models that scales and biases the representation produced at each layer.
Outcome: The proposed approach reduces the number of trainable parameters by a factor of 25,700 compared to full parameter fine-tuning and by . 32 compared with LoRA.
Dissecting Logical Reasoning in LLMs: A Fine-Grained Evaluation and Supervision Study (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing benchmarks that rely on final-answer accuracy fail to capture the quality of the reasoning process.
Approach: They propose a fine-grained evaluation framework that assesses logical reasoning across three dimensions: overall accuracy, stepwise soundness, and representation-level probing.
Outcome: The proposed framework assesses logical reasoning across three dimensions: overall accuracy, stepwise soundness, and representation-level probing.
MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing LCU benchmarks for large language models often result in prohibitively high evaluation costs . existing benchmarks exhibit significant redundancy, which means inefficiency in evaluation .
Approach: They propose a data compression method tailored for long-text data with sparse information characteristics.
Outcome: The proposed method reduces evaluation costs to 4.5% of the long-text benchmark LongBench . the proposed method is based on a long-term LCU benchmark with sparse information characteristics .
Enhancing Unsupervised Semantic Parsing with Distributed Contextual Representations (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods to learn models on corpus of pairs of sentences require labor-intensive annotation.
Approach: They propose to leverage distributed contextual word and phrase representations pre-trained on unlabelled texts to deal with homonymy and polysemy.
Outcome: The proposed model achieves better accuracy on question-answering and relation extraction tasks.
Promoting Data and Model Privacy in Federated Learning through Quantized LoRA (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing federated learning frameworks require substantial data and computational resources to develop large language models.
Approach: They propose a method that distributes a quantized version of the model’s parameters during training and combine it with a popular fine-tuning method to significantly reduce communication costs.
Outcome: The proposed method enables accurate estimations for parameter updates while preventing clients from accessing a model whose performance is comparable to the centrally hosted one.

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