{"total":18,"rows":[{"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.21046","title":"Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHF","created":"2024-05-31","cited_by_count":106,"area":"alignment"},{"id":"2503.21878","title":"Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment","created":"2025-03-27","cited_by_count":97,"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":"2409.17401","title":"Zeroth-Order Policy Gradient for Reinforcement Learning from Human Feedback without Reward Inference","created":"2024-09-25","cited_by_count":12,"area":"alignment"},{"id":"2412.10616","title":"Hybrid Preference Optimization for Alignment: Provably Faster Convergence Rates by Combining Offline Preferences with Online Exploration","created":"2024-12-13","cited_by_count":6,"area":"alignment"},{"id":"2502.00657","title":"LLM Safety Alignment is Divergence Estimation in Disguise","created":"2025-02-02","cited_by_count":6,"area":"alignment"},{"id":"2507.07981","title":"Why is Your Language Model a Poor Implicit Reward Model?","created":"2025-07-10","cited_by_count":6,"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":"2406.07455","title":"Reinforcement Learning from Human Feedback without Reward Inference: Model-Free Algorithm and Instance-Dependent Analysis","created":"2024-06-11","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":"2510.13022","title":"On the Role of Preference Variance in Preference Optimization","created":"2025-10-14","cited_by_count":3,"area":"alignment"},{"id":"2410.05527","title":"DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback","created":"2024-10-07","cited_by_count":2,"area":"alignment"},{"id":"2604.19024","title":"Policy Gradient Primal-Dual Method for Safe Reinforcement Learning from Human Feedback","created":"2026-04-21","cited_by_count":2,"area":"alignment"},{"id":"2603.20453","title":"Regret Bounds for Reinforcement Learning from Multi-Source Imperfect Preferences","created":"2026-03-20","cited_by_count":1,"area":"alignment"},{"id":"2604.00200","title":"Offline Constrained RLHF with Multiple Preference Oracles","created":"2026-03-31","cited_by_count":1,"area":"alignment"},{"id":"2605.15697","title":"Distributed Zeroth-Order Policy Gradient for Networked Multi-agent Reinforcement Learning from Human Feedback","created":"2026-05-15","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}