Challenge: Repeated random sampling is a widely used method that independently queries the model multiple times to generate outputs.
Approach: They propose a more efficient method for iterative data generation and model re-training that leverages tree-based tree-derived generation framework to enable more efficient sampling.
Outcome: The proposed method significantly outperforms repeated random sampling in best-of-N sampling on AlpacaEval and Arena-Hard.

Similar Papers

Finding the Sweet Spot: Preference Data Construction for Scaling Preference Optimization (2025.acl-long)

Copied to clipboard

Challenge: Large language models generate unintended outputs due to their unsupervised nature.
Approach: They propose a method to construct preference pairs of selected and rejected LLMs by repeated random sampling to improve alignment performance.
Outcome: The proposed method improves performance as the sample size increases.
Mirroring Users: Towards Building Preference-aligned User Simulator with User Feedback in Recommendation (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models lack specific task alignment and large-scale simulations are challenging due to their ambiguity, noise and massive volume.
Approach: They propose a framework that leverages user feedback in RSs with advanced LLM capabilities to generate high-quality simulation data.
Outcome: The proposed framework boosts the alignment with human preferences and in-domain reasoning capabilities of the fine-tuned LLMs.
Contrastive Policy Gradient: Aligning LLMs on sequence-level scores in a supervised-friendly fashion (2024.emnlp-main)

Copied to clipboard

Challenge: Reinforcement Learning (RL) is a method used to fine tune Large Language Models (LLMs) using a reward model trained from preference data to better align with human judgment.
Approach: They propose a Reinforcement Learning (RL) algorithm that can estimate the optimal policy even from off-policy data.
Outcome: The proposed algorithm can estimate the optimal policy even from off-policy data.
Fine-Tuning Language Models with Reward Learning on Policy (2024.naacl-long)

Copied to clipboard

Challenge: Reinforcement learning from human feedback (RLHF) is an effective approach to align large language models (LLMs) to human preferences.
Approach: They propose a framework that refines a reward model using policy samples to keep it on-distribution.
Outcome: The proposed framework outperforms the state-of-the-art on three benchmark datasets showing that it can learn robust representations of policy samples.
RS-DPO: A Hybrid Rejection Sampling and Direct Preference Optimization Method for Alignment of Large Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Reinforcement learning with human feedback (RLHF) is widely employed to align large language models with user intent.
Approach: They propose to combine rejection sampling and direct preference optimization to improve alignment with user intent by identifying pairs of contrastive samples from human annotator and alternative LLMs.
Outcome: The proposed method outperforms existing methods including RS, PPO, and DPO in a limited resource environment.
Learning Preference Model for LLMs via Automatic Preference Data Generation (2023.emnlp-main)

Copied to clipboard

Challenge: Existing training methods for large language models rely on human-annotated data.
Approach: They propose to learn the preference model for LLMs via automatic preference data generation (AutoPM) using HHH-guided preference data, they show reliability and potential .
Outcome: The proposed approach enables LLMs to learn human preferences and align with human values.
User Feedback Alignment for LLM-powered Exploration in Large-scale Recommendation Systems (2025.acl-industry)

Copied to clipboard

Challenge: Large Language Models (LLMs) can be used to broaden user experiences beyond established preferences and reinforce feedback loops.
Approach: They propose a hierarchical approach that combines hierarchic planning with LLM inference-time scaling to improve recommendation relevancy without compromising novelty.
Outcome: The proposed approach shows significant gains in both user satisfaction and exploration diversity.
Beyond Online Sampling: Bridging Offline-to-Online Alignment via Dynamic Data Transformation for LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Direct Preference Optimization (DPO) eliminates complex reward modeling in aligning large language models with human preferences, but its online variant faces significant efficiency bottlenecks due to costly real-time preference sampling and the reward model annotation.
Approach: They propose a framework that transforms static datasets into dynamically adaptive equivalents without the need for an explicit reward model.
Outcome: The proposed approach matches or exceeds the performance of a fully online DPO.
Aligning LLMs with Individual Preferences via Interaction (2025.coling-main)

Copied to clipboard

Challenge: Existing studies on LLMs alignment focus on generalizing their behavior to generalized values such as helpfulness, harmlessness, and honesty.
Approach: They train large language models to "interact to align" to implicitly infer user preferences . they use a multi-turn preference dataset to generate a personalized alignment .
Outcome: The proposed method enables dynamic, personalized alignment via interaction with a multi-turn preference dataset.
Improving Preference Alignment of LLM with Inference-Free Self-Refinement (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models (LLMs) develop in-context learning capability through pretraining and instruction tuning.
Approach: Large language models (LLMs) develop in-context learning capability through pretraining and instruction tuning.
Outcome: Experiments show that incorporating IFSR into preference alignment yields performance improvement over 10%.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations