{"total":33,"rows":[{"id":"2312.11456","title":"Iterative Preference Learning from Human Feedback: Bridging Theory and Practice for RLHF under KL-Constraint","created":"2023-12-18","cited_by_count":350,"area":"alignment"},{"id":"2301.11270","title":"Principled Reinforcement Learning with Human Feedback from Pairwise or $K$-wise Comparisons","created":"2023-01-26","cited_by_count":247,"area":"alignment"},{"id":"2404.03715","title":"Direct Nash Optimization: Teaching Language Models to Self-Improve with General Preferences","created":"2024-04-04","cited_by_count":178,"area":"alignment"},{"id":"2401.04056","title":"A Minimaximalist Approach to Reinforcement Learning from Human Feedback","created":"2024-01-08","cited_by_count":144,"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":"2405.19320","title":"Value-Incentivized Preference Optimization: A Unified Approach to Online and Offline RLHF","created":"2024-05-29","cited_by_count":73,"area":"alignment"},{"id":"2405.19316","title":"Robust Preference Optimization through Reward Model Distillation","created":"2024-05-29","cited_by_count":67,"area":"alignment"},{"id":"2401.16335","title":"Iterative Data Smoothing: Mitigating Reward Overfitting and Overoptimization in RLHF","created":"2024-01-29","cited_by_count":57,"area":"alignment"},{"id":"2406.01462","title":"The Importance of Online Data: Understanding Preference Fine-tuning via Coverage","created":"2024-06-03","cited_by_count":55,"area":"alignment"},{"id":"2402.07314","title":"Online Iterative Reinforcement Learning from Human Feedback with General Preference Model","created":"2024-02-11","cited_by_count":52,"area":"alignment"},{"id":"2403.03185","title":"Correlated Proxies: A New Definition and Improved Mitigation for Reward Hacking","created":"2024-03-05","cited_by_count":50,"area":"alignment"},{"id":"2405.20495","title":"Transfer Q Star: Principled Decoding for LLM Alignment","created":"2024-05-30","cited_by_count":48,"area":"alignment"},{"id":"2403.01857","title":"Reward Model Learning vs. Direct Policy Optimization: A Comparative Analysis of Learning from Human Preferences","created":"2024-03-04","cited_by_count":27,"area":"alignment"},{"id":"2406.04274","title":"Self-Play with Adversarial Critic: Provable and Scalable Offline Alignment for Language Models","created":"2024-06-06","cited_by_count":16,"area":"alignment"},{"id":"2307.12975","title":"Provable Benefits of Policy Learning from Human Preferences in Contextual Bandit Problems","created":"2023-07-24","cited_by_count":13,"area":"alignment"},{"id":"2510.24700","title":"Greedy Sampling Is Provably Efficient for RLHF","created":"2025-10-28","cited_by_count":11,"area":"alignment"},{"id":"2410.08067","title":"Reward-Augmented Data Enhances Direct Preference Alignment of LLMs","created":"2024-10-10","cited_by_count":10,"area":"alignment"},{"id":"2503.06810","title":"Mitigating Preference Hacking in Policy Optimization with Pessimism","created":"2025-03-10","cited_by_count":8,"area":"alignment"},{"id":"2601.08421","title":"Coverage Improvement and Fast Convergence of On-policy Preference Learning","created":"2026-01-13","cited_by_count":6,"area":"alignment"},{"id":"2510.13694","title":"Information-Theoretic Reward Modeling for Stable RLHF: Detecting and Mitigating Reward Hacking","created":"2025-10-15","cited_by_count":5,"area":"alignment"},{"id":"2405.12421","title":"A Unified Linear Programming Framework for Offline Reward Learning from Human Demonstrations and Feedback","created":"2024-05-20","cited_by_count":4,"area":"alignment"},{"id":"2502.06861","title":"Design Considerations in Offline Preference-based RL","created":"2025-02-08","cited_by_count":4,"area":"alignment"},{"id":"2502.19255","title":"Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective","created":"2025-02-26","cited_by_count":4,"area":"alignment"},{"id":"2505.21395","title":"Square$\\chi$PO: Differentially Private and Robust $\\chi^2$-Preference Optimization in Offline Direct Alignment","created":"2025-05-27","cited_by_count":3,"area":"alignment"},{"id":"2506.01523","title":"Beyond RLHF: A Unified Theoretical Framework of Alignment","created":"2025-06-02","cited_by_count":3,"area":"alignment"},{"id":"2510.05526","title":"Provably Mitigating Corruption, Overoptimization, and Verbosity Simultaneously in Offline and Online RLHF/DPO Alignment","created":"2025-10-07","cited_by_count":1,"area":"alignment"},{"id":"2603.19987","title":"Breaking the Capability Ceiling of LLM Post-Training by Reintroducing Markov States","created":"2026-03-20","cited_by_count":1,"area":"alignment"},{"id":"2606.09073","title":"A Unifying Lens on Reward Uncertainty in RLHF","created":"2026-06-08","cited_by_count":1,"area":"alignment"},{"id":"2412.21001","title":"LEASE: Offline Preference-based Reinforcement Learning with High Sample Efficiency","created":"2024-12-30","cited_by_count":0,"area":"alignment"},{"id":"2510.00144","title":"Which Rewards Matter? Reward Selection for Reinforcement Learning under Limited Feedback","created":"2025-09-30","cited_by_count":0,"area":"alignment"},{"id":"2510.26301","title":"Offline Clustering of Preference Learning with Active-data Augmentation","created":"2025-10-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"},{"id":"2608.15402","title":"Towards a theory of inference-time alignment with unknown rewards","created":"2026-08-15","cited_by_count":0,"area":"alignment"}],"next_cursor":null}