← Search

Rahul Madhavan

6 accepted papers

2026

Robust Reward Modeling via Causal Rubrics

ICLR 2026poster

Reward models (RMs) are fundamental to aligning Large Language Models (LLMs) via human feedback, yet they often suffer from reward hacking. They tend to latch on to superficial or spurious attributes, such as response length or formatting, mistaking these cues learned from correlations in training d…

Cited by 0SourceScholar
2025

AMPO: Active Multi Preference Optimization for Self-play Preference Selection

ICML 2025poster

Multi-preference optimization enriches language-model alignment beyond pairwise preferences by contrasting entire sets of helpful and undesired responses, enabling richer training signals for large language models. During self-play alignment, these models often produce numerous candidate answers per…

Cited by 0SourcePDFScholar
2025

CARMO: Dynamic Criteria Generation for Context Aware Reward Modelling

ACL 2025finding

Reward modeling in large language models is known to be susceptible to reward hacking, causing models to latch onto superficial features such as the tendency to generate lists or unnecessarily long responses. In RLHF, and more generally during post-training, flawed reward signals often lead to outpu…

Cited by 0SourcePDFScholar
2024

Time-Reversal Provides Unsupervised Feedback to LLMs

NeurIPS 2024spotlight

Large Language Models (LLMs) are typically trained to predict in the forward direction of time. However, recent works have shown that prompting these models to look back and critique their own generations can produce useful feedback. Motivated by this, we explore the question of whether LLMs can be…

Cited by 0SourcePDFScholar
2023

CFL: Causally Fair Language Models Through Token-level Attribute Controlled Generation

ACL 2023findings

We propose a method to control the attributes of Language Models (LMs) for the text generation task using Causal Average Treatment Effect (ATE) scores and counterfactual augmentation. We explore this method, in the context of LM detoxification, and propose the Causally Fair Language (CFL) architectu…

Cited by 5SourcePDFScholar
2023

Learning good interventions in causal graphs via covering

UAI 2023poster

We study the causal bandit problem that entails identifying a near-optimal intervention from a specified set A of (possibly non-atomic) interventions over a given causal graph. Here, an optimal intervention in A is one that maximizes the expected value for a designated reward variable in the graph,…