{"total":49,"rows":[{"id":"2406.10216","title":"Regularizing Hidden States Enables Learning Generalizable Reward Model for LLMs","created":"2024-06-14","cited_by_count":142,"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":"2410.08847","title":"Unintentional Unalignment: Likelihood Displacement in Direct Preference Optimization","created":"2024-10-11","cited_by_count":67,"area":"alignment"},{"id":"2503.01067","title":"All Roads Lead to Likelihood: The Value of Reinforcement Learning in Fine-Tuning","created":"2025-03-03","cited_by_count":59,"area":"alignment"},{"id":"2409.11704","title":"From Lists to Emojis: How Format Bias Affects Model Alignment","created":"2024-09-18","cited_by_count":49,"area":"alignment"},{"id":"2503.11701","title":"A Survey of Direct Preference Optimization","created":"2025-03-12","cited_by_count":36,"area":"alignment"},{"id":"2501.12735","title":"Online Preference Alignment for Language Models via Count-based Exploration","created":"2025-01-22","cited_by_count":26,"area":"alignment"},{"id":"2410.17055","title":"Optimal Design for Reward Modeling in RLHF","created":"2024-10-22","cited_by_count":25,"area":"alignment"},{"id":"2502.07460","title":"Logarithmic Regret for Online KL-Regularized Reinforcement Learning","created":"2025-02-11","cited_by_count":22,"area":"alignment"},{"id":"2502.04270","title":"PILAF: Optimal Human Preference Sampling for Reward Modeling","created":"2025-02-06","cited_by_count":20,"area":"alignment"},{"id":"2407.18676","title":"Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift","created":"2024-07-26","cited_by_count":13,"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":"2502.15145","title":"Projection Optimization: A General Framework for Multi-Objective and Multi-Group RLHF","created":"2025-02-21","cited_by_count":11,"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":"2412.16834","title":"Online Learning from Strategic Human Feedback in LLM Fine-Tuning","created":"2024-12-22","cited_by_count":10,"area":"alignment"},{"id":"2505.19770","title":"Understanding the Performance Gap in Preference Learning: A Dichotomy of RLHF and DPO","created":"2025-05-26","cited_by_count":10,"area":"alignment"},{"id":"2410.20727","title":"Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment","created":"2024-10-28","cited_by_count":9,"area":"alignment"},{"id":"2502.00666","title":"Avoiding $\\mathbf{exp(R_{max})}$ scaling in RLHF through Preference-based Exploration","created":"2025-02-02","cited_by_count":8,"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":"2505.15694","title":"A Unified Theoretical Analysis of Private and Robust Offline Alignment: from RLHF to DPO","created":"2025-05-21","cited_by_count":8,"area":"alignment"},{"id":"2406.15753","title":"The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret","created":"2024-06-22","cited_by_count":6,"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":"2601.08421","title":"Coverage Improvement and Fast Convergence of On-policy Preference Learning","created":"2026-01-13","cited_by_count":6,"area":"alignment"},{"id":"2503.00030","title":"RSPO: Regularized Self-Play Alignment of Large Language Models","created":"2025-02-24","cited_by_count":5,"area":"alignment"},{"id":"2505.20556","title":"Learning a Pessimistic Reward Model in RLHF","created":"2025-05-26","cited_by_count":5,"area":"alignment"},{"id":"2512.23816","title":"Improved Bounds for Private and Robust Alignment","created":"2025-12-29","cited_by_count":5,"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":"2510.13512","title":"Offline and Online KL-Regularized RLHF under Differential Privacy","created":"2025-10-15","cited_by_count":4,"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":"2509.03672","title":"SharedRep-RLHF: A Shared Representation Approach to RLHF with Diverse Preferences","created":"2025-09-03","cited_by_count":2,"area":"alignment"},{"id":"2510.03269","title":"General Exploratory Bonus for Optimistic Exploration in RLHF","created":"2025-09-27","cited_by_count":2,"area":"alignment"},{"id":"2510.18713","title":"Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options","created":"2025-10-21","cited_by_count":2,"area":"alignment"},{"id":"2510.23590","title":"Lightweight Robust Direct Preference Optimization","created":"2025-10-27","cited_by_count":2,"area":"alignment"},{"id":"2602.00603","title":"Direct Preference Optimization with Rating Information: Practical Algorithms and Provable Gains","created":"2026-01-31","cited_by_count":2,"area":"alignment"},{"id":"2406.12205","title":"On the Exponential Convergence for Offline RLHF with Pairwise Comparisons","created":"2024-06-18","cited_by_count":1,"area":"alignment"},{"id":"2506.08681","title":"Mitigating Reward Over-optimization in Direct Alignment Algorithms with Importance Sampling","created":"2025-06-10","cited_by_count":1,"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":"2505.18952","title":"Online Knowledge Distillation with Reward Guidance","created":"2025-05-25","cited_by_count":0,"area":"alignment"},{"id":"2509.22633","title":"Towards Efficient Online Exploration for Reinforcement Learning with Human Feedback","created":"2025-09-26","cited_by_count":0,"area":"alignment"},{"id":"2511.12867","title":"Bootstrapping LLMs via Preference-Based Policy Optimization","created":"2025-11-17","cited_by_count":0,"area":"alignment"},{"id":"2602.06239","title":"Provably avoiding over-optimization in Direct Preference Optimization without knowing the data distribution","created":"2026-02-05","cited_by_count":0,"area":"alignment"},{"id":"2603.08145","title":"DARC: Disagreement-Aware Alignment via Risk-Constrained Decoding","created":"2026-03-09","cited_by_count":0,"area":"alignment"},{"id":"2605.04477","title":"Data-dependent Exploration for Online Reinforcement Learning from Human Feedback","created":"2026-05-06","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":"2609.06893","title":"Towards Bridging the Gap Between Offline and Iterative Alignment via Preference Distillation","created":"2026-09-07","cited_by_count":0,"area":"alignment"}],"next_cursor":null}