Papers by Hao Gu

30 papers
PII-Bench: Evaluating Query-Aware Privacy Protection Systems (2026.acl-long)

Copied to clipboard

Challenge: Existing models do not detect PII in user prompts, despite their convenience . current models show significant limitations in determining PI I query relevance .
Approach: They propose a query-unrelated PII masking strategy and propose PIi-Bench . they propose 'quick-and-easy' PI I masking with a user query and context description .
Outcome: The proposed model performs well in basic PII detection, but shows significant limitations in query relevance.
Adaptive Spatial and Temporal Redundancy Optimization for Efficient Reasoning in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing research to improve CoT efficiency falls into three categories, each with distinct limitations.
Approach: They propose a training-free framework that addresses both dimensions of CoT reasoning by applying a progressive precision reduction strategy coupled with an entropy-based confidence mechanism for adaptive termination.
Outcome: Empirical results show that the proposed framework achieves 11.3 efficiency gain without compromising accuracy.
Decentralized Arena: Towards Democratic and Scalable Automatic Evaluation of Language Models (2026.acl-long)

Copied to clipboard

Challenge: closed-ended question-based benchmarks struggle with saturation as newer models emerge . crowd-sourced leaderboards rely on costly and slow human judges .
Approach: They propose a framework that leverages collective intelligence from all large language models to evaluate each other.
Outcome: a new framework enables a democratic, pairwise evaluation of all large language models . it achieves 97% correlation with human judgements, while significantly reducing the cost.
Are Large Language Models Reliable Reviewers? A Benchmark for Error Detection in Financial Documents (2026.findings-acl)

Copied to clipboard

Challenge: Existing LLMs struggle to identify errors in financial documents, a study shows . 18% of financial practitioners make errors daily, one-third make errors several times weekly, and 59% make errors multiple times monthly.
Approach: They introduce FinED-Bench, a publicly available Benchmark for financial error detection . it covers nine real-world financial scenarios and includes over 900 documents in 2025 . supervised fine-tuning can significantly improve the performance of weaker LLMs, they show .
Outcome: The proposed benchmark covers nine real-world financial scenarios and includes over 900 documents reported in 2025 that are unseen by existing language models.
DevEval: A Manually-Annotated Code Generation Benchmark Aligned with Real-World Code Repositories (2024.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks are poorly aligned with real-world code repositories and are insufficient to evaluate the coding abilities of Large Language Models (LLMs).
Approach: They propose a repository-level benchmark named DevEval to evaluate LLMs' coding abilities in real-world code repositories.
Outcome: The proposed benchmarks show that the LLMs perform better in real-world code repositories than existing benchmarks.
SPARD: Self-Paced Curriculum for RL Alignment via Integrating Reward Dynamics and Data Utility (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are shifting the focus from single verifiable tasks toward complex, open-ended real-world scenarios.
Approach: They propose a framework that automatically adjusts reward weights and data importance to synchronize learning intent with data utility for optimal performance.
Outcome: The proposed framework improves model capabilities across all domains and scales.
Reasoning with Language Model is Planning with World Model (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable reasoning capabilities, particularly with Chain-of-Thought-style prompts.
Approach: They propose a framework that repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search)
Outcome: The proposed framework repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search) it achieves optimum balance between exploration and exploitation, while achieving high-reward reasoning paths efficiently.
Perplexity-Aware Data Scaling Law: Perplexity Landscapes Predict Performance for Continual Pre-training (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive capabilities across a wide range of domains, but their generalpurpose pre-training objectives often leave them illsuited for specialized applications such as healthcare.
Approach: They propose a perplexity-aware data scaling law that establishes a predictive relationship between the perplexities of domain-specific data and the test loss.
Outcome: Experiments on medical and general-domain benchmarks show that the proposed scaling law consistently identifies near-optimal training subsets with significantly reduced data consumption.
BTC-LLM: Efficient Sub-1-Bit LLM Quantization via Learnable Transformation and Binary Codebook (2026.acl-long)

Copied to clipboard

Challenge: Recent sparsity-aware binarization approaches can achieve sub-1-bit compression, but they face performance degradation, mask-management overhead, and limited hardware compatibility.
Approach: They propose a binary quantization framework that leverages binary pattern clustering and weight transformation to overcome performance degradation and mask-management overhead.
Outcome: The proposed framework achieves state-of-the-art compression (1.11–0.7 bits) it maintains high performance with only a 3.1% accuracy drop in zero-shot benchmarks while delivering a 1.6 speedup over FP16.
Towards a Mechanistic Understanding of Large Reasoning Models: A Survey of Training, Inference, and Failures (2026.acl-long)

Copied to clipboard

Challenge: Recent research has shown that reinforcement learning can elicit intriguing emergent reasoning behaviors.
Approach: They propose a comprehensive survey of the mechanistic understanding of large reasoning models . they organize findings into three core dimensions: 1) training dynamics, 2) reasoning mechanisms, and 3) unintended behaviors.
Outcome: This paper synthesizes the mechanistic understanding of large reasoning models into three dimensions . authors outline a roadmap for future studies including improved interpretability and methodologies .
From Redundancy to Relevance: Information Flow in LVLMs Across Reasoning Tasks (2025.naacl-long)

