← Search

Haocheng Yang

7 accepted papers

2026

Enhancing Complex Symbolic Logical Rea­soning of Large Language Models via Sparse Multi-Agent Debate

ICLR 2026poster

Large language models (LLMs) struggle with complex logical reasoning. Previous work has primarily explored single-agent methods, with their performance remains fundamentally limited by the capabilities of a single model. To our knowledge, this paper first introduce a multi-agent approach specificall…

Cited by 0SourcecodeScholar
2026

Optimal Transport for Reward Modeling from Noisy Feedback

ICML 2026poster

Reward models are fundamental to Reinforcement Learning from Human Feedback (RLHF), yet real-world datasets are inevitably corrupted by noisy preference. Conventional training objectives tend to overfit these errors, while existing denoising approaches often rely on homogeneous noise assumptions tha…

Cited by 0SourceScholar
2026

PISA: Privacy-Preserving Split Adaptation with Model IP Protection

ICML 2026poster

Fine-tuning Large Language Models (LLMs) enables data holders to construct proprietary, task-specific models by leveraging external high-performance computing infrastructure. However, existing paradigms typically address data privacy and model intellectual property (IP) in isolation, failing to simu…

Cited by 0SourceScholar
2026

PrivSV: Differentially Private Steering Vector for Large Language Models

AAAI 2026technical

Steering Vector (SV) is a powerful technique for controlling Large Language Models (LLMs) by manipulating their activations without altering model weights. However, when constructed from sensitive data, SV poses significant privacy risks, as it may leak private information. Existing differential pri

Cited by 0SourcePDFScholar
2026

Unbiased Reward Modeling from Implicit Preference

ICML 2026poster

Despite the success of reinforcement learning from human feedback (RLHF) in aligning language models, current reward modeling heavily relies on explicit preference data with high collection costs. In this work, we study implicit reward modeling---learning reward models from implicit human feedback--…

Cited by 0SourceScholar
2026

Unified Minimax Optimization Framework for Propensity Score Estimation in Debiased Recommendation

AAAI 2026technical

Recommendation systems commonly face selection bias from missing-not-at-random (MNAR) collected data. To address this bias, propensity-based methods such as inverse propensity scoring (IPS) and doubly robust (DR) estimators are widely used. In addition, many methods extend the vanilla IPS and DR to

Cited by 0SourcePDFScholar
2025

Unveiling Extraneous Sampling Bias with Data Missing-Not-At-Random

NeurIPS 2025poster

Selection bias poses a widely recognized challenge for unbiased evaluation and learning in many industrial scenarios. For example, in recommender systems, it arises from the users' selective interactions with items. Recently, doubly robust and its variants have been widely studied to achieve debiase…

Cited by 0SourcecodeScholar