{"total":13,"rows":[{"id":"2406.02900","title":"Scaling Laws for Reward Model Overoptimization in Direct Alignment Algorithms","created":"2024-06-05","cited_by_count":143,"area":"alignment"},{"id":"2405.16436","title":"Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizer","created":"2024-05-26","cited_by_count":109,"area":"alignment"},{"id":"2407.13399","title":"Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization","created":"2024-07-18","cited_by_count":78,"area":"alignment"},{"id":"2405.19316","title":"Robust Preference Optimization through Reward Model Distillation","created":"2024-05-29","cited_by_count":67,"area":"alignment"},{"id":"2409.20370","title":"The Perfect Blend: Redefining RLHF with Mixture of Judges","created":"2024-09-30","cited_by_count":43,"area":"alignment"},{"id":"2409.17407","title":"Post-hoc Reward Calibration: A Case Study on Length Bias","created":"2024-09-25","cited_by_count":29,"area":"alignment"},{"id":"2407.08770","title":"Model Surgery: Modulating LLM's Behavior Via Simple Parameter Editing","created":"2024-07-11","cited_by_count":23,"area":"alignment"},{"id":"2412.09544","title":"Sail into the Headwind: Alignment via Robust Rewards and Dynamic Labels against Reward Hacking","created":"2024-12-12","cited_by_count":13,"area":"alignment"},{"id":"2410.01735","title":"LASeR: Learning to Adaptively Select Reward Models with Multi-Armed Bandits","created":"2024-10-02","cited_by_count":7,"area":"alignment"},{"id":"2505.23316","title":"Proximalized Preference Optimization for Diverse Feedback Types: A Decomposed Perspective on DPO","created":"2025-05-29","cited_by_count":5,"area":"alignment"},{"id":"2412.16475","title":"When Can Proxies Improve the Sample Complexity of Preference Learning?","created":"2024-12-21","cited_by_count":1,"area":"alignment"},{"id":"2605.00155","title":"Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback","created":"2026-04-30","cited_by_count":0,"area":"alignment"},{"id":"2606.01382","title":"Efficient Exploration for Iterative Nash Preference Optimization","created":"2026-05-31","cited_by_count":0,"area":"alignment"}],"next_cursor":null}