Papers by Cong Hu

17 papers
Reasoning in a Combinatorial and Constrained World: Benchmarking LLMs on Natural-Language Combinatorial Optimization (2026.findings-acl)

Copied to clipboard

Challenge: NLCO evaluates large language models for combinatorial optimization (CO) . existing evaluations emphasize relatively simple reasoning competencies .
Approach: They propose a combinatorial optimization benchmark that evaluates large language models on CO reasoning.
Outcome: The proposed model can handle combinatorial optimization without writing code or calling external solvers.
Formally Specifying the Intended Behavior of the Program: LLM-Driven Neuro-Symbolic Program Specification Synthesis (2026.acl-demo)

Copied to clipboard

Challenge: Formal verification typically requires developers to write detailed formal specifications . a formal verification system that generates candidate specifications is costly and error-prone .
Approach: They propose an LLM-driven neuro-symbolic demonstration system that reframes specification writing as constrained structured synthesis.
Outcome: The proposed system reduces hallucinations and produces proof-ready annotations.
DisCal: Distribution-Aware Calibration for Mathematical Reasoning Under Character-Level Noisy Inputs (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for calibration of large reasoning models (LRMs) focus on clean inputs, leaving noise unexplored.
Approach: They propose a confidence calibration framework for character-level noisy inputs that extracts uncertainty signals from both the empirical answer distribution and the model’s predictive distribution and integrates them via a learned calibrator.
Outcome: Experiments on multiple mathematical reasoning benchmarks show that DisCal outperforms existing calibration methods under noisy inputs, reducing expected calibration error (ECE) by up to 39.21% and improving Area Under the Receiver Operating Characteristic Curve (AUROC) by 31.44%.
Two Streams, One Sarcasm: Orthogonal Expert Tuning for Holistic Multimodal Sarcasm Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for multimodal satirical cognition hinder evaluation of multimodal Sarcasm Understanding . lack of a unified benchmark for holistic satire cognition hampers evaluation of MSU .
Approach: They propose a framework to decouple experts into orthogonal shared perception and private execution streams to physically block gradient interference between tasks.
Outcome: The proposed framework achieves superior performance on DocMSU-PLUS.
Where to Attack: A Dynamic Locator Model for Backdoor Attack in Text Classifications (2022.coling-1)

Copied to clipboard

Challenge: BackDoor Attack (BDA) study aims to train a poisoned model with clean data and some trigger-embedded instances to perform normally on normal inputs.
Approach: They propose to train a poisoned model with clean and poisonest inputs . they propose to use triggers to predict those poisonets as target labels .
Outcome: The proposed model can predict P2P dynamically without human intervention.
CLUE: A Chinese Language Understanding Evaluation Benchmark (2020.coling-main)

Copied to clipboard

Challenge: Existing language evaluation benchmarks for English are limited to English . lack of such benchmarks makes it difficult to replicate success in other languages .
Approach: They introduce a large-scale Chinese language understanding evaluation benchmark . the benchmark uses a set of current state-of-the-art pre-trained Chinese models .
Outcome: The first large-scale Chinese Language Understanding Evaluation (CLUE) benchmark is released . the benchmark evaluates models across a wide range of tasks on original Chinese text . existing language evaluation benchmarks are mostly limited to English .
MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sample-Efficient LLM Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Existing RLVR algorithms rely on rigid, uniform, and symmetric trust region mechanisms . current algorithms lack robustness, asymmetric signal reliability and inefficient gradient utilization .
Approach: They propose a framework to harmonize three dimensions of RLVR algorithms, a paper argues . a binary cutoff is used to discard valuable reinforcement signals, they argue .
Outcome: The proposed framework outperforms baselines in evaluating a robust RLVR solution.
From log 𝜋 to 𝜋: Taming Divergence in Soft Clipping via Bilateral Decoupled Decay of Probability Gradient Weight (2026.acl-long)

Copied to clipboard

Challenge: Standard algorithms for Large Language Models (LLMs) enforce stability via "hard clipping" but relying on log-probability gradient yields divergent weights as probabilities vanish, destabilizing LLM training.
Approach: They propose a decoupled gradient policy optimization that uses a decay mechanism to decouple the probability of a boundary token.
Outcome: The proposed algorithm outperforms baselines on various mathematical benchmarks.
Improving Multilingual Sign Language Translation with Automatically Clustered Language Family Information (2025.coling-main)

Copied to clipboard

Challenge: Recent research has focused on bilingual translation models, but multilingual sign language translation presents unique challenges due to the diversity of sign languages across nations.
Approach: They propose a method that leverages sign language families to improve MSLT performance.
Outcome: The proposed approach can achieve balance between translation accuracy and computational cost by regulating the number of language families.
Adaptive Simultaneous Sign Language Translation with Confident Translation Length Estimation (2024.lrec-main)

Copied to clipboard

Challenge: Existing non-simultaneous sign language translation methods suffer from inherent inference delays in real-time scenarios.
Approach: They propose an adaptive policy for simultaneous sign language translation that progressively converts incrementally received sign video into its corresponding natural sentence.
Outcome: The proposed policy excels in situations requiring extremely low latency.
Universal Information Extraction with Meta-Pretrained Self-Retrieval (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods for IE are task-specific, resulting in specialized and isolated approaches for different tasks.
Approach: They propose a method to retrieve task-specific knowledge from pretrained language models to enhance universal IE by using a Meta-Pretraining Algorithm.
Outcome: The proposed method achieves the new state-of-the-art on 4 IE tasks, 12 datasets under fully-supervised, low-resource and few-shot scenarios.
How to Allocate, How to Learn? Dynamic Rollout Allocation and Advantage Modulation for Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for reinforcement learning with verifiable rewards are limited by the complexity of the problem and the complexity.
Approach: They propose a theoretically-grounded dual-pronged optimization framework for reinforcement learning with verifiable rewards that compensates for gradient attenuation of high-confidence correct actions while utilizing entropy changes as computable indicators to stabilize excessive update magnitudes.
Outcome: The proposed framework compensates for gradient attenuation of high-confidence correct actions while utilizing entropy changes as computable indicators to stabilize excessive update magnitudes.
SafeConf: A Confidence-Calibrated Safety Self-Evaluation Method for Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models (LLMs) have many advantages but they also pose significant safety risks.
Approach: They propose a method to enhance the safety self-evaluation capability of LLMs . they perform semantic mutations on the original safety evaluation questions .
Outcome: The proposed method improves safety self-evaluation accuracy by 5.86% and 7.79% over baseline methods on Chinese and English datasets.
Conformal Event Prediction with Temporal Knowledge Graph (2026.findings-acl)

Copied to clipboard

Challenge: Current event prediction methods lack rigorous uncertainty quantification, which limits their reliability for decision-making.
Approach: They propose a conformal prediction framework that applies conformal predictions to event prediction to address this challenge.
Outcome: The proposed framework guarantees coverage while improving efficiency on three public datasets.
Multi-Modal Multi-Granularity Tokenizer for Chu Bamboo Slips (2025.coling-main)

Copied to clipboard

Challenge: Using a multi-modal multi-granularity tokenizer, we analyze ancient Chinese scripts . a large proportion of the characters in ancient Chinese are rare or undeciphered .
Approach: They propose a multi-modal multi-granularity tokenizer specifically designed for ancient Chinese scripts.
Outcome: The proposed tokenizer improves on the part-of-speech tagging task on the Chu bamboo slip script.
GIFT: Graph-Induced Fine-Tuning for Multi-Party Conversation Understanding (2023.acl-long)

Copied to clipboard

Challenge: Existing methods on understanding multi-party conversations typically embed interlocutors and utterances into sequential information flows or use superficial graph structures.
Approach: They propose a plug-and-play method which adapts Transformer-based pre-trained language models for universal MPC understanding.
Outcome: The proposed method can adapt Transformer-based pre-trained language models for universal MPC understanding.
Dynamic Evil Score-Guided Decoding: An Efficient Decoding Framework For Red-Team Model (2025.findings-acl)

Copied to clipboard

Challenge: Existing red-teaming methods require expensive fine-tuning, especially for large LLMs.
Approach: They propose a red-teaming method that uses an ‘evil score’ to evaluate the potential of tokens to contribute to harmful outputs during decoding.
Outcome: The proposed method achieves an ASR of 92.83% on the Llama-3.2-3B-Instruct model, compared to 83.48% with adversarial fine-tuning while using less computational resources.

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