← Search

Chengsong Huang

14 accepted papers

2026

CaTS: Calibrated Test-Time Scaling for Efficient LLM Reasoning

ICLR 2026poster

Increasing test-time computation is a straightforward approach to enhancing the quality of responses in Large Language Models (LLMs). While Best-of-N sampling and Self-Consistency with majority voting are simple and effective, they require a fixed number of sampling responses for each query, regardl…

Cited by 0SourceScholar
2026

Parallel-Probe: Towards Efficient Parallel Thinking via 2D Probing

ICML 2026poster

Parallel thinking has emerged as a promising paradigm for reasoning, yet it imposes significant computational burdens. Existing efficiency methods primarily rely on local, per-trajectory signals and lack principled mechanisms to exploit global dynamics across parallel branches. We introduce 2D probi…

Cited by 0SourceScholar
2026

Parallel-R1: Towards Parallel Thinking via Reinforcement Learning

ICLR 2026poster

Parallel thinking has emerged as a novel approach for enhancing the reasoning capabilities of large language models (LLMs) by exploring multiple reasoning paths concurrently. However, activating such capabilities through training remains challenging. Existing methods mainly rely on supervised fine-t…

Cited by 0SourcecodeScholar
2026

R-Zero: Self-Evolving Reasoning LLM from Zero Data

ICLR 2026poster

Self-evolving Large Language Models (LLMs) offer a scalable path toward super-intelligence by autonomously generating, refining, and learning from their own experiences. However, existing methods for training such models still rely heavily on vast human-curated tasks and labels, typically via fine-t…

Cited by 0SourcecodeScholar
2026

Rethinking the Reranker: Boundary-Aware Evidence Selection for Robust Retrieval-Augmented Generation

ICML 2026poster

Retrieval-Augmented Generation (RAG) systems remain brittle under realistic retrieval noise, even when the required evidence appears in the top-$K$ results. A key reason is that retrievers and rerankers optimize solely for relevance, often selecting either trivial, answer-revealing passages or evide…

Cited by 0SourceScholar
2026

Self-Rewarding Vision-Language Model via Reasoning Decomposition and Multi-Reward Policy Optimization

ICLR 2026poster

Vision-Language Models (VLMs) often suffer from visual hallucinations – generating things that are not consistent with visual inputs – and language shortcuts, where they skip the visual part and just rely on text priors. These issues arise because most post-training methods for VLMs rely on simple v…

Cited by 0SourceScholar
2026

Training Data Efficiency in Multimodal Process Reward Models

ICML 2026poster

Multimodal Process Reward Models (MPRMs) are central to step-level supervision for visual reasoning in MLLMs. Training MPRMs typically requires large-scale Monte Carlo (MC)-annotated corpora, incurring substantial training cost. This paper studies the data efficiency for MPRM training. Our prelimina…

Cited by 0SourceScholar
2025

GOFA: A Generative One-For-All Model for Joint Graph Language Modeling

ICLR 2025poster

Foundation models, such as Large Language Models (LLMs) or Large Vision Models (LVMs), have emerged as one of the most powerful tools in the respective fields. However, unlike text and image data, graph data do not have a definitive structure, posing great challenges to developing a Graph Foundation…

2025

Taming Overconfidence in LLMs: Reward Calibration in RLHF

ICLR 2025poster

Language model calibration refers to the alignment between the confidence of the model and the actual performance of its responses. While previous studies point out the overconfidence phenomenon in Large Language Models (LLMs) and show that LLMs trained with Reinforcement Learning from Human Feedbac…

2023

On Grounded Planning for Embodied Tasks with Language Models

AAAI 2023technical

Language models (LMs) have demonstrated their capability in possessing commonsense knowledge of the physical world, a crucial aspect of performing tasks in everyday life. However, it remains unclear whether they have the capacity to generate grounded, executable plans for embodied tasks. This is a c…

Cited by 41SourcePDFScholar
2023

TableVLM: Multi-modal Pre-training for Table Structure Recognition

ACL 2023long

Tables are widely used in research and business, which are suitable for human consumption, but not easily machine-processable, particularly when tables are present in images. One of the main challenges to extracting data from images of tables is accurately recognizing table structures, especially fo…

2023

Watermarking PLMs on Classification Tasks by Combining Contrastive Learning with Weight Perturbation

EMNLP 2023long findings

Large pre-trained language models (PLMs) have achieved remarkable success, making them highly valuable intellectual property due to their expensive training costs. Consequently, model watermarking, a method developed to protect the intellectual property of neural models, has emerged as a crucial yet…

Cited by 0SourceScholar
2021

Revisiting the Negative Data of Distantly Supervised Relation Extraction

ACL 2021long

Distantly supervision automatically generates plenty of training samples for relation extraction. However, it also incurs two major problems: noisy labels and imbalanced training data. Previous works focus more on reducing wrongly labeled relations (false positives) while few explore the missing rel…