Copied to clipboard

Challenge: Large visionlanguage models (LVLMs) are a powerful visual-language reasoning tool.
Approach: They propose to integrate attention analysis with LLaVA-CAM to determine interactions between visual representations.
Outcome: The proposed approach can be used to determine interactions between visual representations.
Learning While Staying Curious: Entropy-Preserving Supervised Fine-Tuning via Adaptive Self-Distillation for Large Reasoning Models (2026.acl-long)

Copied to clipboard

Challenge: Recent advances establish "SFT-then-RL" as the defacto paradigm for enhancing large reasoning mod- els on automatically verifiable tasks.
Approach: They propose an entropy-preserving SFT method to enhance exploration capabilities through intrinsic curiosity.
Outcome: The proposed method outperforms the vanilla method on reasoning tasks by 2.5 points . it also outperformed the vanilla SFT by 2.9 points on out-of-distribution tasks .
Bit-by-Bit: Progressive QAT Strategy with Outlier Channel Splitting for Stable Low-Bit LLMs (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to training LLMs at ultra-low precisions suffer from convergence instability and substantial training costs.
Approach: They propose a progressive QAT framework with outlier channel splitting to address these issues . they use nested structure of integer quantization grids to enable a "train once, deploy any precision" paradigm .
Outcome: The proposed framework outperforms baselines on both Llama2/3 and W2A16, with an 11 speedup over BF16.
POP-CEE: Position-oriented Prompt-tuning Model for Causal Emotion Entailment (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for emotion analysis in conversations ignore the specific semantic associations between emotions and cause utterances.
Approach: They propose a position-oriented prompt-tuning model to solve the CEE task in an end-to-end manner.
Outcome: The proposed model achieves state-of-the-art performance on a benchmark dataset.
ClinAlign: Scaling Healthcare Alignment from Clinician Preference (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for aligning open-ended outputs with fine-grained clinician preferences are weakly grounded in professional guidelines.
Approach: They propose a framework to align large language models' outputs with fine-grained clinician preferences . they propose 119 broadly reusable, clinically grounded principles organized by clinical dimensions .
Outcome: The proposed framework outperforms existing models on HealthBench-Hard and Deepseek-R1 and o3.
A Cognitive Writing Perspective for Constrained Long-Form Text Generation (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models struggle to generate high-quality long-form text in a single pass . a new framework that trains LLMs to write human-like writing capabilities is needed .
Approach: They propose a framework that equips large language models with human-like cognitive writing capabilities . they use a planning agent and multiple Generation Agents to generate long-form text in parallel .
Outcome: CogWriter surpasses GPT-4o by 22% in complex instruction completion accuracy . the framework can generate coherent text in a single pass with fluency that rivals human writers .
EvoHyper: Evolving Hypergraph Topologies for Unified Collaboration in Multi-Agent Communication (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for multi-agent collaboration use a fixed communication graph and manage collaboration structure and shared memory in separate modules.
Approach: They propose a framework that uses an evolving hypergraph topology for multi-agent collaboration.
Outcome: The proposed framework achieves 3.2% to 7.8% accuracy gains over state-of-the-art methods and efficient, reducing token consumption by up to 23.5%.
C2PO: Diagnosing and Disentangling Bias Shortcuts in LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to solve large language models address stereotypical and structural biases in isolation . however, prior paradigms address these in isolation, often at the expense of exacerbating the other .
Approach: They propose a framework to tackle latent spurious feature correlations within input that drive erroneous reasoning shortcuts.
Outcome: The proposed framework mitigates stereotypical and structural biases while preserving robust general reasoning capabilities.
Learning from Emptiness: De-biasing Listwise Rerankers with Content-Agnostic Probability Calibration (2026.acl-short)

Copied to clipboard

Challenge: Existing methods for listwise reranking exhibit intrinsic position bias . existing methods are constrained by an inherent trade-off between efficiency and flexibility .
Approach: They propose a training-free framework that mechanically decouples positional bias from ranking decisions.
Outcome: a training-free framework decouples position bias from ranking decisions . evaluations show it outperforms training-based methods and outperformed expensive methods .
Debiased Orthogonal Boundary-Driven Efficient Noise Mitigation (2026.acl-long)

Copied to clipboard

Challenge: Existing noise mitigation methods face limitations due to their task-specific design, model dependency, and significant computational overhead.
Approach: They propose a model-agnostic noise label mitigation paradigm that uses an estimator model and a scoring function to assess the noise level of input pairs.
Outcome: The proposed method is superior to existing methods in training tasks and tasks.
RAPID: Efficient Retrieval-Augmented Long Text Generation with Writing Planning and Information Discovery (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for knowledge-intensive long texts struggle with issues like hallucinations, topic incoherence, and significant latency.
Approach: They propose a retrieval-augmented long text generation framework with writing P**lanning and I**nformation to address these challenges.
Outcome: The proposed framework outperforms state-of-the-art methods on a freshWiki-2024 dataset.
EmoPrompt-ECPE: Emotion Knowledge-aware Prompt-tuning for Emotion-Cause Pair Extraction (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for Emotion-cause pair extraction (ECPE) do not distinguish between the emotion-caused pairs that belong to different types of emotions, limiting their applicability.
Approach: They propose an Emotion-cause pair extraction method which integrates the implicit knowledge of cause clauses into a prompt template and extends the emotion labels to categories with an external emotion word base.
Outcome: The proposed method extracts all potential emotion clauses and corresponding cause clauses from unannotated documents.
QaRL: Rollout-Aligned Quantization-Aware RL for Fast and Stable Training under Training–Inference Mismatch (2026.findings-acl)

Copied to clipboard

Challenge: Recent work has shown that reinforcement learning with simple rule-based reward functions (RLVR) can induce emergent reasoning behaviors and yield gains in challenging domains such as math problem solving.
Approach: They propose a rollout-alignment-quantization-aware RL which aligns training-side forward with the quantized rollout to minimize mismatch.
Outcome: The proposed approach outperforms quantized-rollout training by +5.5 on Qwen3-30B-A3B MoE for math problems while maintaining low-bit throughput.
Middleware for LLMs: Tools Are Instrumental for Language Agents in Complex Environments (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) are generalist agents capable of operating within complex environments.
Approach: They propose a class of tools that can serve as a middleware layer shielding LLMs from environmental complexity.
Outcome: The proposed tool can shield the LLM from environmental complexity in two representative complex environments.
BalanceSFT: Improving LLM Function Calling with Balanced Training Signals and Data Hardness (2026.findings-acl)

Copied to clipboard

Challenge: Currently, Supervised Fine-Tuning (SFT) is the prevailing method for equipping Large Language Models (LLMs) with function calling capabilities, but its effectiveness is often compromised by two challenges: 1) lengthy Chain-of-Thought (CoT) reasoning tokens dominate training signals over concise function calls in the learning objective; 2) scarcity of hard training examples.
Approach: They propose a framework that uses a self-adjusted signal balancing loss and a hard data re-sampling strategy to selectively generate new, high-quality complex data guided by model errors.
Outcome: The proposed framework surpasses state-of-the-art models like GPT-5 in function calling performance.
NLoPT: N-gram Enhanced Low-Rank Task Adaptive Pre-training for Efficient Language Model Adaption (2024.lrec-main)

Copied to clipboard

Challenge: Pre-trained Language Models (PLMs) have superior performance on downstream tasks . however, conventional TAPT adjusts all parameters of the PLMs, which distorts the learned generic knowledge embedded in the original PLM's weights.
Approach: They propose a two-step n-gram enhanced low-rank task adaptive pre-training method to customize a PLM to the downstream task.
Outcome: The proposed method improves performance on six datasets from four domains.
Language Modeling with Sparse Product of Sememe Experts (D18-1)

Copied to clipboard

Challenge: Existing language modeling methods rely on large-scale text data to learn the sequential patterns of words.
Approach: They propose to use sememes to represent the implicit semantics behind words for language modeling . they propose to employ sememe-driven language models to fine-grained semem-level semantics .
Outcome: Experiments on language modeling and the downstream application of headline generation show the effectiveness of SDLM.
Shallow Focus, Deep Fixes: Enhancing Shallow Layers Vision Attention Sinks to Alleviate Hallucination in LVLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Multimodal large language models (MLLMs) demonstrate excellent abilities for understanding visual information, but the hallucination remains a challenging problem.
Approach: They propose a training-free approach to enhance vision attention sinks to facilitate convergence of the image token attention sink within shallow layers.
Outcome: The proposed approach improves the convergence of the image token attention sink within shallow layers and strengthens the layer’s focus on the image itself.
IDPG: An Instance-Dependent Prompt Generation Method (2022.naacl-main)

Copied to clipboard

Challenge: Existing prompt tuning methods use a fixed prompt in each input instance during the model training stage.
Approach: They propose a conditional prompt generation method to generate prompts for each input instance.
Outcome: The proposed method outperforms other prompt tuning methods while tuning fewer parameters.
IntelliCockpitBench: A Comprehensive Benchmark to Evaluate VLMs for Intelligent Cockpit (2025.findings-acl)

Copied to clipboard

Challenge: Visual Question Answering (VQA) is a key task in vehicular systems.
Approach: They propose a benchmark that encompasses diverse automotive scenarios . they use images from front, side, and rear cameras, various road types, weather conditions, and interior views .
Outcome: The proposed benchmark includes images from front, side, and rear cameras, various road types, weather conditions, and interior views.

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